Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-25T03:35:30.304Z Has data issue: false hasContentIssue false

Compactly generated domain theory

Published online by Cambridge University Press:  17 May 2006

INGO BATTENFELD
Affiliation:
LFCS, School of Informatics, University of Edinburgh, UK
MATTHIAS SCHRÖDER
Affiliation:
LFCS, School of Informatics, University of Edinburgh, UK
ALEX SIMPSON
Affiliation:
LFCS, School of Informatics, University of Edinburgh, UK

Abstract

We propose compactly generated monotone convergence spaces as a well-behaved topological generalisation of directed-complete partial orders (dcpos). The category of such spaces enjoys the usual properties of categories of ‘predomains’ in denotational semantics. Moreover, such properties are retained if one restricts to spaces with a countable pseudobase in the sense of E. Michael, a fact that permits connections to be made with computability theory, realizability semantics and recent work on the closure properties of topological quotients of countably based spaces (qcb spaces). We compare the standard domain-theoretic constructions of products and function spaces on dcpos with their compactly generated counterparts, showing that these agree in important cases, though not in general.

Type
Paper
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported by an EPSRC research grant, ‘Topological Models of Computational Metalanguages’, and an EPSRC Advanced Research Fellowship (Simpson).