Projects per year
Abstract
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual ω-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.
| Original language | English |
|---|---|
| Pages (from-to) | 69-99 |
| Number of pages | 31 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 172 |
| DOIs | |
| Publication status | Published - 2007 |
Fingerprint
Dive into the research topics of 'A Convenient Category of Domains'. Together they form a unique fingerprint.Projects
- 2 Finished
-
Topological Models for Computational Metalanguages
Simpson, A. (Principal Investigator)
1/10/03 → 30/09/06
Project: Research
-
Models and Axioms for the Semantics of Computation
Simpson, A. (Principal Investigator)
1/10/01 → 30/09/06
Project: Research