A quantitative model for simply typed λ-calculus

DOI10.1017/S0960129521000256OpenAlexW3214783275MaRDI QIDQ5875894

Jérémy Ledent, Martin Hofmann

Publication date: 6 February 2023

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129521000256

zbMATH Keywords

lambda-calculuslength spacesquantitative semanticsresource monoid

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Realizability models and implicit complexity
• A semantic proof of polytime soundness of light affine logic
• Exact bounds for lengths of reductions in typed λ-calculus
• Tiering as a Recursion Technique
• The Expressiveness of Simple and Second-Order Type Structures
• Definierbare Funktionen imλ-Kalkül mit Typen
• Bounded Linear Logic, Revisited
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Constant time parallel computations in \(\lambda\)-calculus

This page was built for publication: A quantitative model for simply typed λ-calculus