Revised Report on the Algorithmic Language Scheme

  • Authors:

  • H. Abelson;R. K. Dybvig;C. T. Haynes;G. J. Rozas;N. I. Adams Iv;D. P. Friedman;E. Kohlbecker;G. L. Steele, Jr.;D. H. Bartley;R. Halstead;D. Oxley;G. J. Sussman;G. Brooks;C. Hanson;K. M. Pitman;M. Wand

  • Affiliations:

  • -;-;-;-;-;-;-;-;-;-;-;-;-;-;-;-

  • Venue:
  • Higher-Order and Symbolic Computation
  • Year:
  • 1998

Quantified Score

Hi-index 0.02

Visualization

Abstract

The report gives a defining description of the programming languageScheme. Scheme is a statically scoped and properly tail-recursive dialect ofthe Lisp programming language invented by Guy Lewis Steele, Jr. and GeraldJay Sussman. It was designed to have an exceptionally clear and simplesemantics and few different ways to form expressions. A wide variety ofprogramming paradigms, including imperative, functional, and message passingstyles, find convenient expression in Scheme.The introduction offers a brief history of the language and of thereport.The first three chapters present the fundamental ideas of the languageand describe the notational conventions used for describing the language andfor writing programs in the language.Sections 5 and 6 describe the syntax and semantics of expressions,programs, and definitions.Section 7 describes Scheme‘s built-in procedures, which include all ofthe language‘s data manipulation and input/output primitives.Section 8 provides a formal syntax for Scheme written in extended BNF,along with a formal denotational semantics. An example of the use of thelanguage follows the formal syntax and semantics.The report concludes with a list of references and an alphabetic indexand is followed by a short list of clarifications and corrections.