Stalin (Scheme implementation)
This article relies too much on references to primary sources. (July 2013) (Learn how and when to remove this template message)
|Paradigms||Multi-paradigm: functional, imperative, meta|
|Designed by||Jeffrey Mark Siskind|
|Developer||Jeffrey Mark Siskind|
0.11 / October 2, 2006
|Typing discipline||Dynamic, latent, strong|
In computing, Stalin (STAtic Language ImplementatioN) is a programming language, an aggressive optimizing batch whole-program Scheme compiler written by Jeffrey Mark Siskind. It uses advanced data flow analysis and type inference and a variety of other optimization methods to produce code. Stalin is intended for production use in generating an optimized executable.
The compiler runs slowly, with little or no support for debugging or other niceties. Full R4RS Scheme is supported, with a few minor and rarely encountered omissions. Interfacing to external C libraries is straightforward. The compiler does lifetime analysis and hence does not generate as much garbage as might be expected, but global reclamation of storage is done using the Boehm garbage collector.
The name is a joke: "Stalin brutally optimizes."
- A Google Code project - includes a Windows version and a GUI
- Research Statement by Siskind (compares Stalin with other Scheme compilers, and states that "STALIN often generates code that outperforms handwritten C and Fortran code.")
- Flow-Directed Lightweight Closure Conversion by Siskind (presents a lightweight closure-conversion method that is driven by the results of whole-program interprocedural flow, reachability, points-to, and escape analyses, used in the Stalin compiler)
|This free and open-source software article is a stub. You can help Wikipedia by expanding it.|
|This programming-language-related article is a stub. You can help Wikipedia by expanding it.|