Isomorphisms of types in the presence of higher-order references

Details Isomorphisms of types in the presence of higher-order references Isomorphisms of types in the presence of higher-order references

2011-12-14

arxiv.org/abs/1112.3198v1

Computer Science

Logic in Computer Science

Twenty-Sixth Annual IEEE Symposium on Logic In Computer Science (LICS 2011), Toronto : Canada (2011)

Scientific paper

10.1109/LICS.2011.32

We investigate the problem of type isomorphisms in a programming language with higher-order references. We first recall the game-theoretic model of higher-order references by Abramsky, Honda and McCusker. Solving an open problem by Laurent, we show that two finitely branching arenas are isomorphic if and only if they are geometrically the same, up to renaming of moves (Laurent's forest isomorphism). We deduce from this an equational theory characterizing isomorphisms of types in a finitary language with higher order references. We show however that Laurent's conjecture does not hold on infinitely branching arenas, yielding a non-trivial type isomorphism in the extension of this language with natural numbers.

Affiliated with

Also associated with

No associations

Rating

Isomorphisms of types in the presence of higher-order references 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 Isomorphisms of types in the presence of higher-order references, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isomorphisms of types in the presence of higher-order references will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-227438