Principal typing in elementary affine logic

DOI10.1007/3-540-44904-3_7MaRDI QIDQ4457451zbMATH OpenFDO

Authors Paolo Coppola, Simona Ronchi Della Rocca

Publication date 22 March 2004

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/2701/27010090.htm

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 2182488
• A feasible algorithm for typing in elementary affine logic
• Type inference for light affine logic via constraints on words
• Optimizing optimal reduction
• Elementary affine logic and the call-by-value lambda calculus

Cited in

(8)

• (Optimal) duplication is not elementary recursive
• Principal type-schemes and condensed detachment
• scientific article; zbMATH DE number 2182488 (Why is no real title available?)
• Elementary affine logic and the call-by-value lambda calculus
• A feasible algorithm for typing in elementary affine logic
• Phase semantics and decidability of elementary affine logic
• Type inference for light affine logic via constraints on words
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

This page was built for publication: Principal typing in elementary affine logic

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