The weak lambda calculus as a reasonable machine

DOI10.1016/j.tcs.2008.01.044zbMath1145.68011OpenAlexW1964861775MaRDI QIDQ930866

Simone Martini, Ugo Dal Lago

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.044

zbMATH Keywords

computational complexitycost modellambda calculusinvariance thesis

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items

Open Call-by-Value, Weak call-by-value lambda calculus as a model of computation in Coq, Realizability models and implicit complexity, Unnamed Item, A semantic proof of polytime soundness of light affine logic, Unnamed Item, The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus, Call-by-value lambda calculus as a model of computation in Coq, COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY, On reduction and normalization in the computational core

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational efficacy of finite-field arithmetic
• Parametric parameter passing \(\lambda\)-calculus
• Optimality and inefficiency
• On global dynamics of optimal graph reduction
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Logical Approaches to Computational Barriers