|
The '''history of the programming language [[Scheme (programming language)|Scheme]] programming language''' begins with the development of earlier members of the [[Lisp (programming language)|Lisp]] family of languages during the second half of the twentieth century,. During the process of design and development duringperiod whichof Scheme, language designers [[Guy L. Steele]] and [[Gerald Jay Sussman]] released an influential series of [[Massachusetts Institute of Technology]] (MIT) [[AI Memo]]s known as the ''[[Lambda Papers]]'' (1975–1980),. This resulted in the growth inof popularity ofin the language, and the era of standardization (from 1990 onwards)onward. Much of the history of Scheme has been documented by the developers themselves.<ref name="steele_history">Guy{{cite web |url=http://www-mips.unice.fr/~roy/JAOO-SchemeHistory-2006public.pdf |title=History of Scheme |last=Steele, |first=Guy |date=2006, |website=Sun Microsystems Laboratories, [http|format=PDF slideshow |access-date=2023-04-05 |archive-date=2023-03-02 |archive-url=https://researchweb.sunarchive.comorg/projectsweb/plrg20230302184733/http://www-mips.unice.fr/~roy/JAOO-SchemeHistory-2006public.pdf History|url-status=bot: ofunknown Scheme] (slideshow, PDF)}}</ref>
==Prehistory==
{{Expand section|date=January 2011}}
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 [[scopeScope (programmingcomputer science)|lexical scope]] and block structure. Scheme is a dialect of Lisp but Lisp has evolved; the Lisp dialects from which Scheme evolved—although they were in the mainstream at the time—are quite different from any modern Lisp. Scheme falls within the large Lisp family of languages that includes Common Lisp, Scheme, ISLisp, EuLisp, XLisp, and AutoLisp.
===Lisp===
{{detailsfurther|Lisp (programming language)}}
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="MCCARTHYMcCarthy">{{cite web |url=http://www-formal.stanford.edu/jmc/recursive.html |title=Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I |last=McCarthy |first=John |author-link=John McCarthy (computer scientist) |access-date=2006-10-13 |archive-url=https://web.archive.org/web/20131004215327/http://www-formal.stanford.edu/jmc/recursive.html | accessdatearchive-date=20062013-10-1304 |url-status=dead }}</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.
The use of [[Ss-expression]]s which characterize the syntax of Lisp was initially intended to be an interim measure pending the development of a language employing what McCarthy called "[[Mm-expression]]s". As an example, the Mm-expression <CODE><nowikicode>car[cons[A,B]]</nowiki></CODEcode> is equivalent to the Ss-expression <CODEcode>{{Nowrap|(car (cons A B))}}</CODEcode>. S-expressions proved popular, however, and the many attempts to implement Mm-expressions failed to catch on.
The first implementation of Lisp was on an [[IBM 704]] by [[Steve Russell (computer scientist)|Steve Russell]], who read McCarthy's paper and coded the eval function he described in machine code. The familiar (but puzzling to newcomers) names [[car and cdr|CAR and CDR]] used in Lisp to describe the head element of a list and its tail, evolved from two [[IBM 704]] assembly language commands: Contents of Address Register and Contents of Decrement Register, each of which returned the contents of a 15-bit register corresponding to segments of a [[36-bit IBMcomputing|36-bit]] IBM 704 instruction [[word (computer architecture)|word]].
The first complete Lisp compiler, written in Lisp, was implemented in 1962 by Tim Hart and Mike Levin at MIT.<ref name="LEVINLevin">{{cite web |url=ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-039.pdf |title=AI Memo 39-, The newNew Compiler compiler|last1=Hart author|first1=Tim Hart and Mike |last2=Levin |first2=Mike |archive-url=https://web.archive.org/web/20170706114742/ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-039.pdf |archive-date=2017-07-06 accessdate|url-status=dead |access-date=2006-10-13 }}</ref> This compiler introduced the Lisp model of incremental compilation, in which compiled and interpreted functions can intermix freely.
The two variants of Lisp most significant in the development of Scheme were both developed at MIT: LISP 1.5<ref>{{cite book | url = httphttps://www.softwarepreservationarchive.org/projectsdetails/LISP/book/LISP%201.5%20Programmers%20Manual.pdflisp15programmer00john | title = LISP 1.5 Programmer's Manual | publisher = [[MIT Press]] |last1=McCarthy |first1 = John | last1 author-link=John McCarthy (computer scientist) |last2=Abrahams |first2 = Paul W. | last2 last3= AbrahamsEdwards | first3 = Daniel J. | last3 last4= EdwardsHart | first4 = Timothy P. | last4 last5= HartLevin | first5 = Michael I. | last5 = Levin | isbn = 978-0-262-13011-40 | year=1985 |url-access=registration 1985}}</ref> developed by McCarthy and others, and [[Maclisp|MACLISP]]<ref>{{cite web | url = http://zane.brouhaha.com/~healyzh/doc/lisp.doc.txt | title = Maclisp Reference Manual | date = March 3, 1979 | archiveurl archive-url= httphttps://web.archive.org/web/20071214064433/http://zane.brouhaha.com/~healyzh/doc/lisp.doc.txt | archivedate archive-date= 2007-12-14}}</ref> – developed for MIT's [[Project MAC]], a direct descendant of LISP 1.5. which ran on the PDP-10 and [[Multics]] systems.
Since its inception, Lisp was closely connected with the [[artificial intelligence]] (AI) research community, especially on [[PDP-10]]<ref>. The 36-bit word size of the [[PDP-6]]/ and [[PDP-10]] was influenced by the usefulness of having two Lisp [[18-bit computing|18-bit]] pointers in a singleone word. <ref>{{cite newsgroup | quote = The PDP-6 project started in early 1963, as a [[24-bit computing|24-bit]] machine. It grew to 36 bits for LISP, a design goal. | url = httphttps://groups.google.com/group/alt.folklore.computers/browse_thread/thread/6e5602ce733d0ec/17597705ae289112 | title = The History of TOPS or Life in the Fast ACs | newsgroup = alt.folklore.computers |message-id= 84950@tut.cis.ohio-state.edu | date = 18 October 1990 |last=Hurley author |first= Peter J. Hurley}}</ref> systems.
===ALGOL===
{{detailsFurther|ALGOL}}
[[ALGOL 58]], originally to be called IAL for "International Algorithmic Language", was developed jointly by a committee of European and American computer scientists in a meeting in 1958 at [[ETH Zurich]]. [[ALGOL|ALGOL 60]], a later revision developed at the ALGOL 60 meeting in Paris and now commonly known asnamed [[ALGOL]], became the standard for the publication of algorithms and had a profound effect on future language development, despite the language's lack of commercial success and its limitations. [[C. A. R.Tony Hoare]] has remarked: "Here is a language so far ahead of its time that it was not only an improvement on its predecessors but also on nearly all its successors."<ref>[{{cite book |last=Hoare |first=Tony |author-link=Tony Hoare |date=December 1973 |title=Hints on Programming Language Design |url=http://www.eecs.umich.edu/~bchandra/courses/papers/Hoare_Hints.pdf "Hints|page=27 on}} Programming Language Design"], C.A.R. Hoare, December 1973. Page 27. (This statement is sometimes erroneously attributed to [[Edsger W. Dijkstra]], also involved in implementing the first ALGOL 60 [[compiler]].)</ref>
ALGOL introduced the use of block structure and lexical scope. It was also notorious for its difficult [[call by name]] default parameter passing mechanism, which was defined so as to require textual substitution of the expression representing the actualworking parameter in place of the formal parameter during execution of a procedure or function, causing it to be re-evaluated each time it is referenced during execution. ALGOL implementors developed a mechanism they called a [[thunk]], which captured the context of the actualworking parameter, enabling it to be evaluated during execution of the procedure or function.
==Carl Hewitt, the Actor model, and the birth of Scheme==
{{See also|Actor model|Planner (programming language)|MDL (programming language)}}
In 1971 Sussman, [[Drew McDermott]], and [[Eugene Charniak]] had developed a system called [[Planner_Planner (programming_languageprogramming language)#Micro-planner_implementationplanner implementation|Micro-Planner]] which was a partial and somewhat unsatisfactory implementation of [[Carl Hewitt]]'s ambitious [[Planner (programming language)|Planner]] project. Sussman and Hewitt worked together along with others on Muddle, later renamed [[MDL (programming language)|Muddle (later MDL)]], an extended Lisp which formed a component of Hewitt's ambitious [[Planner (programming language)|Planner]] project. Drew McDermott, and Sussman in 1972 developed the Lisp-based language ''Conniver'', which revised the use of automatic backtracking in Planner which they thought was unproductive. Hewitt was dubious that the "hairy control structure" in Conniver was a solution to the problems with Planner. [[Pat Hayes]] remarked: "Their [Sussman and McDermott] solution, to give the user access to the implementation primitives of Planner, is however, something of a retrograde step (what are Conniver's semantics?)"<ref>Pat{{cite journal |last=Hayes |first=Pat |date=1974 |title=Some Problems and Non-Problems in Representation Theory AISB’74.|journal=Society for the Study of Artificial Intelligence and the Simulation of Behaviour }}</ref>
In November 1972, Hewitt and his students invented the [[Actor model]] of computation as a solution to the problems with Planner.<ref name="hewitt1973">{{cite journal |last1=Hewitt |first1=Carl |author-link=Carl Hewitt |author2last2=Bishop |first2=Peter Bishop|last3=Steiger |author3first3=Richard Steiger|title=A Universal Modular Actor Formalism for Artificial Intelligence |publisher=IJCAI |year=1973}}</ref> A partial implementation of Actors was developed called Planner-73 (later called PLASMA). Steele, then a graduate student at MIT, had been following these developments, and he and Sussman decided to implement a version of the Actor model in their own "tiny Lisp" developed on top of [[MacLispMaclisp]], in order to understand the model better. Using this basis they then began to develop mechanisms for creating actors and sending messages.<ref name="revisited">{{cite journal
|last1=Sussman author |first1=Gerald [[Jay |author-link=Gerald Jay Sussman]] and|last2=Steele [[Jr. |first2=Guy L. |author-link2=Guy L. Steele, Jr.]]
|date = December 1998
| url = http://www.brics.dk/~hosc/local/HOSC-11-4-pp399-404.pdf
| title = The First Report on Scheme Revisited ▼
| format = PDF
| journal = Higher-Order and Symbolic Computation ▼
▲| title = The First Report on Scheme Revisited
▲| journal = Higher-Order and Symbolic Computation
|issue volume = 114
| doi = 10.1023/A:1010079421970 ▼
| s2cid=7704398 |issn = 1388-3690 ▼
▲| doi = 10.1023/A:1010079421970
| accessdateaccess-date = 2006-06-19 ▼
|url-status = dead
▲| accessdate = 2006-06-19
|archive-url = https://web.archive.org/web/20060615225746/http://www.brics.dk/~hosc/local/HOSC-11-4-pp399-404.pdf
|archive-date= 2006-06-15
}}</ref>
PLASMA's use of lexical scope was similar to the [[lambda calculus]]. Sussman and Steele decided to try to model Actors in the lambda calculus. They called their modeling system Schemer, eventually changing it to Scheme to fit the six-character limit on the [[Incompatible_Timesharing_SystemIncompatible Timesharing System|ITS]] file system on their DEC [[PDP-10]]. They soon concluded Actors were essentially closures that never return but instead invoke a [[continuation]], and thus they decided that the closure and the Actor were, for the purposes of their investigation, essentially identical concepts. They eliminated what they regarded as redundant code and, at that point, discovered that they had written a very small and capable dialect of Lisp. Hewitt remained critical of the "hairy control structure" in Scheme<ref>{{cite journal |last=Hewitt |first=Carl |author-link=Carl Hewitt. "|date=December 1976 |title=Viewing Control Structures as Patterns of Passing Messages" |journal=AI Memo 410. December}}</ref><ref>{{cite 1976.journal |last=Hewitt |first=Carl |author-link=Carl Hewitt |date=June 1977 |title=Viewing Control Structures as Patterns of Passing Messages |journal=Journal of Artificial Intelligence. June|volume=8 1977|issue=3 |pages=323–364 |doi=10.1016/0004-3702(77)90033-9 |hdl=1721.1/6272 |hdl-access=free }}</ref> and considered primitives (e.g., <code>START!PROCESS</code>, <code>STOP!PROCESS</code>, and <code>EVALUATE!UNINTERRUPTIBLY</code>) used in the Scheme implementation to be a backward step.
25 years later, in 1998, Sussman and Steele reflected that the minimalism of Scheme was not a conscious design goal, but rather the unintended outcome of the design process. "We were actually trying to build something complicated and discovered, serendipitously, that we had accidentally designed something that met all our goals but was much simpler than we had intended... we realized that the lambda calculus—a small, simple formalism—could serve as the core of a powerful and expressive programming language." <ref name="revisited"/>
On the other hand, Hewitt remained critical of the lambda calculus as a foundation for computation writing "The actual situation is that the λ-calculus is capable of expressing some kinds of sequential and parallel control structures but, in general, not the concurrency expressed in the Actor model. On the other hand, the Actor model is capable of expressing everything in the λ-calculus and more." He has also been critical of aspects of Scheme that derive from the lambda calculus such as reliance on continuation functions and the lack of exceptions.<ref>Carl{{cite HewittarXiv [http://arxiv.org/abs/0907.3330 ActorScriptTM|title=ActorScript: Industrial strength integration of local and nonlocal concurrency for Client-cloud Computing] ArXiv|last=Hewitt |first=Carl |author-link=Carl Hewitt |eprint=0907.3330 |class = cs.PL|year = 2009}}</ref>
==The Lambda Papers==
Between 1975 and 1980 Sussman and Steele worked on developing their ideas about using the lambda calculus, continuations and other advanced programming concepts such as [[Tail_recursion|optimization of [[Tail call|tail recursion]], and published them in a series of [[AI Memo]]s which have become known collectively astermed the "''Lambda Papers"''.<ref name="readscheme_lambda ">[{{cite web |url=http://library.readscheme.org/page1 |archive-url=https://web.htmlarchive.org/web/20180625085633/http://library.readscheme.org/ |url-status=dead |archive-date=2018-06-25 |title=Online version of the Lambda Papers] (|format=PDF format)}}</ref>
=== List of papers ===
==Influence==
Scheme was the first dialect of Lisp to choose [[scopeScope (programmingcomputer science)|lexical scope]]. It was also one of the first programming languages after Reynold's Definitional Language <ref>John{{cite Reynolds.conference |title=Definitional interpreters for higher order programming languages |last=Reynolds |first=John |date=1972 |book-title=ACM Conference Proceedings. 1972.|conference=Association for Computing Machinery }}</ref> to support [[First-class objectcitizen|first-class]] [[continuation]]s. It had a large impact on the effort that led to the development of its sister-language, [[Common Lisp]], to which Guy Steele was a contributor.<ref name="lispworks">LispWorks,{{cite [web |url=http://www.lispworks.com/documentation/HyperSpec/Body/01_ab.htm |title=Common Lisp Hyperspec -– 1.1.2 History] |author=<!--Unstated.--> |date=2005 |website=LispWorks |access-date=2018-12-02}}</ref>
==Standardization==
The Scheme language is [[Technical standard|standardized]] in the official [[Institute of Electrical and Electronics Engineers|IEEE]] (IEEE) standard,<ref name="ieee1178">1178-1990 (R1995) IEEE Standard for the Scheme Programming Language</ref> and a de facto standard called the ''Revised<sup>n</sup> Report on the Algorithmic Language Scheme'' (R''n''RS). The most widely implemented standard is '''R5RS''' (1998),<ref name="r5rs">{{cite journal
| authors last1=Kelsey |first1=Richard Kelsey,|last2=Clinger |first2=William Clinger, Jonathan |last3=Rees et al.|first3=Jonathan
|date=August 1998
| title = Revised<sup>5</sup> Report on the Algorithmic Language Scheme
| url = http://www.schemers.org/Documents/Standards/R5RS/
| journal = Higher-Order and Symbolic Computation
| volume = 11
| issue = 1
| pages = 7–105
| doi = 10.1023/A:1010051815785
|display-authors=etal|url-access=subscription
}}</ref> and a new standard, '''R6RS''',<ref name="r6rs">{{cite journal
| authors = Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton Van Straaten, Robby Findler and Jacob Matthews
|last1=Sperber |first1=Michael |last2=Dybvig |first2=R. Kent |last3=Flatt |first3=Matthew |last4=Van Straaten |first4=Anton |last5=Findler |first5=Robby |last6=Matthews |first6=Jacob
|date=August 2009
| title = Revised<sup>6</sup> Report on the Algorithmic Language Scheme
| url = http://www.r6rs.org/
| journal = Journal of Functional Programming
|volume=19
| issue = S1
| pages = 1–301
| doi = 10.1017/S0956796809990074
}}</ref> was ratified in 2007.<ref>[http://www.r6rs.org/ratification/results.html R6RS ratification-voting results]</ref>
|citeseerx=10.1.1.154.5197 |s2cid=62724224 }}</ref> was ratified in 2007.<ref>{{cite web |url=http://www.r6rs.org/ratification/results.html |title=R6RS ratification-voting results }}</ref> Besides the RnRS standards there are also [[Scheme Requests for Implementation]] documents, that contain additional libraries that may be added by Scheme implementations.
==Timeline==
{{Lisp}}
==References==
{{Reflist}}
<references/>
{{Lisp programming language}}
{{DEFAULTSORT:History Of The Scheme Programming Language}}
[[Category:History of software|Scheme programming language]]
[[Category:Scheme (programming language)]]
[[Category:Software topical history overviews|Scheme programming language]]
| 