Abstract
An extension is presented of a result proved by M. B. Smyth (1983), which states that G. D. Plotkin's (1976) 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. The author states and proves an analog to Smyth's theorem that says that the bounded complete domains form the largest easy-to-define Cartesian closed category of domains.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 142-148 |
| Number of pages | 7 |
| ISBN (Print) | 0818687203 |
| State | Published - 1986 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- Mathematics(all)