Universal profinite domains (Q1093371)

The author introduces and studies the profinite domains in the order- theoretic approach to programming semantics. The mathematical problem of the existence of a profinite universal domain is investigated. Thus, the paper provides and explains a technique for constructing an infinite class of universal profinite domains. The category of profinite domains and continuous functions is shown to be bicartesian closed and necessary conditions are provided for the existence of solutions of domain equations within this category. According to the author, ``this is a rather natural, and in a sense inevitable, category which contains SFP (see Plotkin, 1976) as a full subcategory''. An approach similar to information systems is extended to categories larger than the one considered by Scott.