Call-by-Name, Call-by-Value, Call-by-Need, and the Linear Lambda Calculus (1994)

by John Maraist , Martin Odersky , David N. Turner , Philip Wadler
Citations:26 - 5 self

Documents Related by Co-Citation

166 Parameter-Passing and the Lambda Calculus – Erik Crank, Matthias Felleisen - 1991
541 Light Linear Logic – Jean-yves Girard
272 Computational Interpretations of Linear Logic – Samson Abramsky - 1993
401 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
75 A Taste of Linear Logic – Philip Wadler - 1993
150 Interaction nets – Y Lafont - 1990
92 What is a Categorical Model of Intuitionistic Linear Logic? – G.M. Bierman, A \gamma A, Gamma \delta \gamma C, Gamma I \gamma A, Gamma A B \gamma C, B \gamma C - 1995
79 Dual intuitionistic linear logic – A Barber - 1996
120 types can change the world – Linear - 1990
395 The formulae-as-types notion of construction – W A Howard - 1980
71 Single-threaded polymorphic lambda calculus – Juan Guzman, Paul Hudak - 1990
290 The calculi of lambda-conversion – A Church - 1941
359 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
169 A Natural Semantics for Lazy Evaluation – John Launchbury - 1993
997 The Lambda Calculus: its Syntax and Semantics – H P Barendregt - 1984
85 Is there a use for linear logic? – Philip Wadler - 1991
121 Linear Types Can Change the World! – Philip Wadler - 1990
148 Call-by-name, call-by-value and the lambda-calculus – G D Plotkin
340 Confluent reductions: Abstract properties and applications to term rewriting systems – G Huet - 1980