Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics | Zendy

Kurt Jensen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics

Author(s) -

Kurt Jensen

Publication year - 1978

Publication title -

daimi report series

Language(s) - English

Resource type - Journals

eISSN - 2245-9316

pISSN - 0105-8517

DOI - 10.7146/dpb.v7i86.6502

Subject(s) - denotational semantics , denotational semantics of the actor model , normalisation by evaluation , predicate transformer semantics , programming language , dijkstra's algorithm , computer science , action semantics , continuation , operational semantics , domain theory , semantics (computer science) , notation , theoretical computer science , discrete mathematics , mathematics , graph , arithmetic , shortest path problem

It is important to define and relate different semantic methods. In particular it is interesting to compare semantics for program- verification with those aimed for program execution. In this paper the intuitive background for a number of different semantics is given. They are all reformulated to the notation of denotational semantics and compared. It is shown that Dijkstra's weakest predicate theory is satisfied by a denotational continuation-semantics. The present paper is an improved and shortened version of DAIMI PB-61.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research