|
Evaluation strategy
Programmingevaluation Eager Lazy Partial Remote Short-circuit Strategy In computer science, an evaluation strategy is a set of (usually deterministic) rules for determining the evaluation of expres...
en.wikipedia.org/wiki/Evaluation_strategy |
||
|
The original design for Better Scheme was built around lazy evaluation as embodied in the call by need semantics. structures. Part of this choice was however based on the mistaken assumption that call by need could be used to replace all forms of macros.
|
||
|
A call-by-need lambda calculus We present a calculus that captures the operational semantics of call-by-need. The call-by-need lambda calculus is confluent, has a notion of standard reduction, and entails the same observational equivalence relation as the call-by-name calculus.
|
||
|
@INPROCEEDINGS{Ariola95acall-by-need, author = {Zena M. Ariola and Matthias Felleisen and John Maraist and Martin Odersky and Philip Wadler}, title = {A call-by-need lambda calculus}, booktitle = {}, year = {1995}, pages = {233--246}, 15 A call by need lambda calculus – Ariola, Felleisen, et al. - 1995...
|
||
|
This paper examines the transformation of call by need terms into continuation passing style CPS It begins by presenting a simple transformation of call by need terms into program graphs and a reducer for such graphs. Call-by-need and Continuation-passing Style (1993) (Make Corrections) (16 citations) Chris Okasaki,
|
||
|
Depending on what functionality you want to have in your msort build. Below is an example where you might like to sort by more than one key. We have Excellent Product Knowledge, Great Pricing, Free Shipping. Linked by Eugenia Loli Queru on Sun th Jul UTC.
|
||
|
We present an operational semantics for parallel call-by-need, that accurately models parallel behaviour in non-strict parallel functional languages.
|
||
|
@misc{ ariola95callbyneed, author = "Z. Ariola and M. Felleisen and J. Maraist and M. Odersky and P. Wadler", title = "A call-by-need lambda calculus", text = "Zena Ariola, Matthias Felleisen, John Maraist, Martin Odersky, and Philip Wadler.
|
||
|
@misc{ ariola98correctness, author = "Z. Ariola and A. Sabry", title = "Correctness of monadic state: An imperative call-by-need calculus", text = "Zena M. Ariola and Amr Sabry. - 1996 169 A call-by-need lambda calculus - Ariola, Felleisen et al. -
|
||
|
The theory is a strictly smaller theory than the lambda calculus. Immediate applications of the theory concern the correctness proofs of a number of implementation strategies, e.g., the call-by-need continuation passing transformation and the realization of sharing via assignments.
|
