Observational Equivalence for the Interaction Combinators and Internal Separation

Authors:
Damiano Mazza
Affiliations:
Institut de Mathématiques de Luminy (UMR 6206), Campus de Luminy, Case 907, 13288 Marseille Cedex 9, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 5
Cited 0

Interaction nets

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
Interaction combinators

Information and Computation
Operational equivalence for interaction nets

Theoretical Computer Science - Latin American theoretical informatics
Locus Solum: From the rules of logic to the logic of rules

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We define an observational equivalence for Lafont's interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting a deadlock-free normal form) respecting reduction. More interestingly, this equivalence enjoys an internal separation property similar to that of Bohm's Theorem for the @l-calculus.