Revised report on the algorithmic language scheme

DOI10.1023/A:1010051815785MaRDI QIDQ1280731zbMATH OpenOpenAlexWikidataFDO

Authors K. Appert, Harold Abelson, R. Kent Dybvig, Christopher T. Haynes, G. J. Rozas, N. I. IV Adams, Daniel P. Friedman, Eugene Kohlbecker, Guy L. jun. Steele, D. H. Bartley, Robert H. jun. Halstead, D. Oxley, Gerald Jay Sussman, Gary T. Brooks, Catherine Hanson, Kent M. Pitman, Mitchell Wand

Publication date 18 May 1999

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010051815785

zbMATH Keywords

Scheme

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Review text

The programming language Scheme is a statically scoped and tail- recursive dialect of the well-known Lisp programming language. This modern dialect differs in many points from the original Lisp. Scheme has clear and simple semantics and small number of rules for forming expressions sufficient to form an efficient programming language supporting a variety of programming paradigms such as imperative, functional and message passing styles. Procedures in Scheme are distinguished from lambda expressions and symbols and an operator position of a procedure call is evaluated in the same manner as an operand position. In Scheme all known sequential control structured can be synthesized from first class escape procedures. The first version of the Scheme appeared in 1995. At present time many of its local versions exist simultaneously. The authors present a good overview and a complete standard description of the language Scheme.

Recommendations

• Revised\(^{6}\) report on the algorithmic language scheme
• On Revival of Algol-Concepts in Modern Programming and Specification Languages
• scientific article; zbMATH DE number 4076579
• Semantics of algorithmic languages
• scientific article; zbMATH DE number 3862407
• Language prototyping: An algebraic specification approach
• scientific article; zbMATH DE number 3963181
• scientific article; zbMATH DE number 3890710

Cited in

(23)

• Types as graphs: Continuations in type logical grammar
• The carneades model of argument and burden of proof
• A construction of one-point bases in extended lambda calculi
• Report on the Larch shared language
• Encoding types in ML-like languages
• On the call-by-value CPS transform and its semantics
• A static simulation of dynamic delimited control
• Defining actions in concurrent declarative programming
• The anatomy of a loop: a story of scope and control
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• The recursive union of some gradual types
• Revised\(^{6}\) report on the algorithmic language scheme
• Structured Operational Semantics of a fragment of the language Scheme
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
• Component support in PLT scheme
• An operational semantics for Scheme
• Tableless calculation of circular functions on dyadic rationals
• Tail recursion modulo context: an equational approach (extended version)
• BIT: A very compact Scheme system for microcontrollers
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• Implementing metcast in Scheme
• Compilation of extended recursion in call-by-value functional languages
• Combining algebraic effects with continuations

Describes a project that uses

Uses Software

• Scheme

This page was built for publication: Revised report on the algorithmic language scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280731)