Presenting Dcpos and Dcpo Algebras
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Authors
Colleges, School and Institutes
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.
Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIV) |
| Editors | A. Bauer, M. Mislove |
| Publication status | Published - 22 Oct 2008 |
| Event | 24th Conference on the Mathematical Foundations of Programming Semantics (MFPSXXIV) - , United Kingdom Duration: 22 Oct 2008 → … |
Publication series
| Name | Electronic Notes in Theoretical Computer Science |
|---|---|
| Publisher | Elsevier |
| ISSN (Print) | 1571-0661 |
Conference
| Conference | 24th Conference on the Mathematical Foundations of Programming Semantics (MFPSXXIV) |
|---|---|
| Country | United Kingdom |
| Period | 22/10/08 → … |