Graph reduction
Efficient version of non-strict evaluation / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Combinator graph reduction?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
This article is about the computer science term. For the graph theory use, see transitive reduction.
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non-strict evaluation is also known as lazy evaluation and used in functional programming languages. The technique was first developed by Chris Wadsworth in 1971.