Editing Abstract machine (section)

=== Functional programming languages ===
[[File:Machine de Krivine.jpg|thumb|Pictorial representation of a [[Krivine machine]]]]The early abstract machines for [[Functional programming|functional languages]], including the [[SECD machine]] (1964) and Cardelli's Functional Abstract Machine (1983), defined strict evaluation, also known as [[Evaluation strategy|eager or call-by-value evaluation]],<ref name=":1" /> in which function arguments are evaluated before the call and precisely once. Recently, the majority of research has been on [[Lazy evaluation|lazy (or call-by-need) evaluation]],<ref>{{Cite journal |last1=Hackett |first1=Jennifer |last2=Hutton |first2=Graham |date=2019-07-26 |title=Call-by-need is clairvoyant call-by-value |journal=Proceedings of the ACM on Programming Languages |volume=3 |issue=ICFP |pages=1–23 |doi=10.1145/3341718 |s2cid=195782686 |issn=2475-1421|doi-access=free }}</ref> such as the G-machine (1984), [[Krivine machine]] (1985), and Three Instruction Machine (1986), in which function arguments are evaluated only if necessary and at most once. One reason is because effective implementation of strict evaluation is now well-understood, therefore the necessity for an abstract machine has diminished.<ref name=":1" />