Topology via logic
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
A note on inconsistencies caused by fixpoints in a Cartesian closed category
Theoretical Computer Science
Notions of computation and monads
Information and Computation
Probabilistic non-determinism
Handbook of logic in computer science (vol. 1)
Handbook of logic in computer science (vol. 3)
Axiomatic domain theory in categories of partial maps
Axiomatic domain theory in categories of partial maps
Computable analysis: an introduction
Computable analysis: an introduction
Theoretical Computer Science
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A Universal Characterization of the Closed Euclidean Interval
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic 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
Compactly generated domain theory
Mathematical Structures in Computer Science
Two preservation results for countable products of sequential spaces
Mathematical Structures in Computer Science
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects in Topological Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Relationship between Filter Spaces and Weak Limit Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
An Effective Tietze-Urysohn Theorem for QCB-Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Topological properties of concept spaces (full version)
Information and Computation
Comparing free algebras in Topological and Classical Domain Theory
Theoretical Computer Science
Selection functions, bar recursion and backward induction
Mathematical Structures in Computer Science
Observationally-induced Effects in Cartesian Closed Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual @w-continuous dcppos of domain theory. Our category supports all the standard constructions of domain theory, including the solution of recursive domain equations. It also supports the construction of free algebras for (in)equational theories, can be used as the basis for a theory of computability, and provides a model of parametric polymorphism.