A universal domain technique for profinite posets

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We introduce a category of what we call profinite domains. This category of domains differs from most of the familiar ones in having a categorical coproduct as well as being cartesian closed. Study of these domains is carried out through the use of an equivalent category of pre-orders in a manner similar to the information systems approach advocated by Dana Scott and others. A class of universal profinite domains is defined and used to derive sufficient conditions for the profinite solution of domain equations involving continuous functors. Necessary conditions for the existence of such solutions are also given and used to derive results about solutions of some important equations. A new universal bounded complete domain is also demonstrated using a functor which has bounded complete domains as its fixed points.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 12th Colloquium
EditorsWilfried Brauer
Number of pages12
ISBN (Print)9783540156505
StatePublished - 1985
Externally publishedYes
Event12th International Colloquium on Automata, Languages and Programming, ALP 1985 - Nafplion, Greece
Duration: Jul 15 1985Jul 19 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume194 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th International Colloquium on Automata, Languages and Programming, ALP 1985

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'A universal domain technique for profinite posets'. Together they form a unique fingerprint.

Cite this