Isomorphisms of types in the presence of higher-order references

From MaRDI portal
Publication:2904625

DOI10.2168/LMCS-8(3:8)2012zbMATH Open1256.68043arXiv1112.3198OpenAlexW2031775786MaRDI QIDQ2904625FDOQ2904625

Pierre Clairambault

Publication date: 15 August 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1112.3198






Cited In (7)


   Recommendations





This page was built for publication: Isomorphisms of types in the presence of higher-order references

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904625)