POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
On full abstraction for PCF: I, II, and III
Information and Computation
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Calculus for Interaction Nets
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Sequential and Concurrent Abstract Machines for Interaction Nets
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
A categorical model for the geometry of interaction
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
| Hi-index | 0.00 |
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β -reduction. Traditional presentations of interaction nets are based on graph theory and rely on elementary properties of graph theory. We give here a more explicit presentation based on notions borrowed from Girard's Geometry of Interaction : interaction nets are presented as partial permutations and a composition of nets, the gluing , is derived from the execution formula. We then define contexts and reduction as the context closure of rules. We prove strong confluence of the reduction within our framework and show how interaction nets can be viewed as the quotient of some generalized proof-nets.