Revised report on the algorithmic language scheme (Q1280731)

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.