ePrints Repository

Presenting dcpos and dcpo algebras

Jung, Achim and Moshier, M.Andrew and Vickers, Steven (2008) Presenting dcpos and dcpo algebras. Electronic Notes in Theoretical Computer Science, 219. pp. 209-229. ISSN 1571-0661

Loading
PDF (201Kb)

URL of Published Version: http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4TRCRM2-F&_user=122868&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=953704978&_rerunOrigin=google&_acct=C000010083&_version=1&_urlVersion=0&_userid=122868&md5=b14c8379d4e

Identification Number/DOI: doi:10.1016/j.entcs.2008.10.013

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.

Type of Work:Article
Date:21 October 2008 (Publication)
School/Faculty:Schools (1998 to 2008) > School of Computer Science
Department:Computer Science
Subjects:Q Science (General)
QA75 Electronic computers. Computer science
QA Mathematics
Institution:University of Birmingham
Copyright Holders:Elsevier
ID Code:192
Refereed:YES
Local Holdings:
Export Reference As : ASCII + BibTeX + Dublin Core + EndNote + HTML + METS + MODS + OpenURL Object + Reference Manager + Refer + RefWorks
Share this item :
QR Code for this page

Repository Staff Only: item control page