Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Interaction nets and term-rewriting systems
Theoretical Computer Science - Special issue: trees in algebra and programming
Interaction nets for linear logic
Theoretical Computer Science
A Calculus for Interaction Nets
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
A Theory of Operational Equivalence for Interaction Nets
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Coinductive Techniques for Operational Equivalence of Interaction Nets
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
Towards a Programming Language for Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Interaction nets are graph rewriting systems which are a generalisation of proof nets for classical linear logic. The linear chemical abstract machine (CHAM) is a term rewriting system which corresponds to classical linear logic, via the Curry-Howard isomorphism. We can obtain a textual calculus for interaction nets which is surprisingly similar to linear CHAM based on the multiplicative fragment of classical linear logic. In this paper we introduce a framework based on the linear CHAM to model interaction net reduction. We obtain a textual calculus for interaction nets that is closer to the graphical representation than previous attempts.