A topological framework for program semantics

Program semantics can be viewed relationally as in relational semantics, algebraically as in predicate transformer semantics, logically as in information systems and order-theoretically as in denotational semantics. This can be compared to a common situation in non-classical logics. Namely, a logic can often be presented as a formal deductive system, as an algebra and as a relational structure, with each of the presentations derivable from each of the other two. The central hypothesis of this thesis is that this situation can serve as a paradigm for unifying the various versions of program semantics. Starting with a relational semantics based on certain ordered topological spaces, called Priestley spaces, and invoking the techniques of Priestley duality, an algebraic. a logical and an order-theoretic presentation of program semantics are derived. Each of these four presentations are also derivable from each of the other three. The topological model of program semantics based on Priestley spaces thus serves as a unifying framework for other versions of program semantics, essentially as in the logic-algebra-semantics paradigm.

Grantor

Department of Mathematics and Applied Mathematics

Year dc:date.issued

1995

Author dc:creator

• Rewitzky, Ingrid Moira

Advisor dc:contributor.advisor

• Brink, Chris

• Mathematics and Applied Mathematics

Handle dc:identifier.uri

http://hdl.handle.net/11427/40619

OAI identifier oai:identifier

oai:open.uct.ac.za:11427/40619