A typed calculus based on a fragment of linear logic

DOI10.1016/0304-3975(89)90168-0zbMath0694.03035OpenAlexW2077306604MaRDI QIDQ908909

Ugo Solitro

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90168-0

zbMATH Keywords

cut eliminationproof-netnormalizationnatural deduction\(\nu\)-calculusChurch-Rosser propertiesmultiplicative second order linear logicsequent rules

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items

Local computation in linear logic, Computational interpretations of linear logic

Cites Work

• Linear logic
• The system \({\mathcal F}\) of variable types, fifteen years later
• The lambda calculus, its syntax and semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item