A feasible algorithm for typing in elementary affine logic

DOI10.1007/11417170_6MaRDI QIDQ5704029zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Optimizing optimal reduction
• Principal typing in elementary affine logic
• Type inference for light affine logic via constraints on words
• scientific article; zbMATH DE number 2182488
• Light logics and optimal reduction: completeness and complexity

Cited in

(14)

• Light types for polynomial time computation in lambda calculus
• Quantum implicit computational complexity
• Combining linear logic and size types for implicit complexity
• An elementary affine -calculus with multithreading and side effects
• Type Inference for a Polynomial Lambda Calculus
• Principal typing in elementary affine logic
• scientific article; zbMATH DE number 2182488 (Why is no real title available?)
• Modular inference of linear types for multiplicity-annotated arrows
• Combining linear logic and size types for implicit complexity
• Optimizing optimal reduction
• Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
• Light logics and optimal reduction: completeness and complexity
• Type inference for light affine logic via constraints on words
• -symsym: an interactive tool for playing with involutions and types

This page was built for publication: A feasible algorithm for typing in elementary affine logic

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