Decomposing Logical Relations with Forcing

Guilhem Jaber 1, 2 Nicolas Tabareau 2
2 ASCOLA - Aspect and composition languages
Inria Rennes – Bretagne Atlantique , Département informatique - EMN, LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : Logical relations have now the maturity to deal with program equivalence for realistic programming languages with features likes recursive types, higher-order references and first-class continuations. However, such advanced logical relations---which are defined with technical developments like step-indexing or heap abstractions using recursively defined worlds---can make a proof tedious. A lot of work has been done to hide step-indexing in proofs, using Gödel-Löb logic. But to date, step-indexes have still to appear explicitely in particular constructions, for instance when building recursive worlds in a stratified way. In this paper, we go one step further, proposing an extension of Abadi-Plotkin logic with forcing construction which enables to encapsulate reasoning about step-indexing or heap in different layers. Moreover, it gives a uniform and abstract management of step-indexing for recursive terms or types and for higher-order references.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger
Contributeur : Guilhem Jaber <>
Soumis le : mercredi 13 avril 2011 - 18:44:14
Dernière modification le : vendredi 23 février 2018 - 15:28:47
Document(s) archivé(s) le : jeudi 8 novembre 2012 - 16:25:38


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00585717, version 1


Guilhem Jaber, Nicolas Tabareau. Decomposing Logical Relations with Forcing. 2011. 〈hal-00585717〉



Consultations de la notice


Téléchargements de fichiers