Bigloo is an implementation of the Scheme programming language. It relies on an optimizing compiler from Scheme to C. Bigloo enables connections between Scheme code and C code. It proposes many extensions to Scheme such as a regular parser compiler, an lalr parser compiler, pattern matching, an object layer, etc.
MIT/GNU Scheme is an implementation of the Scheme programming language, providing an interpreter, compiler, source-code debugger, integrated Emacs-like editor, and a large runtime library. MIT/GNU Scheme is best suited to programming large applications with a rapid development cycle. Recent versions of the system are supported on the following platforms: GNU/Linux, *BSD, OS/2, and Windows.
Petite Chez Scheme is a freely distributable interpreted version of Chez Scheme, a high-performance implementation of ANSI Scheme with numerous extensions. Petite Chez Scheme may be used as a run-time environment for compiled Chez Scheme applications or as a stand-alone Scheme system. With the exception that the compiler is not present, Petite Chez Scheme is completely compatible with Chez Scheme.
SISC is an extensible Java-based interpreter of the algorithmic language Scheme. It uses modern interpretation techniques and handily outperforms all existing Java interpreters (often by more than an order of magnitude). In addition, SISC is a complete implementation of the language. The entire R5RS Scheme standard is supported. This includes a full number tower including complex number support and arbitrary precision integers and floating point numbers, proper tail recursion, hygienic macros, and full support for first-class continuations (not just the escaping continuations found in many other systems).
STklos is a free Scheme System conforming to R5RS. The implementation is based on an ad-hoc Virtual Machine. It can also be compiled as a library, so that one can easily embed it in an application. Its features include an efficient and powerful object system based on CLOS, a simple-to-use module system, implementation of the full tower of numbers defined in R5RS, and easy connection to the GTK+ toolkit. STklos is the successor of STk, a Scheme interpreter tightly connected to the Tk toolkit.
TinyScheme is a lightweight Scheme interpreter that implements as large a subset of R5RS as possible without getting very large and complicated. It is meant to be used as an embedded scripting interpreter for other programs. As such, it does not offer IDEs or extensive toolkits although it does sport a small top-level loop, included conditionally. A lot of functionality in TinyScheme is included conditionally, and it allows multiple interpreter states to coexist in the same program without any interference between them. Foreign functions in C can also be added and values can be defined in the Scheme environment.
A practical lambda-calculator is a normal-order evaluator for the untyped lambda-calculus, extended with convenient commands and shortcuts to make programming in it more productive. Shortcuts are distinguished constants that represent terms. Commands define new shortcuts, activate tracing of all reductions, compare terms modulo alpha-conversion, print all defined shortcuts and evaluation flags, etc. Terms to evaluate and commands are entered at a read-eval-print-loop (REPL) "prompt" or "included" from a file by a special command. A Haskell branch is an embedding of the lambda calculator (as a domain-specific language) into Haskell. The calculator can be used interactively within Hugs or GHCi.