Decomposing Logical Relations with Forcing - LINA - Langages d'Aspects et de Composants Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2011

Decomposing Logical Relations with Forcing

Résumé

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.
Fichier principal
Vignette du fichier
forcing.pdf (332.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00585717 , version 1 (13-04-2011)

Identifiants

  • HAL Id : hal-00585717 , version 1

Citer

Guilhem Jaber, Nicolas Tabareau. Decomposing Logical Relations with Forcing. 2011. ⟨hal-00585717⟩
621 Consultations
197 Téléchargements

Partager

Gmail Facebook X LinkedIn More