Universal profinite domains

30Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We introduce a bicartesian closed category of what we call profinite domains. Study of these domains is carried out through the use of an equivalent category of pre-orders in a manner similar to the information systems approach advocated by Dana Scott and others. A class of universal profinite domains is defined and used to derive sufficient conditions for the profinite solution of domain equations involving continuous operators. As a special instance of this construction, a universal domain for the category SFP is demonstrated. Necessary conditions for the existence of solutions for domain equations over the profinites are also given and used to derive results about solutions of some equations. A new universal bounded complete domain is also demonstrated using an operator which has bounded complete domains as its fixed points. © 1987.

Cite

CITATION STYLE

APA

Gunter, C. A. (1987). Universal profinite domains. Information and Computation, 72(1), 1–30. https://doi.org/10.1016/0890-5401(87)90048-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free