Operational semantics: Difference between revisions

Revision as of 02:29, 13 September 2019

Revision as of 05:44, 23 September 2019

Line 7:

because the program could be [[Nondeterministic algorithm|nondeterministic]], and even for a deterministic program there can be many computation sequences since the semantics may not specify exactly what sequence of operations arrives at that value.)

Perhaps the first formal incarnation of operational semantics was the use of the [[lambda calculus]] to define the semantics of [[LISP]].<ref>{{Cite web| title=Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I| author=[[John McCarthy (computer scientist)|John McCarthy]]| url=http://www-formal.stanford.edu/jmc/recursive.html| accessdate=2006-10-13| deadurlurl-status=yesdead| archiveurl=https://web.archive.org/web/20131004215327/http://www-formal.stanford.edu/jmc/recursive.html| archivedate=2013-10-04| df=}}</ref> [[Abstract machine]]s in the tradition of the [[SECD machine]] are also closely related.

== History ==