DocumentCode
3298278
Title
Complete cuboidal sets in axiomatic domain theory
Author
Fiore, Marcelo ; Plotkin, Gordon ; Power, John
Author_Institution
Dept. of Comput. Sci., Edinburgh Univ., UK
fYear
1997
fDate
29 Jun-2 Jul 1997
Firstpage
268
Lastpage
278
Abstract
We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, via, that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domain-theoretic structures
Keywords
category theory; process algebra; type theory; axiomatic domain theory; axiomatic domain-theoretic structures; category; cuboidal sets; Computer languages; Computer science; Equations; Laboratories; Logic programming; Mathematical model; Shape; Tellurium;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1997. LICS '97. Proceedings., 12th Annual IEEE Symposium on
Conference_Location
Warsaw
ISSN
1043-6871
Print_ISBN
0-8186-7925-5
Type
conf
DOI
10.1109/LICS.1997.614954
Filename
614954
Link To Document