A quantitative model for simply typed λ-calculus

DOI10.1017/S0960129521000256MaRDI QIDQ5875894zbMATH OpenOpenAlexFDO

Authors Martin Hofmann, Jérémy Ledent

Publication date 6 February 2023

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• scientific article; zbMATH DE number 1086680
• Geometry of resource interaction -- \textit{a minimalist approach}
• scientific article; zbMATH DE number 7204443
• Quantitative semantics of the lambda calculus. Some generalisations of the relational model
• A semantics for lambda calculi with resources

Cites work

• A semantic proof of polytime soundness of light affine logic
• Bounded linear logic, revisited
• Constant time parallel computations in \(\lambda\)-calculus
• Definierbare Funktionen imλ-Kalkül mit Typen
• Exact bounds for lengths of reductions in typed -calculus
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 3853055 (Why is no real title available?)
• Realizability models and implicit complexity
• The Expressiveness of Simple and Second-Order Type Structures
• Tiering as a Recursion Technique

Cited in

(4)

• What is a model for a semantically linear  -calculus?
• scientific article; zbMATH DE number 1223630 (Why is no real title available?)
• scientific article; zbMATH DE number 814613 (Why is no real title available?)
• Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875894)