Graph Reduction: Computer science, Functional programming, Lazy evaluation - Softcover

 
9786136617466: Graph Reduction: Computer science, Functional programming, Lazy evaluation
Softcover
ISBN 10: 6136617463 ISBN 13: 9786136617466
Publisher: OmniScriptum, 2026

Synopsis

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.

"synopsis" may belong to another edition of this title.

Publisher
OmniScriptum
Publication date
2026
Language
English
ISBN 10 
6136617463
ISBN 13 
9786136617466
Binding
Broché
Number of pages
56
Editor
Stawart Delmar Thomas C.

Other Popular Editions of the Same Title

9783540184201: Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science, 279)

Featured Edition

ISBN 10:  3540184201 ISBN 13:  9783540184201
Publisher: Springer, 1987
Softcover