Representing Powerdomain Elements as Monadic Second Order Predicates
Loading...
Files
Penn collection
Technical Reports (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Gunter, Carl A
Contributor
Abstract
This report characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a preordering of provable implication. This provides an intuitive representation which suggests a new form of powerdomain - called the mixed powerdomain - which expresses data in a different way from the well-known constructions from programming semantics. It can be shown that the mixed powerdomain has many of the properties associated with the convex powerdomain such as the possibility of solving recursive equations and a simple algebraic characterization.
Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1991-02-25
Volume number
Issue number
Publisher
Publisher DOI
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-91-21.