Open AccessConnection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics
Author(s) -
Kurt Villads Jensen
Publication year - 1978
Publication title -
daimi pb
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.