A topological framework for program semantics
Thesis / Dissertation
1995
Permanent link to this Item
Authors
Supervisors
Journal Title
Link to Journal
Journal ISSN
Volume Title
Publisher
Publisher
Faculty
License
Series
Abstract
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.
Description
Reference:
Rewitzky, I.M. 1995. A topological framework for program semantics. . ,Faculty of Science ,Department of Mathematics and Applied Mathematics. http://hdl.handle.net/11427/40619