JavaScript interpreters Jakub T. Jankiewicz (12 Feb 2021 08:25 UTC)
Re: JavaScript interpreters Marc Feeley (12 Feb 2021 12:31 UTC)
Re: JavaScript interpreters Jakub T. Jankiewicz (12 Feb 2021 14:07 UTC)
Re: JavaScript interpreters Marc Feeley (12 Feb 2021 14:54 UTC)
Re: JavaScript interpreters Jakub T. Jankiewicz (12 Feb 2021 17:38 UTC)
How to classify Scheme implementations on Scheme.org Lassi Kortela (14 Feb 2021 07:52 UTC)
Re: How to classify Scheme implementations on Scheme.org Jakub T. Jankiewicz (14 Feb 2021 09:12 UTC)
Re: How to classify Scheme implementations on Scheme.org Lassi Kortela (14 Feb 2021 09:34 UTC)
Re: How to classify Scheme implementations on Scheme.org Marc Feeley (14 Feb 2021 12:54 UTC)
Re: How to classify Scheme implementations on Scheme.org Arthur A. Gleckler (14 Feb 2021 15:45 UTC)
Re: How to classify Scheme implementations on Scheme.org Jakub T. Jankiewicz (14 Feb 2021 16:23 UTC)
Re: How to classify Scheme implementations on Scheme.org Marc Feeley (14 Feb 2021 17:13 UTC)
Re: How to classify Scheme implementations on Scheme.org Lassi Kortela (15 Feb 2021 22:11 UTC)
Re: How to classify Scheme implementations on Scheme.org Lassi Kortela (15 Feb 2021 22:22 UTC)
Re: How to classify Scheme implementations on Scheme.org Marc Feeley (15 Feb 2021 22:36 UTC)
Re: How to classify Scheme implementations on Scheme.org Lassi Kortela (15 Feb 2021 22:40 UTC)
Re: How to classify Scheme implementations on Scheme.org Marc Feeley (15 Feb 2021 22:31 UTC)

Re: How to classify Scheme implementations on Scheme.org Lassi Kortela 15 Feb 2021 22:40 UTC

My guess is still that the best way to present the implementations on
the Scheme.org front page is to divide them into 2 or 3 categories.

We should have a separate, more detailed implementation browser where
one can sort and filter by various criteria, peruse benchmarks and
conformance matrices, etc. But the first impression counts, and should
be something relatively easy to digest.

The most common use cases for Scheme are probably:

- The fastest, most full-featured implementations with threads and
debugger: Gambit, Chez Scheme, MIT Scheme.

- Something light and easy to embed for glue code and scripting:
Chibi-Scheme, S7, TinyScheme.

- Something in between, for substantial portable programs that don't
need especially high performance: Guile, Gauche, Chicken.

However, as far as I know Guile, Gauche, and Chicken all have full
continuations and fully general tail calls, so in that respect they are
no different from the first group.

I don't know about the situation with the tiny interpreters.
https://github.com/lambdaconservatory/femtolisp/blob/master/tiny/lisp.c
from Jeff Bezanson is a pedagogical tree-walking Lisp interpreter in
only 1000 lines of C that nevertheless has lexical scope and proper tail
calls. This interpreter does not have continuations, however.