Paper: The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains (at LICS 1986)

Authors: Carl A. Gunter

Abstract

The inspiration for this paper is a result proved by Michael Smyth which states that Gordon Plotkin's category SFP is the largest cartesian closed category of domains. Although this category is easily enough motivated from concepts in domain theory and category theory, it is clearly harder to describe and less "elementary" than the most popular categories of domains for denotational semantics. In particular, the category most often used by people who need domain theory is that of bounded complete algebraic cpo's. The use of this latter category has been championed by Dana Scott for years and its use has become widespread. It is simple to describe, easy to work with, and suffices for most applications.

BibTeX

  @InProceedings{Gunter-TheLargestFirstOrde,
    author = 	 {Carl A. Gunter},
    title = 	 {The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains},
    booktitle =  {Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986)},
    year =	 {1986},
    month =	 {June}, 
    pages =      {142--148},
    location =   {Cambridge, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }