Chicken Scheme

Note that Chicken has a very interesting garbage-collection algorithm called "Cheney on the MTA". Basically, the stack is the heap, and no function ever returns. The compiler converts every program to continuation-passing style, where instead of a function returning, it tail-calls a continuation. When the stack exhausts its limit, the runtime longjmps back to a trampoline. Variables captured by the current continuation form the roots of a copying generational GC - the runtime traces every pointer from them and…

I would highly recommend chicken scheme for most projects. It isn't as mature as other ecosystems, but it is getting there fast and is already quite mature and practical. I've used it to build multiple web apps/sites.[0][1] Learn more about the features it provides: http://wiki.call-cc.org/man/4/Getting%20started An index of the many libs it supports: http://wiki.call-cc.org/chicken-projects/egg-index-4.html Why another lisp? http://wiki.call-cc.org/man/4/faq#why-yet-another-scheme-imp... Getting good performance…

It looks like the closest Common Lisp equivalent is ECL? http://ecls.sourceforge.net/

This well-known implementation has been discussed many times on HN, including a major recent thread: https://news.ycombinator.com/item?id=18402567. Before posting something like this, it would be good to check that there haven't been major recent discussions: https://hn.algolia.com/?query=Chicken%20Scheme&sort=byDate&d.... The cutoff point for dupes on HN is about a year, as https://news.ycombinator.com/newsfaq.html explains.