A quantitative model for simply typed λ-calculus

Hofmann, Martin and Ledent, Jérémy (2022) A quantitative model for simply typed λ-calculus. Mathematical Structures in Computer Science, 32 (Specia). pp. 777-793. ISSN 1469-8072 (https://doi.org/10.1017/S0960129521000256)

[thumbnail of Hofmann-Ledent-MSCS-2021-A-quantitative-model-for-simply-typed-lambda-calculus]
Text. Filename: Hofmann_Ledent_MSCS_2021_A_quantitative_model_for_simply_typed_lambda_calculus.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (496kB)| Preview


We use a simplified version of the framework of resource monoids, introduced by Dal Lago and Hofmann (2005, 2011), to interpret simply typed λ -calculus with constants zero and successor. We then use this model to prove a simple quantitative result about bounding the size of the normal form of λ -terms. While the bound itself is already known, this is to our knowledge the first semantic proof of this fact. Our use of resource monoids differs from the other instances found in the literature, in that it measures the size of λ -terms rather than time complexity.