The Call-by-Need Lambda Calculus (1994)

Cached

Download Links

by John Maraist , Martin Odersky , Philip Wadler
Venue:Journal of Functional Programming
Citations:39 - 2 self

Active Bibliography

28 Call-by-Name, Call-by-Value, Call-by-Need, and the Linear Lambda Calculus – John Maraist, Martin Odersky, David N. Turner, Philip Wadler - 1994
4 The Call-by-Need Lambda Calculus (Unabridged) – John Maraist, Martin Odersky, Philip Wadler - 1994
62 Models of Sharing Graphs: A Categorical Semantics of let and letrec – Masahito Hasegawa - 1997
40 Improvement in a Lazy Context: An Operational Theory for Call-By-Need – Andrew Moran, David Sands - 1999
1 The Call-by-need Lambda Calculus, Revisited – Stephen Chang, Matthias Felleisen
A Survey of Sequential and Parallel Implementation Techniques for Functional Programming Languages – Ralph C. Hilzer, Jr. , Lawrence A. Crowl - 1995
186 Parameter-Passing and the Lambda Calculus – Erik Crank, Matthias Felleisen - 1991
36 Cyclic Lambda Calculi – Zena M. Ariola, Stefan Blom - 1997
6 lambdaS: an implicitly parallel lambda-calculus with recursive bindings, synchronization and side effects – Arvind, Joe E. Stoy, Jan-willem Maessen, Jan-willem Maessen, Rishiyur S. Nikhil, Rishiyur S. Nikhil, Joseph E. Stoy
Author manuscript, published in "Higher Order and Symbolic Computation (2007)" Explaining the lazy Krivine machine using explicit substitution and addresses – Frédéric Lang - 2007
1 Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri - 2009
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri (Hossein) - 2009
10 Dynamic Slicing In Higher-Order Programming Languages – Sandip K. Biswas, Carl A. Gunter, Insup Lee - 1997
3 Addressed Term rewriting Systems: . . . – Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori - 2006
2 What is an Efficient Implementation of the λ-calculus? – Gudmund S. Frandsen, Carl Sturtivant - 1991
2 What is an Efficient Implementation of the λ-calculus? – Gudmund S. Frandsen, Carl Sturtivant - 1991
1 Denotational semantics for lazy initialization of letrec black – Keiko Nakata
8 Small-step and big-step semantics for call-by-need – Keiko Nakata, et al. - 2009
7 On Global Dynamics of Optimal Graph Reduction – Julia L. Lawall, Harry G. Mairson - 1997