License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-8945
URL: http://drops.dagstuhl.de/opus/volltexte/2007/894/
Battenfeld, Ingo ; Schröder, Matthias ; Simpson, Alex

A convenient category of domains

pdf-format:
Dokument 1.pdf (310 KB)

Abstract

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

@InProceedings{battenfeld_et_al:DSP:2007:894,
  author =	{Ingo Battenfeld and Matthias Schr{\"o}der and Alex Simpson},
  title =	{A convenient category of domains},
  booktitle =	{Computational Structures for Modelling Space, Time and Causality},
  year =	{2007},
  editor =	{Ralph Kopperman and Prakash Panangaden and Michael B. Smyth and Dieter Spreen },
  number =	{06341},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/894},
  annote =	{Keywords: Domain theory, topology of datatypes}
}

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

DROPS-Home | Fulltext Search | Imprint Published by LZI