Elsevier

Theoretical Computer Science

Volume 85, Issue 2, 12 August 1991, Pages 283-303
Theoretical Computer Science

Continuations in possible-world semantics

https://doi.org/10.1016/0304-3975(91)90184-4Get rights and content
Under an Elsevier user license
open archive

Abstract

Earlier work has shown that a form of possible-world semantics allows elegant solutions to certain difficult problems in the modelling of local-variable declarations and noninterference specifications in a generalization of Hoare's logic suitable for algol 60-like languages with procedures. In this work it is shown how jumps and block expressions can be treated in this framework.

Cited by (0)

This work was supported in part by an operating grant from the Natural Sciences and Engineering Research Council of Canada, and by a grant from the Information Technology Research Centre of Ontario.