Isomorphisms of types in the presence of higher-order references

Pierre Clairambault 1, *
* Auteur correspondant
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.
Type de document :
Communication dans un congrès
Twenty-Sixth Annual IEEE Symposium on Logic In Computer Science (LICS 2011), Jun 2011, Toronto, Canada. pp.152 - 161, 2011, <10.1109/LICS.2011.32>


https://hal.archives-ouvertes.fr/hal-00651816
Contributeur : Pierre Clairambault <>
Soumis le : mercredi 14 décembre 2011 - 11:55:24
Dernière modification le : mercredi 14 décembre 2011 - 14:14:33
Document(s) archivé(s) le : vendredi 16 novembre 2012 - 15:31:42

Fichiers

lics2011.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Pierre Clairambault. Isomorphisms of types in the presence of higher-order references. Twenty-Sixth Annual IEEE Symposium on Logic In Computer Science (LICS 2011), Jun 2011, Toronto, Canada. pp.152 - 161, 2011, <10.1109/LICS.2011.32>. <hal-00651816>

Exporter

Partager

Métriques

Consultations de
la notice

62

Téléchargements du document

39