Karl Jones: Created page with "In computer science, '''graph reduction''' implements an efficient version of non-strict evaluation, an evaluation strategy where the Argument of a function|argument..."

2016-09-15T14:27:25Z

Created page with "In computer science, '''graph reduction''' implements an efficient version of non-strict evaluation, an evaluation strategy where the Argument of a function|argument..."

New page

In [[computer science]], '''graph reduction''' implements an efficient version of non-strict evaluation, an [[evaluation strategy]] where the [[Argument of a function|arguments]] to a [[Function (programming)|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.

== See also ==

* [[Argument of a function]]
* [[Evaluation strategy]]
* [[Function (programming)]]
* [[Functional programming]]
* [[Lazy evaluation]]
* [[SECD machine]]
* [[Graph reduction machine]]

== External links ==

* [https://en.wikipedia.org/wiki/Graph_reduction Graph reduction] @ Wikipedia.org

[[Category:Computer science]]

Graph reduction - Revision history

Karl Jones: Created page with "In computer science, '''graph reduction''' implements an efficient version of non-strict evaluation, an evaluation strategy where the Argument of a function|argument..."