A convenient category of domains

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

doi:10.4230/DagSemProc.06341.2

Document

A convenient category of domains

Authors Ingo Battenfeld, Matthias Schröder, Alex Simpson

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 6341
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2007-02-26

PDF

File

PDF

DagSemProc.06341.2.pdf

Filesize: 310 kB
34 pages

Document Identifiers

DOI: 10.4230/DagSemProc.06341.2
URN: urn:nbn:de:0030-drops-8945

Subject Classification

Keywords

Domain theory
topology of datatypes

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Ingo Battenfeld, Matthias Schröder, and Alex Simpson. A convenient category of domains. In Computational Structures for Modelling Space, Time and Causality. Dagstuhl Seminar Proceedings, Volume 6341, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.06341.2

Author Details

Ingo Battenfeld

Matthias Schröder

Alex Simpson

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail