![]() In safe compilation modes, avoid turning an error like (let ([x (values 1 2)]) x) or (car (list (values 1 2))) into a program that returns multiple values or (if (list (values 1 2)) 3 4) into a program that returns without an error. In addition, refrain from moving an expression from a non-tail position within a procedure to a tail position, unless the expression is not only single valued but also gauarnteed not to inspect the immediate continuation (e.g., using `call/cc` and comparing the result to a previously captured continuation). This constraint applies even in unsafe compilation modes, because the intent it to provide some guarantees about non-tail positions to complement existing guarantees of tail positions. original commit: 91e9631576e7b97137be856e985609320e327f32 |
||
---|---|---|
.travis | ||
c | ||
csug | ||
examples | ||
makefiles | ||
mats | ||
nanopass@1f7e80bcff | ||
release_notes | ||
s | ||
stex@3bd2b86cc5 | ||
unicode | ||
wininstall | ||
zlib@cacf7f1d4e | ||
.gitattributes | ||
.gitignore | ||
.gitmodules | ||
.travis.yml | ||
bintar | ||
BUILDING | ||
CHARTER.md | ||
checkin | ||
configure | ||
CONTRIBUTING.md | ||
LICENSE | ||
LOG | ||
newrelease | ||
NOTICE | ||
README.md | ||
scheme.1.in | ||
workarea |
Chez Scheme is both a programming language and an implementation of that language, with supporting tools and documentation.
As a superset of the language described in the Revised6 Report on the Algorithmic Language Scheme (R6RS), Chez Scheme supports all standard features of Scheme, including first-class procedures, proper treatment of tail calls, continuations, user-defined records, libraries, exceptions, and hygienic macro expansion.
Chez Scheme also includes extensive support for interfacing with C and other languages, support for multiple threads possibly running on multiple cores, non-blocking I/O, and many other features.
The Chez Scheme implementation consists of a compiler, run-time system, and programming environment. Although an interpreter is available, all code is compiled by default. Source code is compiled on-the-fly when loaded from a source file or entered via the shell. A source file can also be precompiled into a stored binary form and automatically recompiled when its dependencies change. Whether compiling on the fly or precompiling, the compiler produces optimized machine code, with some optimization across separately compiled library boundaries. The compiler can also be directed to perform whole-program compilation, which does full cross-library optimization and also reduces a program and the libraries upon which it depends to a single binary.
The run-time system interfaces with the operating system and supports, among other things, binary and textual (Unicode) I/O, automatic storage management (dynamic memory allocation and generational garbage collection), library management, and exception handling. By default, the compiler is included in the run-time system, allowing programs to be generated and compiled at run time, and storage for dynamically compiled code, just like any other dynamically allocated storage, is automatically reclaimed by the garbage collector.
The programming environment includes a source-level debugger, a mechanism for producing HTML displays of profile counts and program "hot spots" when profiling is enabled during compilation, tools for inspecting memory usage, and an interactive shell interface (the expression editor, or "expeditor" for short) that supports multi-line expression editing.
The R6RS core of the Chez Scheme language is described in The Scheme Programming Language, which also includes an introduction to Scheme and a set of example programs. Chez Scheme's additional language, run-time system, and programming environment features are described in the Chez Scheme User's Guide. The latter includes a shared index and a shared summary of forms, with links where appropriate to the former, so it is often the best starting point.
Get started with Chez Scheme by Building Chez Scheme.
For more information see the Chez Scheme Project Page.