Typing lambda terms in elementary logic with linear constraints

DOI10.1007/3-540-45413-6_10MaRDI QIDQ2778817zbMATH OpenFDO

Authors Paolo Coppola, Simone Martini

Publication date 21 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2044/20440076

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited in

(10)

• (Optimal) duplication is not elementary recursive
• Controlling Program Extraction in Light Logics
• scientific article; zbMATH DE number 1757128 (Why is no real title available?)
• scientific article; zbMATH DE number 2182488 (Why is no real title available?)
• Pruning simply typed  -terms
• Non-linearity as the metric completion of linearity
• Realizability models and implicit complexity
• Phase semantics and decidability of elementary affine logic
• Type inference for light affine logic via constraints on words
• A semantic proof of polytime soundness of light affine logic

This page was built for publication: Typing lambda terms in elementary logic with linear constraints

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