Transfinite Step-Indexing: Decoupling Concrete and Logical Steps - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Transfinite Step-Indexing: Decoupling Concrete and Logical Steps

Abstract

Step-indexing has proven to be a powerful technique for defining logical relations for languages with advanced type systems and models of expressive program logics. In both cases, the model is stratified using natural numbers to solve a recursive equation that has no naive solutions. As a result of this stratification, current models require that each unfolding of the recursive equation – each logical step – must coincide with a concrete reduction step. This tight coupling is problematic for applications where the number of logical steps cannot be statically bounded. In this paper we demonstrate that this tight coupling between logical and concrete steps is artificial and show how to loosen it using transfinite step-indexing. We present a logical relation that supports an arbitrary but finite number of logical steps for each concrete step.
Fichier principal
Vignette du fichier
biglater-conf (1).pdf (470.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01408649 , version 1 (14-12-2016)

Identifiers

Cite

Kasper Svendsen, Filip Sieczkowski, Lars Birkedal. Transfinite Step-Indexing: Decoupling Concrete and Logical Steps. 25th European Symposium on Programming Languages and Systems, Dec 2016, Eindhoven, Netherlands. pp.727 - 751, ⟨10.1007/978-3-662-49498-1_28⟩. ⟨hal-01408649⟩

Collections

INRIA INRIA2
108 View
210 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More