Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

Details Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

2009-06-01

arxiv.org/abs/0906.0380v3

LMCS 5 (4:6) 2009

Computer Science

Logic in Computer Science

Scientific paper

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 same role as Boehm trees in the theory of the lambda-calculus.

Affiliated with

Also associated with

No associations

Rating

Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234260