# Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

@article{Mazza2009ObservationalEA, title={Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators}, author={Damiano Mazza}, journal={Logical Methods in Computer Science}, year={2009}, volume={5} }

- Published in Logical Methods in Computer…2009
DOI:10.2168/LMCS-5(4:6)2009

The symmetric interaction combinators are an equally expressive variant of
Lafont's interaction combinators. They are a graph-rewriting model of
deterministic computation. We define two notions of observational equivalence
for them, analogous to normal form and head normal form equivalence in the
lambda-calculus. Then, we prove a full abstraction result for each of the two
equivalences. This is obtained by interpreting nets as certain subsets of the
Cantor space, called edifices, which play the… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## On context semantics and interaction nets

VIEW 18 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators

VIEW 9 EXCERPTS

CITES BACKGROUND & METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 38 REFERENCES