Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
Our approach is based on a recent line of work where challenging features of programming languages and logics are modelled using a common solution: Kripke ...
J. Schwinghammer, L. Birkedal, and K. Støvring. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces.
Jun 8, 2023 · 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 ...
Abstract. Over the last decade, there has been extensive research on mod- elling challenging features in programming languages and program.
Idea first developed using domain-theoretic model of programming language [BST - FOSSACS'09, MSCS'10]. Now show that it applies to operational semantics via.
Unary models type safety program logics for higher-order store logics for concurrency and storable locks. Relational models contextual equivalences.
) [as in step-indexed models] involves solving world equation in category of preordered ultrametric spaces ... Strand IV: Step-Indexed Kripke Models over Rec.
Step-Indexed Kripke Models over Recursive Worlds ; Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, ...
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 ...
constructing (step-indexed) recursive possible worlds based on a programming ... Step-indexed Kripke models over recursive worlds. In: POPL (2011), to appear.