Chicken Scheme: Difference between revisions
Content added Content deleted
mNo edit summary |
(Implementation, compiler, links) |
||
| Line 1: | Line 1: | ||
'''Chicken Scheme''' is an R5RS compliant compiler for the [[Scheme|Scheme programming language]]. It produces C code as output. |
{{implementation|Scheme}}{{compiler}}'''Chicken Scheme''' is an R5RS compliant compiler for the [[Scheme|Scheme programming language]]. It produces [[C]] code as output. |
||
| ⚫ | |||
| ⚫ | |||
Chicken Scheme uses libraries called '''eggs''' as well as [[SRFI]]s. |
Chicken Scheme uses libraries called '''eggs''' as well as [[SRFI]]s. |
||
Revision as of 15:50, 15 January 2009
Chicken Scheme is an implementation of Scheme.
Other implementations of Scheme.
Chicken Scheme is an example of a compiler. You may find the programming tasks that have been solved using it here.
Chicken Scheme is an R5RS compliant compiler for the Scheme programming language. It produces C code as output.
Chicken Scheme is implemented in C, using Henry Baker's "Cheney on the MTA" algorithm which uses the C stack pointer as it's garbage collection allocation pointer.
Chicken Scheme uses libraries called eggs as well as SRFIs.