| Directory > Computers > Programming > Languages > Lisp > Scheme > Research Interpreter Transformations
Scheme code for Daniel P. Friedman's various transformations on interpreters he presented at the
1996 Scheme Workshop.
http://www.cs.indiana.edu/~dfried/dfried/trans/
Reviews Rating: Not yet Rated
Whois Check
Scheme PLT Publications
Archive contains freely available technical reports and published papers, as well as PhD
dissertations, written by members of the Rice Programming Languages Team.
http://www.cs.rice.edu/CS/PLT/Publications/Scheme/
Reviews Rating: Not yet Rated
Whois Check
Separate compilation for Scheme
(Postscript) A paper by Matthias Blume (1997) which presents an outline of a module system for
Scheme to solve several problems encountered with contemporary implementations.
http://www.cs.princeton.edu/~blume/scm-sc.ps.gz
Reviews Rating: Not yet Rated
Whois Check
Macros That Work
A paper by Will Clinger and Jonathan Rees (1991) which describes a modified form of Kohlbecker's
algorithm for reliably hygenic macro expansion in block-structured languages where macros are
source-to-source transformations specified using a high-level pattern language, all running in O(n)
time.
ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/macros_that_work.tex.gz
Reviews Rating: Not yet Rated
Whois Check
Hygenic Macros through Explicit Renaming
A paper by Will Clinger (1991) which describes an alternative to the low-level macro facility
described in the R4RS. The macrology is based upon the explicit renaming of identifiers.
ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/exrename.ps.gz
Reviews Rating: Not yet Rated
Whois Check
Macros in Scheme
A paper by Will Clinger (1991) explaining the Scheme hygenic macro system by comparison with the
Common Lisp macrology. In GZipped PostScript form.
ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/macinsch.ps.gz
Reviews Rating: Not yet Rated
Whois Check
Proper Tail Recursion and Space Efficiency
A paper by Will Clinger (1998) which offers an implementation independent definition of proper tail
recursion for Scheme. In Gzipped PostScript form.
ftp://ftp.ccs.neu.edu/pub/people/will/tail.ps.gz
Reviews Rating: Not yet Rated
Whois Check
Three Implementation Models for Scheme
R. Kent Dybvig's PhD dissertation (1987) which presents three implementation models for Scheme, a
stack-based model, a string-based model, and a heap-based model.
http://www.cs.indiana.edu/~dyb/papers/3imp-abstract.html
Reviews Rating: Not yet Rated
Whois Check
ICFP '98 Scheme Workshop
Will Clinger's revised (as of 19 Oct 1998) notes on the Scheme Workshop before ICFP '98 in
Baltimore. Many of the subjects discussed at the workshop are now under active discussion as
SRFIs.
http://www.schemers.org/Events/Workshops/Sep1998/minutes
Reviews Rating: Not yet Rated
Whois Check
Tail-Recursive Stack Disciplines for an Interpreter
A paper by Richard Kelsey (1993) which examines several different methods of implementing proper
tail recursion in a stack-based interpreter. Available in GZipped PostScript form.
ftp://ftp.nj.nec.com/pub/kelsey/stack-gc.ps.gz
Reviews Rating: Not yet Rated
Whois Check
PreScheme: A Scheme Dialect for Systems Programming
A paper by Richard Kelsey (1997) describing the development of a dialect of Scheme which is
statically typed and uses type inferencing, partial evaluation, and modern Scheme and Lisp compiler
technology. PreScheme gives the programmer the efficiency and low level access of C but retains
many features of Scheme. Available in GZipped PostScript form.
ftp://ftp.nj.nec.com/pub/kelsey/prescheme.ps.gz
Reviews Rating: Not yet Rated
Whois Check
The Larceny Project
Larceny is a simple and efficient run-time system for Scheme, currently running on the SPARC
architecture. A portable implementation that generates C (dubbed "Petit Larceny") is also
being developed.
http://www.ccs.neu.edu/home/will/Larceny/index.html
Reviews Rating: Not yet Rated
Whois Check
|
