Presenting Dcpos and Dcpo Algebras

Authors:
Achim Jung;M. Andrew Moshier;Steve Vickers
Affiliations:
School of Computer Science, The University of Birmingham, Birmingham, United Kingdom;Department of Mathematics & Computer Science, Chapman University, Orange, CA, USA;School of Computer Science, The University of Birmingham, Birmingham, United Kingdom
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 4
Cited 3

Domain theory

Handbook of logic in computer science (vol. 3)
A foundation for computation

A foundation for computation
A universal characterization of the double powerlocale

Theoretical Computer Science - Logic, semantics and theory of programming
A Technique for Verifying Measurements

Electronic Notes in Theoretical Computer Science (ENTCS)

Extending Algebraic Operations to D-Completions

Electronic Notes in Theoretical Computer Science (ENTCS)
Canonical extensions and canonicity via dcpo presentations

Theoretical Computer Science
Extending algebraic operations to D-completions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dcpos can be presented by preorders of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals of generators) can be extended to the dcpo presented, provided the covers are ''stable'' for the operations. The resulting dcpo algebra has a natural universal characterization and satisfies all the inequational laws satisfied by the generating algebra. Applications include known ''coverage theorems'' from locale theory.