Skip to main content
SpringerLink
Log in

A tractable Scheme implementation

  • Published:
LISP and Symbolic Computation

Abstract

Scheme 48 is an implementation of the Scheme programming language constructed with tractability and reliability as its primary design goals. It has the structural properties of large, compiler-based Lisp implementations: it is written entirely in Scheme, is bootstrapped via its compiler, and provides numerous language extensions. It controls the complexity that ordinarily attends such large Lisp implementations through clear articulation of internal modularity and by the exclusion of features, optimizations, and generalizations that are of only marginal value.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. William Clinger. The Scheme 311 Compiler: An exercise in denotational semantics. InProc. 1984 ACM Symposium on Lisp and Functional Programming, pages 356–364, August 1984.

  2. William Clinger and Jonathan Rees. Macros that work. InConf. Rec. 18 ACM Symposium on Principles of Programming Languages, 1991.

  3. William Clinger and Jonathan Rees. Revised4 report on the algorithmic language Scheme.ACM Lisp Pointers, 4(3):1–55, 1991.

    Google Scholar 

  4. Pavel Curtis and James Rauen. A module system for Scheme. InProc. 1990 ACM Symposium on Lisp and Functional Programming, pages 13–19, 1990.

  5. Chris Hanson. Efficient stack allocation for tail recursive languages. InProc. 1990 ACM Symposium on Lisp and Functional Programming, 1990.

  6. IEEE Std 1178-1990.IEEE Standard for the Scheme Programming Language. Institute of Electrical and Electronic Engineers, Inc., New York, NY, 1991.

    Google Scholar 

  7. Richard Kelsey. Tail-recursive stack disciplines for an interpreter. Technical Report NU-CCS-93-03, Northeastern University College of Computer Science, Boston, MA, 1992.

    Google Scholar 

  8. Richard Kelsey and Paul Hudak. Realistic compilation by program transformation. InConf. Rec. 16 ACM Symposium on Principles of Programming Languages, pages 281–292, 1989.

  9. Peter Lee.Topics in Advanced Language Implementation. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  10. David B. MacQueen. Modules for Standard ML. InProc. 1984 ACM Symposium on Lisp and Functional Programming, pages 198–207, 1984.

  11. Jonathan Rees and Bruce Donald. Program mobile robots in Scheme. InProceedings of the 1992 IEEE International Conference on Robotics and Automation, pages 2681–2688, 1992.

  12. Guy L. Steele.Common Lisp: the Language. Digital Press, Burlington MA, second edition, 1990.

    Google Scholar 

  13. D. Tarditi, A. Acharya, and P. Lee. No assembly required: Compiling Standard ML to C. Technical report, School of Computer Science, Carnegie Mellon University, 1991.

  14. l R. Wilson, Micheal S Lam, and Thomas G. Moher. Effective “static-graph” reorganization to improve locality in garbage collected systems. InProceedings of the Sigplan 1988 Conference on Programming Language Design and Implementation, 1991.

  15. Paul R. Wilson and Thomas G. Moher. Design of the opportunistic garbage collector. InProceedings of the Sigplan 1989 Conference on Object-Oriented Programming: Systems, Languages, and Applications, 1989.

Download references

Author information

Authors and Affiliations

  1. NEC Research Institute, USA

    Richard A. Kelsey

  2. MIT and Cornell University, USA

    Jonathan A. Rees

Authors
  1. Richard A. Kelsey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jonathan A. Rees
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kelsey, R.A., Rees, J.A. A tractable Scheme implementation. LISP and Symbolic Computation 7, 315–335 (1994). https://doi.org/10.1007/BF01018614

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01018614

Keywords

Search

Navigation