Step-indexed Kripke models over recursive worlds

Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, Hongseok Yang

41 Citations (Scopus)

Abstract

Over the last decade, there has been extensive research on modelling challenging features in programming languages and program logics, such as higher-order store and storable resource invariants. A recent line of work has identified a common solution to some of these challenges: Kripke models over worlds that are recursively defined in a category of metric spaces. In this paper, we broaden the scope of this technique from the original domain-theoretic setting to an elementary, operational one based on step indexing. The resulting method is widely applicable and leads to simple, succinct models of complicated language features, as we demonstrate in our semantics of Charguéraud and Pottier's type-and-capability system for an ML-like higher-order language. Moreover, the method provides a high-level understanding of the essence of recent approaches based on step indexing.

Original languageEnglish
JournalA C M / S I G P L A N Notices
Volume46
Issue number1
Pages (from-to)119-131
Number of pages13
ISSN1523-2867
DOIs
Publication statusPublished - Jan 2011
Event38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - Austin, United States
Duration: 26 Jan 201128 Jan 2011
Conference number: 38

Conference

Conference38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Number38
Country/TerritoryUnited States
CityAustin
Period26/01/201128/01/2011

Fingerprint

Dive into the research topics of 'Step-indexed Kripke models over recursive worlds'. Together they form a unique fingerprint.

Cite this