License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06341.2
URN: urn:nbn:de:0030-drops-8945
Go to the corresponding Portal

Battenfeld, Ingo ; Schröder, Matthias ; Simpson, Alex

A convenient category of domains

06341.SimpsonAlex.Paper.894.pdf (0.3 MB)


We motivate and define a category of "topological domains",
whose objects are certain topological spaces, generalising
the usual $omega$-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, provides a model of parametric polymorphism,
and can be used as the basis for a theory of computability.
This answers a question of Gordon Plotkin, who asked
whether it was possible to construct a category of domains
combining such properties.

BibTeX - Entry

  author =	{Battenfeld, Ingo and Schr\"{o}der, Matthias and Simpson, Alex},
  title =	{{A convenient category of domains}},
  booktitle =	{Computational Structures for Modelling Space, Time and Causality},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6341},
  editor =	{Ralph Kopperman and Prakash Panangaden and Michael B. Smyth and Dieter Spreen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-8945},
  doi =		{10.4230/DagSemProc.06341.2},
  annote =	{Keywords: Domain theory, topology of datatypes}

Keywords: Domain theory, topology of datatypes
Collection: 06341 - Computational Structures for Modelling Space, Time and Causality
Issue Date: 2007
Date of publication: 26.02.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI