A quantitative model for simply typed λ-calculus

DOI10.1017/S0960129521000256OpenAlexW3214783275MaRDI QIDQ5875894FDOQ5875894

Authors: Martin Hofmann, Jérémy Ledent 

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

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

zbMATH Keywords

lambda-calculuslength spacesquantitative semanticsresource monoid

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
• What is a model for a semantically linear  -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)