Chicken Scheme: Difference between revisions
Content added Content deleted
(Chicken Scheme) |
(→External Links: fixed wiki url) |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 1:
{{implementation|Scheme}}{{compiler}}'''Chicken Scheme''' is an R5RS compliant compiler for the [[Scheme|Scheme programming language]]. It produces [[C]] code as output.
Chicken Scheme is implemented in
▲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'''.
===External Links===
* [http://www.call-with-current-continuation.org/ Chicken Website]
* [http://
* [http://home.pipeline.com/~hbaker1/CheneyMTA.html Henry Baker's article "Cheney on the MTA"]
|
Latest revision as of 21:56, 21 June 2011
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.