Christopher Wadsworth. Semantics and pragmatics of the -calculus. Ph. D. Thesis, Programming Research Group, Oxford University, 1971. 34  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Driving in the Jungle - Secher (Correct)
....that, for a small function oriented programming language, any graph reduction implementation obeying two reasonable rules will lead to the same semantics. We have given two examples of such implementations, one similar to call by need, and one similar to collapsed jungle evaluation. Wadsworth [13] invented call by need for the pure calculus, and proved that normal order (call by need) graph reduction is at least as ecient as normalorder term reduction. for a certain subset of graphs representing terms, and he devised an algorithm for performing normal order reduction. Ho mann Plump ....
Christopher Peter Wadsworth. Semantics and pragmatics of the lambda calculus. Ph.D. thesis, Programming Research Group, Oxford University, September 1971.
Functions, Frames, and Interactions - completing a.. - Reinke (1998) (Correct)
....applicative order reduction does not terminate, regardless of whether the overall term has a normal form or not. It is thus complete only for I terms, but not for general K terms. In his PhD thesis, Wadsworth develops a variant of normal order reduction that is complete and does not copy redices [Wad71, chapter 4] Using graph reduction instead of term reduction, he is able to share reductions in argument terms since copies of arguments are represented as pointers to shared subgraphs. Viewed as term reduction strategy, reducing a redex in one copy of an argument simultaneously reduces all ....
....McCarthy s motive to allow proofs of properties of programs using ordinary mathematical methods and the existence of pure Lisps, the main line of the Lisp family of languages relied on side effects for efficiency reasons. a lazy evaluator that made Wadsworth s call by need evaluation regime [Wad71] available for a purely functional subset of Lisp, providing better means to handle potentially infinite streams (cf. also [FW76] Soon afterwards, Henderson [Hen80] explored the potential of streams and lazy evaluation and described networks of functional processes communicating via potentially ....
Christopher Peter Wadsworth. Semantics and Pragmatics of the Lambda-Calculus. PhD thesis, Programming Research Group, University of Oxford, September 1971.
On Global Dynamics of Optimal Graph Reduction - Lawall, Mairson (1997) (3 citations) (Correct)
....augmenting the syntactic world of the calculus with a sharing mechanism, introducing basic data structures allowing duplicated terms the bane of efficient evaluation to be represented uniquely and reduced without redundancy. A well known evaluation technique of this sort is due to Wadsworth [Wad71]. While these techniques succeed in the efficient sharing of arguments, they suffer from redundancies caused by the necessary copying of shared functions. In foundational research some two decades ago, Jean Jacques L evy attempted to formally characterize what an optimally efficient strategy ....
Christopher Wadsworth. Semantics and pragmatics of the -calculus. Ph. D. Thesis, Programming Research Group, Oxford University.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) (Correct)
No context found.
Christopher Wadsworth. Semantics and pragmatics of the -calculus. Ph. D. Thesis, Programming Research Group, Oxford University, 1971. 34
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) (Correct)
No context found.
Christopher Wadsworth. Semantics and pragmatics of the -calculus. Ph. D. Thesis, Programming Research Group, Oxford University, 1971.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC