Search for
Home > Computers > Programming > Languages > Lisp > Scheme >

Research
New! Submit a site
 
whatUseek Collection Sites (submit a site ):
 
Give your site great placement in this category in as little as two business days!
 
 
whatUseek Directory Site Listings:
 
A Practical Soft Type System for Scheme
 
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.
 
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.
 
Interpreter Transformations - Scheme code for Daniel P. Friedman's various transformations on interpreters he presented at the 1996 Scheme Workshop.
 
Larceny - 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.
 
Lecture Notes on the Principles of Programming Languages - By Shriram Krishnamurthi for his COMP 311 class at Rice University. References (with links) to several influential research papers.
 
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.
 
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.
 
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.
 
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.
 
Scheme Implementation Discussion - An online (and unfinished) version of a book by Paul Wilson which provides an introduction to Scheme for programmers and discusses implementation strategies.
 
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.
 
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.
 
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.
Help build the largest human-edited directory on the web.
  Submit a Site - Open Directory Project - Become an Editor  
About   Help   Content Filter   Terms   Privacy Policy

© 2018 whatUseek