Interaction nets for linear logic
From MaRDI portal
Publication:1583245
DOI10.1016/S0304-3975(00)00198-5zbMATH Open0954.03067MaRDI QIDQ1583245FDOQ1583245
Authors: Ian Mackie
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Encoding linear logic with interaction combinators
- Linear logic for nets with bounded resources
- Interaction nets and term-rewriting systems
- Interaction graphs: full linear logic
- scientific article; zbMATH DE number 786495
- scientific article; zbMATH DE number 7359406
- scientific article; zbMATH DE number 1487844
- scientific article; zbMATH DE number 860037
- An Explicit Framework for Interaction Nets
- An explicit framework for interaction nets
Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Linear logic
- Interaction combinators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree-Manipulating Systems and Church-Rosser Theorems
- Applying dispersion correction to numerical approximations of the two‐dimensional wave equation ‐ eigenproblems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interaction nets and term-rewriting systems
- Title not available (Why is that?)
- YALE
- Logic colloquium '88. Proceedings of the colloquium held in Padova, Italy, August 22-31, 1988
- The bologna optimal higher-order machine
Cited In (18)
- Encoding linear logic with interaction combinators
- Proof nets, garbage, and computations
- An explicit framework for interaction nets
- Interactive Logical Structures
- A semantic measure of the execution time in linear logic
- An Explicit Framework for Interaction Nets
- Differential interaction nets
- Title not available (Why is that?)
- A Logical Calculus for Modelling Interferences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interaction nets and term-rewriting systems
- 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
- Title not available (Why is that?)
This page was built for publication: Interaction nets for linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583245)