Graph reduction
From Wiki @ Karl Jones dot com
Revision as of 07:27, 15 September 2016 by Karl Jones (Talk | contribs) (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...")
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.
See also
- Argument of a function
- Evaluation strategy
- Function (programming)
- Functional programming
- Lazy evaluation
- SECD machine
- Graph reduction machine
External links
- Graph reduction @ Wikipedia.org
