Scheme (programming language)

related topics
{math, number, function}
{system, computer, user}
{work, book, publish}
{language, word, form}
{car, race, vehicle}
{government, party, election}
{law, state, case}
{school, student, university}
{group, member, jewish}

Scheme is one of the two main dialects of the programming language Lisp. Unlike Common Lisp, the other main dialect, Scheme follows a minimalist design philosophy specifying a small standard core with powerful tools for language extension. Its compactness and elegance have made it popular with educators, language designers, programmers, implementors, and hobbyists. The language's diverse appeal is seen as a strong point, though the consequently wide divergence between implementations is seen as one of the language's weak points.[1]

Scheme was developed at the MIT AI Lab by Guy L. Steele and Gerald Jay Sussman who introduced it to the academic world via a series of memos, now referred to as the Lambda Papers, over the period 1975-1980. The Scheme language is standardized in the official IEEE standard,[2] and a de facto standard called the Revisedn Report on the Algorithmic Language Scheme (RnRS). The most widely implemented standard is R5RS (1998),[3] and a new standard R6RS[4] was ratified in 2007.[5]

Scheme was the first dialect of Lisp to choose lexical scope and the first to require implementations to perform tail-call optimization. It was also one of the first programming languages to support first-class continuations. It had a significant influence on the effort that led to the development of its sister, Common Lisp.[6]

Contents

Full article ▸

related documents
Kolmogorov complexity
Functional programming
Fourier series
Variable
Adjoint functors
Tensor product
Limit (category theory)
Axiom of choice
LR parser
Numeral system
Calculus
Elliptic curve cryptography
Continued fraction
Closure (computer science)
Fast Fourier transform
Binary search tree
Logarithm
Design Patterns
Recurrence relation
Singleton pattern
Algebraic geometry
Collatz conjecture
Topological space
Axiom
Hash table
Computational complexity theory
Hilbert's tenth problem
Markov chain
Dedekind domain
Orthogonal matrix