Editing Graph reduction (section)

{{Short description|Efficient version of non-strict evaluation}}
{{About|the computer science term|the graph theory use|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|functional programming languages]]. The technique was first developed by [[Chris Wadsworth]] in 1971.