Graph Reduction

Graph Reduction

List price: US$41.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.Combinator graph reduction is a fundamental implementation technique for functional programming languages, in which a program is converted into a combinator representation which is mapped to a directed graph data structure in computer memory, and program execution then consists of rewriting parts of this graph so as to move towards useful results.
show more

Product details

  • Paperback | 56 pages
  • 152 x 229 x 3mm | 95g
  • Dicho
  • United States
  • English
  • 6136617463
  • 9786136617466