Content deleted Content added
Tony Sidaway (talk | contribs) |
Tony Sidaway (talk | contribs) |
||
Line 1:
The '''history of the [[Scheme (programming language)|Scheme]] programming language''' begins with the development of earlier members of the [[Lisp (programming language)|Lisp]] family of languages during second half of the twentieth century, the process of design and development during which language designers [[Guy L. Steele]] and [[Gerald Jay Sussman]] released the influential [[Lambda Papers]] (1975-1980), the growth in popularity of the language, and the era of standardization (1990 onwards). Much of the history of Scheme has been documented by the developers themselves.<ref name="steele_history">Guy Steele, 2006, Sun Microsystems Laboratories, [http://research.sun.com/projects/plrg/JAOO-SchemeHistory-2006public.pdf History of Scheme] (slideshow, PDF)</ref>
==Prehistory==
The development of Scheme was heavily influenced by two predecessors that were quite different from one another: [[Lisp (programming language)|Lisp]] provided its general semantics and syntax, and [[ALGOL]] provided its [[[[scope (programming)|lexical scope]] and block structure.
===Lisp===
Lisp was invented by [[John McCarthy (computer scientist)|John McCarthy]] in 1958 while he was at the [[Massachusetts Institute of Technology]] (MIT). McCarthy published its design in a paper in ''[[Communications of the ACM]]'' in 1960, entitled "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I"<ref name="MCCARTHY">{{cite web | title=Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I| author=John McCarthy | url=http://www-formal.stanford.edu/jmc/recursive.html | accessdate=2006-10-13}}</ref> ("Part II" was never published). He showed that with a few simple operators and a notation for functions, one can build a [[Turing-complete]] language for algorithms.
| |||