Chicken (Scheme implementation)

Short description: Scheme-based programming language implementation

Chicken Scheme

Logo for Chicken Scheme

Chicken 5.0.0 interpreter running on macOS

Paradigms| Multi-paradigm: functional, imperative, meta
Family| Lisp
Designed by| Felix Winkelmann
Developer| The Chicken Team
First appeared| 20 July 2000; 26 years ago (2000-07-20)[1]
Stable release|

5.3.0 / 18 November 2021; 4 years ago (2021-11-18)

Typing discipline| Dynamic, latent, strong
Scope| Lexical
Implementation language| Scheme, C
Platform| IA-32, x86-64, ARM, MIPS, SPARC64, PowerPC
OS| Cross-platform: Windows, Linux, macOS, FreeBSD, NetBSD, OpenBSD, Solaris, AIX, Haiku, Android, iOS
License| BSD
Filename extensions| .scm
Website| {{{1}}}
Influenced by
Lisp, Scheme

Chicken (stylized as CHICKEN) is a programming language, specifically a compiler and interpreter which implement a dialect of the programming language Scheme, and which compiles Scheme source code to standard C. It is mostly R5RS compliant and offers many extensions to the standard. The newer R7RS standard is supported through an extension library.[2] Chicken is free and open-source software available under a BSD license. It is implemented mostly in Scheme, with some parts in C for performance or to make embedding into C programs easier.

## Contents

* 1 Focus
* 2 Design
* 3 Limitations and deviations from the standard
* 4 Add-on software
* 5 Features
* 5.1 Foreign function interface
* 5.2 Cross-compiling
* 5.3 Modules and macros
* 5.4 Remote debugger
* 5.5 Limited static type analysis
* 6 History
* 7 See also
* 8 References
* 9 External links

## Focus

Chicken's focus is quickly clear from its slogan: "A practical and portable Scheme system".

Chicken's main focus is the practical application of Scheme for writing real-world software. Scheme is well known for its use in computer science curricula and programming language experimentation, but it has seen little use in business and industry.[3] Chicken's community has produced a large set of libraries to perform a variety of tasks. The Chicken wiki (the software running it is also a Chicken program) also contains a list of software that has been written in Chicken.[4]

Chicken's other goal is to be portable. By compiling to an intermediate representation, in this case portable C (as do Gambit and Bigloo), programs written in Chicken can be compiled for common popular operating systems such as Linux, macOS, other Unix-like systems, Windows, Haiku, and mobile platforms iOS and Android.[5] It also has built-in support for cross-compiling programs and extensions,[6] which allows it to be used on various embedded system platforms.

## Design

Like many Scheme compilers, Chicken uses standard C as an intermediate representation. A Scheme program is translated into C by the Chicken compiler, and then a C compiler translates the C program into machine code for the target computer architecture, producing an executable program. The universal availability of C makes it useful for this purpose.

Chicken's design was inspired by a 1994 paper[7] by Henry Baker that outlined an innovative strategy to compile Scheme into C. A Scheme program is compiled into C functions. These C functions never reach the return statement; instead, they call a new continuation when complete. These continuations are C functions and are passed on as extra arguments to other C functions. They are calculated by the compiler.

So far, this is the essence of continuation-passing style. Baker's novel idea is to use the C call stack for the Scheme heap. Hence, normal C stack operations such as automatic variable creation, variable-sized array allocation, and so on can be used. When the stack fills up (that is, the stack pointer reaches the top of the stack), a garbage collection can be initiated. The design used is a copying garbage collector originally devised by C. J. Cheney, which copies all live continuations and other live objects to the heap.[8] Despite this, the C code does not copy C stack frames, only Scheme objects, so it does not require knowledge of the C implementation.

In full, the Scheme heap consists of the C stack as the nursery together with the two heaps required by the generational garbage collector. This approach gives the speed of the C stack for many operations, and it allows the use of continuations as simple calls to C functions. Further, Baker's solution guarantees asymptotic tail recursive behavior, as required by the Scheme language standard. The implementation in the Chicken Scheme compiler is even asymptotically safe for space.

## Limitations and deviations from the standard

Chicken Scheme is mostly R5RS-compliant, with a few notable limitations and deviations.[9] R7RS compatibility is supplied as an extension library.[2]

The core system has basic support for UTF-8 characters, however the string indexing and manipulation procedures are not UTF-8 aware. An extension library exists which adds support for full UTF-8 awareness.[10]

## Add-on software

Chicken has a large software repository of added libraries and programs, termed eggs.[11] This system is very similar to RubyGems.[12]

Initially, these eggs were developed in one central svn repository,[13] in which creating a tag would automatically cause a new version of the extension to become available for download. Currently, eggs can be developed anywhere and under any version control system, while still maintaining semi-automatic release management when using most of the popular code hosting sites.[14] This release method is VCS-agnostic in the sense that the user does not need to have these VCSes installed. The developer is free to host anywhere they choose, and can even choose to avoid public version control and distribute only plain tarballs.

For all released eggs, the latest version is tested automatically as part of a continuous integration process. A canonical test server exists,[15] where the core system and all eggs are tested daily against the most recent development version (to catch regressive bugs), and the most recent stable version (to ensure that everything works for users of the stable system). Also, anyone can volunteer to supply further testing capacity, on different: hardware, operating systems, or core releases.

## Features

Chicken supports most of R5RS standard Scheme, but it also adds a few nonstandard features which are not available in all Scheme implementations.

### Foreign function interface

Chicken compiling to C makes it possible to inject custom C code into the compiled result, which eases integrating with C libraries. Its foreign function interface supports converting back and forth between most built-in C types and corresponding Scheme objects.

Also, extension libraries exist for interfacing to Python,[16] Lua,[17] and Java, via Java Native Interface (JNI)[18] or a bridge.[19]

### Cross-compiling

It is relatively easy to cross-compile Scheme code to another platform (for example for embedded use on a device).

To make cross-compiling possible for Scheme code, Chicken imposes a model of separate compiling: A compiled module consists of two shared libraries. One library contains the actual code which will be used at runtime (compiled for the target platform), and the other is an import module, which will be used to load the code which runs at compile-time (on the host platform), such as procedural macro code.

The Chicken compiler can also be easily cross-compiled. After translation to C has been achieved, one can simply use a C compiler which is set up to build for another platform.

### Modules and macros

Since version 4, Chicken has a built-in module system and support for low-level hygienic macros through explicit renaming macros[20] (before version 4, this was available through an add-on library). Standard syntax-rules macros are also supported, and implicit renaming macros,[21] which is basically a reversed version of explicit renaming.

This mechanism trades performance for convenience. Each identifier not explicitly injected as unhygienic will be automatically renamed to avoid name capture. The performance cost occurs because implicit renaming requires the macro-expander to retraverse the expressions two more times. This cost is paid at expansion time, so a macro author must consider if longer compiling times are acceptable.

### Remote debugger

Since version 4.11, Chicken comes shipped with a debugger named Feathers.[22] When Scheme code is compiled with the needed debugging option, debugging events are injected at specific points in the code. These are implemented as calls to a C function, which is relatively low-overhead when not actually debugging the code. When debugging, it will try to make a TCP connection to a Feathers server process, possibly on a different machine. The process is halted, the user may set breakpoints and start the program. Then, when the breakpoint is hit, the client (process being debugged) enters a command loop, which allows interrogation of the client, to read out variables, or mutate them.

### Limited static type analysis

Chicken supports local flow analysis. This allows the compiler to catch variable type errors at compile-time, and perform type specialisation. This specialisation makes it possible to remove several safety checks for type detection at runtime when the type can be deduced at compile-time. This results in improved run-time performance.

This scrutinizer does not allow cross-module flow analysis, so it can only be used to optimize code that's part of one compiling unit (or module).

## History

CHICKEN Scheme was originally developed by Felix Winkelmann on Cygwin/gcc and later Visual C++ 5.0 on Windows 98.[1] He came up with the name "CHICKEN" arbitrarily as the "first thing that came to my mind that day" thinking of a plastic toy of Feathers McGraw on his desk. As the project matured, he decided not to change the name out of superstition.[23]

## See also

* Tail recursion
* Cheney's algorithm
* "M.T.A. (song)", a song reference in Baker's 1994 paper
* Gambit (Scheme implementation)
* Stalin (Scheme implementation)

## References

1. ↑ 1.0 1.1 Winkelmann, Felix. "Announcing the Chicken Scheme-to-C compiler". https://groups.google.com/group/comp.lang.scheme/msg/edfb2da16fd89fae.
2. ↑ 2.0 2.1 evhan (2018-11-09). "r7rs (Chicken manual)". https://wiki.call-cc.org/eggref/5/r7rs.
3. ↑ "Scheme FAQ". http://community.schemewiki.org/?scheme-faq-general. , section "what is Scheme used for?"
4. ↑ Bex, Peter (sjamaan) (2018-08-16). "Software written in Chicken Scheme". https://wiki.call-cc.org/Software.
5. ↑ "Portability". https://wiki.call-cc.org/portability.
6. ↑ Bex, Peter (sjamaan) (2016-05-28). "Cross development". https://wiki.call-cc.org/man/5/Cross development.
7. ↑ Baker, Henry (1994). "CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A.". http://home.pipeline.com/~hbaker1/CheneyMTA.html.
8. ↑ Cheney, C.J. "A Nonrecursive List Compacting Algorithm". CACM 13,11 (Nov. 1970), 677-678.
9. ↑ Bex, Peter (sjamaan); Winkelmann, Felix (2016-05-28). "Confirmed deviations (Chicken manual)". https://wiki.call-cc.org/man/5/Deviations from the standard.
10. ↑ Bex, Peter (sjamaan); kooda (2018-08-11). "utf8 (Chicken manual)". https://wiki.call-cc.org/eggref/5/utf8.
11. ↑ "Chicken eggs". https://eggs.call-cc.org/.
12. ↑ "RubyGems". https://rubygems.org/.
13. ↑ Bex, Peter (sjamaan). "VCS-independent distribution of language extensions". https://www.more-magic.net/posts/vcs-independent-distribution.html. , blogpost on More magic
14. ↑ "Instructions for popular code hosting methods and VCSes". https://wiki.call-cc.org/releasing-your-egg#instructions-for-popular-code-hosting-methods-and-vcses.
15. ↑ "Chicken automated tests". https://tests.call-cc.org/.
16. ↑ iraikov (2016-06-11). "pyffi". https://wiki.call-cc.org/eggref/4/pyffi.
17. ↑ Bex, Peter (sjamaan); iraikov (2012-03-11). "Lua". https://wiki.call-cc.org/eggref/4/lua.
18. ↑ mario; svnwiki (2013-06-04). "JNI". https://wiki.call-cc.org/eggref/4/jni.
19. ↑ Winkelmann, Felix; mario (2013-06-04). "Javahack". https://wiki.call-cc.org/eggref/4/javahack.
20. ↑ Bex, Peter (sjamaan); Winkelmann, Felix (2018-09-23). "Module (Chicken syntax)". https://wiki.call-cc.org/man/5/Module (chicken syntax)#explicit-renaming-macros.
21. ↑ Bex, Peter (sjamaan); Winkelmann, Felix (2018-09-23). "Module (Chicken syntax)". https://wiki.call-cc.org/man/5/Module (chicken syntax)#implicit-renaming-macros.
22. ↑ Bex, Peter (sjamaan) (2018-11-25). "Debugging". https://wiki.call-cc.org/man/5/Debugging.
23. ↑ Croisant, John (2013-06-19). "Behind the Scenes with CHICKEN Scheme and SPOCK (Part 2)" (in en-US). https://spin.atomicobject.com/2013/06/19/chicken-scheme-spock-part-2/.

## External links

* on GitHub

* v
* t
* e

Lisp programming language

Features|

* Automatic storage management
* Conditionals
* Dynamic typing
* Higher-order functions
* Linked lists
* M-expressions (deprecated)
* Read–eval–print loop
* Recursion
* S-expressions
* Self-hosting compiler
* Tree data structures

Object systems|

* Common Lisp Object System (CLOS)
* CommonLoops
* Flavors

Implementations|

| Technical
standard(s)
exists|

| Common
Lisp|

* Allegro Common Lisp
* Armed Bear Common Lisp (ABCL)
* CLISP
* Clozure CL
* CMU Common Lisp (CMUCL)
* Corman Common Lisp
* Embeddable Common Lisp (ECL)
* GNU Common Lisp (GCL)
* LispWorks
* Macintosh Common Lisp
* Mocl
* Movitz
* Poplog
* Steel Bank Common Lisp (SBCL)
* Symbolics Common Lisp

|

Scheme|

* History
* Bigloo
* Chez Scheme
* Chicken
* Gambit
* Game Oriented Assembly Lisp (GOAL)
* Ikarus
* JScheme
* Kawa
* Larceny
* MIT/GNU Scheme
* MultiLisp
* Pocket Scheme
* Racket
* RScheme
* Scheme 48
* SCM
* SIOD
* T
* TinyScheme

ISLISP|

* OpenLisp

Nonstandard|

| Logo|

* MSWLogo
* NetLogo
* StarLogo
* UCBLogo

|

* Arc
* AutoLISP
* BBN LISP
* Clojure
* Dylan (Apple, history)
* Emacs Lisp
* EuLisp
* Franz Lisp, PC-LISP
* Hy
* Interlisp
* Knowledge Engineering Environment
* *Lisp
* LeLisp
* LFE
* Lisp Machine Lisp
* Maclisp
* MDL
* MLisp
* newLISP
* NIL
* PC-LISP
* Picolisp
* Portable Standard Lisp
* RPL
* S-1 Lisp
* SKILL
* Spice Lisp
* Zetalisp

Operating system|

* Common Lisp Interface Manager, McCLIM
* Genera
* Scsh

Hardware|

* Lisp machines
* TI Explorer
* Space-cadet keyboard

Community|

| Standards|

* Scheme Requests for Implementation
* Common Lisp HyperSpec
* X3J13

|

Education|

| Books|

* Common Lisp the Language
* How to Design Programs (HTDP)
* On Lisp
* Practical Common Lisp
* Structure and Interpretation of Computer Programs (SICP)

|

Curriculum|

* ProgramByDesign

Organizations|

* Apple Computer
* Bolt, Beranek and Newman
* Harlequin
* Lucid Inc.
* Massachusetts Institute of Technology (MIT)
* MIT Computer Science and Artificial Intelligence Laboratory (CSAIL)
* Stanford Artificial Intelligence Laboratory
* Symbolics
* University of California, Berkeley
* Xanalys

People|

* Edmund Berkeley
* Daniel G. Bobrow
* William Clinger
* R. Kent Dybvig
* Matthias Felleisen
* Robert Bruce Findler
* Matthew Flatt
* Phyllis Fox
* Paul Graham
* Richard Greenblatt
* Timothy P. Hart
* Louis Hodes
* Mike Levin
* David Luckham
* John McCarthy
* Robert Tappan Morris
* Joel Moses
* David Park
* Steve Russell
* Richard Stallman

Common Lisp|

* Scott Fahlman
* Richard P. Gabriel
* Philip Greenspun (10th rule)
* David A. Moon
* Kent Pitman
* Guy L. Steele Jr.
* Daniel Weinreb

Scheme|

* Shriram Krishnamurthi
* Guy L. Steele Jr.
* Gerald Jay Sussman
* Julie Sussman

Logo|

* Hal Abelson
* Denison Bollay
* Wally Feurzeig
* Brian Harvey
* Seymour Papert
* Mitchel Resnick
* Cynthia Solomon

* Category
* Category
* List

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Chicken (Scheme implementation). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Chicken_(Scheme_implementation)&oldid=240083"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template