Typed Lambda Calculi and Applications
From MaRDI portal
Publication:5704029
DOI10.1007/b135690zbMath1114.03049OpenAlexW2501230561MaRDI QIDQ5704029
Patrick Baillot, Kazushige Terui
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135690
Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (8)
Modular Inference of Linear Types for Multiplicity-Annotated Arrows ⋮ Light logics and optimal reduction: completeness and complexity ⋮ An Elementary Affine λ-Calculus with Multithreading and Side Effects ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item ⋮ Light types for polynomial time computation in lambda calculus ⋮ Type Inference for a Polynomial Lambda Calculus ⋮ Quantum implicit computational complexity
This page was built for publication: Typed Lambda Calculi and Applications
