Step-Indexed Kripke Models over Recursive Worlds

Cited 7 time in webofscience Cited 0 time in scopus
  • Hit : 195
  • Download : 0
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 Chargueraud 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.
Publisher
ASSOC COMPUTING MACHINERY
Issue Date
2011-01
Language
English
Article Type
Article
Citation

ACM SIGPLAN NOTICES, v.46, no.1, pp.119 - 131

ISSN
0362-1340
DOI
10.1145/1925844.1926401
URI
http://hdl.handle.net/10203/225284
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0