The weak lambda calculus as a reasonable machine

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus can simulate each other within a polynomial time overhead. The model only relies on combinatorial properties of the usual beta-reduction, without any reference to a specific machine or evaluator. In particular, the cost of a single beta reduction is proportional to the difference between the size of the redex and the size of the reduct. In this way, the total cost of normalizing a lambda term will take into account the size of all intermediate results (as well as the number of steps to normal form).

[1]  Andrea Asperti.  On the complexity of beta-reduction , 1996, POPL '96.

[2]  Harry G. Mairson,et al.  On global dynamics of optimal graph reduction , 1997, ICFP '97.

[3]  Peter van Emde Boas,et al.  Machine Models and Simulation , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[4]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[5]  J. Roger Hindley,et al.  To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[6]  Simona Ronchi Della Rocca,et al.  The Parametric Lambda Calculus , 2004, Texts in Theoretical Computer Science.

[7]  G. Frandsen,et al.  What is an Efficient Implementation of the lambda-calculus? , 1991 .

[8]  Martin Hofmann,et al.  Quantitative Models and Implicit Complexity , 2005, FSTTCS.

[9]  Luca Paolini,et al.  The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science) , 2004 .

[10]  Jean-Jacques Lévy,et al.  Sharing in the Weak Lambda-Calculus , 2005, Processes, Terms and Cycles.

[11]  Andrea Asperti,et al.  The optimal implementation of functional programming languages , 1998, Cambridge tracts in theoretical computer science.

[12]  Harry G. Mairson,et al.  Optimality and inefficiency: what isn't a cost model of the lambda calculus? , 1996, ICFP '96.

[13]  Mariangiola Dezani-Ciancaglini,et al.  Complexity of lambda-term reductions , 1979, RAIRO Theor. Informatics Appl..

[14]  John Lamping.  An algorithm for optimal lambda calculus reduction , 1989, POPL '90.

[15]  Ugo Dal Lago,et al.  An Invariant Cost Model for the Lambda Calculus , 2005, CiE.

[16]  Ron Dinishak.  The optimal implementation of functional programming languages , 2000, SOEN.

[17]  Vincent Danos,et al.  Head Linear Reduction , 2004 .

[18]  P. Boas.  Machine models and simulations , 1991 .

[19]  de Ng Dick Bruijn.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .