Elementary affine logic and the call-by-value lambda calculus

DOI10.1007/11417170_11MaRDI QIDQ5704005zbMATH OpenOpenAlexFDO

Authors Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca

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) Functional programming and lambda calculus (68N18)

Recommendations

• Light Logics and the Call-by-Value Lambda Calculus
• scientific article; zbMATH DE number 2182488
• Principal typing in elementary affine logic
• Call-by-value, elementary time and intersection types
• From light logics to type assignments: a case study

Cited in

(10)

• Light types for polynomial time computation in lambda calculus
• Call-by-value, elementary time and intersection types
• Light Logics and the Call-by-Value Lambda Calculus
• Type Inference for a Polynomial Lambda Calculus
• From light logics to type assignments: a case study
• Principal typing in elementary affine logic
• scientific article; zbMATH DE number 7356671 (Why is no real title available?)
• scientific article; zbMATH DE number 7594103 (Why is no real title available?)
• Light logics and optimal reduction: completeness and complexity
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

This page was built for publication: Elementary affine logic and the call-by-value lambda calculus

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