Complete Cuboidal Sets in Axiomatic Domain Theory (Extended Abstract) (1997)
Cached
Download Links
- [www.cogs.susx.ac.uk]
- [www.cl.cam.ac.uk]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of 12th Annual Symposium on Logic in Computer Science |
| Citations: | 16 - 4 self |
BibTeX
@INPROCEEDINGS{Fiore97completecuboidal,
author = {Marcelo Fiore and Gordon Plotkin and John Power},
title = {Complete Cuboidal Sets in Axiomatic Domain Theory (Extended Abstract)},
booktitle = {In Proceedings of 12th Annual Symposium on Logic in Computer Science},
year = {1997},
pages = {268--279},
publisher = {IEEE Computer Society Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) Marcelo Fiore !mf@dcs.ed.ac.uk? Gordon Plotkin y !gdp@dcs.ed.ac.uk? John Power !ajp@dcs.ed.ac.uk? Department of Computer Science Laboratory for Foundations of Computer Science University of Edinburgh, The King's Buildings Edinburgh EH9 3JZ, Scotland Abstract We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, viz. 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. Introduction The aim of Axiomatic Domain Theory (ADT) is to provide a conceptual understanding of why domains are adequate as mathematical models of computation. (For a discussion see [12, x Axiomatic Domain Theory ].) The approach taken is to axiomatise the structure needed on a category so that its objects can be considered as domains, and its maps as continuous...
