Web Directory

» 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

» 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

» 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/

» Macros That Work
   A paper by Will Clinger and Jonathan Rees (1991) which describes a modified form of Kohlbecker's algorithm for reliably hygienic macro expansion in block-structured languages where macros are source-to-source transformations specified using a high-level p
   ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/prop/macros_that_work.tex.gz

» Macros in Scheme
   A paper by Will Clinger (1991) explaining the Scheme hygienic 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

» 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

» 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/

» 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://citeseer.ist.psu.edu/rd/0%2C95701%2C1%2C0.25%2CDownload/http://citeseer.ist.psu.edu/cache/papers/cs/886/ftp:zSzzSzftp.cs.indiana.eduzSzindrazSzscheme-repositoryzSzdoczSzpropzSzblume-mod.pdf/blume94separate.pdf

» 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

» 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/pubs/3imp.pdf