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

 
9786136617466: Graph Reduction: Computer science, Functional programming, Lazy evaluation
Brossura
ISBN 10: 6136617463 ISBN 13: 9786136617466
Casa editrice: OmniScriptum, 2026

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
OmniScriptum
Data di pubblicazione
2026
Lingua
Inglese
ISBN 10 
6136617463
ISBN 13 
9786136617466
Rilegatura
Broché
Numero di pagine
56
Redattore
Stawart Delmar Thomas C.
Contatto del produttore
non disponibile
Persona responsabile
non disponibile

Altre edizioni note dello stesso titolo

9783540184201: Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986: 279

Edizione in evidenza

ISBN 10:  3540184201 ISBN 13:  9783540184201
Casa editrice: Springer, 2008
Brossura