Papers1 provider · 1 record
November 29, 2021· Mathematical Structures in Computer Science
article
Open access

A quantitative model for simply typed λ-calculus

Abstract

Abstract 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.

Community

0 comments
Use Connect Wallet in the navigation

No discussion yet

Be the first to share a question or observation.