Editing Graph reduction (section)

== History ==
The concept of a graph reduction that allows evaluated values to be shared was first developed by [[Chris Wadsworth]] in his 1971 Ph.D. dissertation.<ref>{{Cite journal |last=Hudak |first=Paul |author-link=Paul Hudak |date=September 1989 |title=Conception, evolution, and application of functional programming languages |journal=ACM Computing Surveys |volume=21 |issue=3 |pages=359–411 |citeseerx=10.1.1.83.6505 |doi=10.1145/72551.72554}}</ref> This dissertation was cited by Peter Henderson and James H. Morris Jr. in 1976 paper, “A lazy evaluator”<ref>{{Cite conference |last=Henderson |first=Peter |last2=Morris |first2=James H. |author2-link=James H. Morris|date=1976 |title=A lazy evaluator |conference=POPL '76: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages |language=en |publisher=ACM Press |pages=95–103 |doi=10.1145/800168.811543}}</ref> that introduced the notion of lazy evaluation. In 1976 [[David Turner (computer scientist)|David Turner]] incorporated lazy evaluation into [[SASL programming language|SASL]] using combinators.<ref>{{Cite conference |last=Hudak |first=Paul |author-link=Paul Hudak |last2=Hughes |first2=John |author-link2=John Hughes (computer scientist) |last3=Peyton Jones |first3=Simon |author-link3=Simon Peyton Jones |last4=Wadler |first4=Philip |author-link4=Philip Wadler |title=A History of Haskell: Being Lazy with Class |url=http://haskell.org/haskellwiki/History_of_Haskell |book-title=History of Programming Languages Conference 2007}}</ref>
SASL was an early functional programming language first developed by Turner in 1972.