@inproceedings{e2aa79f42f9e4e278c036fb868fb6e05,
title = "Coherence and consistency in domains.",
abstract = "Almost all of the categories normally used as a mathematical foundation for denotational semantics satisfy a condition known as consistent completeness. The authors explore the possibility of using different condition coherence, which has its origin in topology and logic. In particular, they concentrate on posets with principal ideas that are algebraic lattices and with coherent topologies. These form a Cartesian closed category has fixed points for domain equations. It is shown that a universal domain exists. A categorical treatment of the construction of this domain is provided, and its relationship to other applications discussed.",
author = "Gunter, {Carl A.}",
note = "Funding Information: * An extended outline of this paper appeared in: Logic in Computer Science, edited by I{\textquoteright}. Gurevich, pp. 309-319, IEEE Computer Society Press, July 1988. ** Department of Computer and Information Sciences, Philadelphia, PA 19104, U.S.A. Supported in part by U.S. Army Research Office Grant DAAG 29-84-K-0061. *** Fachbereich Mathematik, 6100 Darmstadt, West Germany.",
year = "1988",
language = "English (US)",
isbn = "0818608536",
series = "Proc Third Annu Symp on Logic in Comput Sci",
publisher = "Publ by IEEE",
pages = "309--317",
booktitle = "Proc Third Annu Symp on Logic in Comput Sci",
}