Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Research topics in functional programming
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving congruence of bisimulation in functional programming languages
Information and Computation
Bisimilarity for a first-order calculus of objects with subtyping
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
YALE: yet another lambda evaluator based on interaction nets
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Semantics and Logics of Computation
Semantics and Logics of Computation
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
Observational Equivalence for the Interaction Combinators and Internal Separation
Electronic Notes in Theoretical Computer Science (ENTCS)
A denotational semantics for the symmetric interaction combinators
Mathematical Structures in Computer Science
Visual Programming with Interaction Nets
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Edifices and full abstraction for the symmetric interaction combinators
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Full abstraction for set-based models of the symmetric interaction combinators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Realizing monads in interaction nets via generic typed rules
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
The notion of contextual (or operational) equivalence is fundamental in the theory of programming languages. By setting up a notion of bisimilarity, and showing that it coincides with contextual equivalence, one obtains a simple coinductive proof technique for showing that two programs are equivalent in all contexts. In this paper we apply these (now standard) techniques to interactions nets, a graphical programming language characterized by local reduction. This work generalizes previous studies of operational equivalence in typed interaction nets since it can be applied to untyped systems, thus all systems of interaction nets are captured.