A domain theoretic approach to higher-order relations
Proceedings on International conference on database theory
Information and Computation
Algebraic theory of processes
Using powerdomains to generalize relational databases
Theoretical Computer Science
A semantics for complex objects and approximate queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
Fundamenta Informaticae
| Hi-index | 0.00 |
The purpose of this paper is to discuss the relationship between the interpretations of non-deterministic programs using the upper (total correctness) powerdomain on the one hand and the lower (partial correctness) powerdomain on the other. It is shown that there is a close semantic relationship between these two interpretations which suggests the formulation of a new operator called the mixed powerdomain. It is shown that the mixed powerdomain has many pleasing domain-theoretic and algebraic properties. The mixed powerdomain is closely related to new powerdomains which have been recently investigated as mathematical models of partial information in databases. Some of the basic intuitions captured by such structures may have uses for the specification of non-deterministic computations. The paper includes a sample non-deterministic programming language and a semantics using the mixed powerdomain.