Handbook of logic in computer science (vol. 3)
Computable analysis: an introduction
Computable analysis: an introduction
A non-topological view of dcpos as convergence spaces
Theoretical Computer Science - Topology in computer science
Topological and limit-space subcategories of countably-based equilogical spaces
Mathematical Structures in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Theoretical Computer Science - Mathematical foundations of programming semantics
Quotients of countably based spaces are not closed under sobrification
Mathematical Structures in Computer Science
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Two preservation results for countable products of sequential spaces
Mathematical Structures in Computer Science
Extending Algebraic Operations to D-Completions
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects in Topological Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing free algebras in Topological and Classical Domain Theory
Theoretical Computer Science
Selection functions, bar recursion and backward induction
Mathematical Structures in Computer Science
Admissible representations in computable analysis
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Extending algebraic operations to D-completions
Theoretical Computer Science
| Hi-index | 0.00 |
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.