New Curry-Howard terms for full linear logic

DOI10.1016/S0304-3975(97)00044-3zbMath0896.03046MaRDI QIDQ1390952

John S. Jeavons, David Albrecht, John N. Crossley

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

linear logicnatural deductionstrong normalizationterm calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Computational interpretations of linear logic
• The calculus of constructions
• Bounded linear logic: A modular approach to polynomial-time computability
• Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
• Lambda calculus and intuitionistic linear logic
• Natural deduction for intuitionistic linear logic

This page was built for publication: New Curry-Howard terms for full linear logic