Interaction nets for linear logic

DOI10.1016/S0304-3975(00)00198-5zbMath0954.03067MaRDI QIDQ1583245

Ian Mackie

Publication date: 26 October 2000

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

zbMATH Keywords

linear logiccut-eliminationlocal computationsinteraction nets

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (5)

Unnamed Item ⋮ Encoding linear logic with interaction combinators ⋮ A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine ⋮ A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine ⋮ Universal Boolean Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Interaction combinators
• Interaction nets and term-rewriting systems
• Logic colloquium '88. Proceedings of the colloquium held in Padova, Italy, August 22-31, 1988
• Applying dispersion correction to numerical approximations of the two‐dimensional wave equation ‐ eigenproblems
• The bologna optimal higher-order machine
• YALE
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Interaction nets for linear logic