Hostname: page-component-77c78cf97d-v4t4b Total loading time: 0 Render date: 2026-04-24T09:43:23.209Z Has data issue: false hasContentIssue false
  • English
  • Français

A quantitative model for simply typed λ-calculus

Published online by Cambridge University Press:  29 November 2021

Martin Hofmann  and
Jérémy Ledent Open the ORCID record for Jérémy Ledent [Opens in a new window]
Martin Hofmann
Affiliation:
Institut für Informatik, Ludwig-Maximilians-Universität München, Germany
Jérémy Ledent*
Affiliation:
Mathematically Structured Programming Group, University of Strathclyde, Glasgow, Scotland
*
*Corresponding author. Email: jeremy.ledent@strath.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We use a simplified version of the framework of resource monoids, introduced by Dal Lago and Hofmann, 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.

Keywords

Resource monoidlength spacesquantitative semanticslambda-calculus

Information

Type
Special Issue: In Homage to Martin Hofmann
Information
Mathematical Structures in Computer Science , Volume 32 , Special Issue 6: In Homage to Martin Hofmann , June 2022 , pp. 777 - 793
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial licence (http://creativecommons.org/licenses/by/4.0/), which permits non-commercial re-use, distribution, and reproduction in anymedium, provided the original article is properly cited. The written permission of Cambridge University Press must be obtained prior to any commercial use.
Copyright
© The Author(s), 2021. Published by Cambridge University Press

Footnotes

†

Martin Hofmann died on January 23, 2018. This work was carried out in 2016, while the second author was doing a Masters internship supervised by Martin at the Ludwig Maximilian University of Munich. While he could not take part in writing this article, Martin is undoubtedly an author of the work presented here.

References

Beckmann, A. (2001). Exact bounds for lengths of reductions in typed λ-calculus. Journal of Symbolic Logic 66 (3) 1277–1285.CrossRefGoogle Scholar
Brunel, A. (2015). Quantitative classical realizability. Information and Computation 241 62–95.CrossRefGoogle Scholar
Brunel, A. and Terui, K. (2010). Church => scott = ptime: An application of resource sensitive realizability. In: Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, 31–46.+scott+=+ptime:+An+application+of+resource+sensitive+realizability.+In:+Proceedings+International+Workshop+on+Developments+in+Implicit+Computational+complExity,+DICE+2010,+31–46.>Google Scholar
Dal Lago, U. and Hofmann, M. (2005). Quantitative models and implicit complexity. In: Proceedings of Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005, 189–200.Google Scholar
Dal Lago, U. and Hofmann, M. (2010a). Bounded linear logic, revisited. Logical Methods in Computer Science 6 (4).CrossRefGoogle Scholar
Dal Lago, U. and Hofmann, M. (2010b). A semantic proof of polytime soundness of light affine logic. Theory of Computing Systems 46 (4) 673–689.CrossRefGoogle Scholar
Dal Lago, U. and Hofmann, M. (2011). Realizability models and implicit complexity. Theoretical Computer Science 412 (20) 2029–2047.CrossRefGoogle Scholar
Fortune, S., Leivant, D. and O’Donnell, M. (1983). The expressiveness of simple and second-order type structures. Journal of ACM 30 (1) 151–185.CrossRefGoogle Scholar
Hillebrand, G. G. and Kanellakis, P. C. (1996). On the expressive power of simply typed and let-polymorphic lambda calculi. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996, IEEE Computer Society, 253–263.CrossRefGoogle Scholar
Joly, T. (2001). Constant time parallel computations in lambda-calculus. Theoretical Computer Science 266 (1–2) 975–985.CrossRefGoogle Scholar
Nguyên, L. T. D. 2019. Typed lambda-calculi and superclasses of regular functions.Google Scholar
Nguyên, L. T. D., Noûs, C. and Pradic, P. (2020). Implicit automata in typed λ-calculi II: Streaming transducers vs categorical semantics.Google Scholar
Nguyên, L. T. D. and Pradic, P. (2020). Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, 135:1–135:20.Google Scholar
Schwichtenberg, H. (1975). Definierbare funktionen im λ-kalkül mit typen. Archive for Mathematical Logic 17 (3–4) 113–114.CrossRefGoogle Scholar
Schwichtenberg, H. (1982). Complexity of normalization in the pure typed lambda-calculus. In: Troelstra, A. and van Dalen, D. (eds.) The L. E. J. Brouwer Centenary Symposium, vol. 110, Studies in Logic and the Foundations of Mathematics, Elsevier, 453–457.CrossRefGoogle Scholar
Simmons, H. (2005). Tiering as a recursion technique. The Bulletin of Symbolic Logic 11 (3) 321–350.CrossRefGoogle Scholar