Comparing categories of domains

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


We discuss some of the reasons for the proliferation of categories of domains suggested for the mathematical foundations of the Scott-Strachey theory of programming semantics. Five general conditions are presented which such a category should satisfy and they are used to motivate a number of examples. An attempt is made to survey some of the methods whereby these examples may be compared and their relationships expressed. We also ask a few mathematical questions about the examples.

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Programming Semantics - International Conference, Proceedings
EditorsAustin Melton
Number of pages21
ISBN (Print)9783540168164
StatePublished - 1986
Externally publishedYes
EventInternational Conference on Mathematical Foundations of Programming Semantics, 1985 - Manhattan, United States
Duration: Apr 11 1985Apr 12 1985

Publication series

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


OtherInternational Conference on Mathematical Foundations of Programming Semantics, 1985
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Comparing categories of domains'. Together they form a unique fingerprint.

Cite this