Universal profinite domains

DOI10.1016/0890-5401(87)90048-4MaRDI QIDQ1093371zbMATH OpenOpenAlexFDO

Authors Carl A. Gunter

Publication date 1987

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(87)90048-4

zbMATH Keywords

bicartesian closed categorydomain equationdomain theoryinformation systemsPlotkin orderpreorderprofinite domainsprogramming semanticsuniversal domain

Mathematics Subject Classification ID

Preorders, orders, domains and lattices (viewed as categories) (18B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 3940731
• Finite Axiomatizations for Universal Domains
• Almost every domain is universal
• Universal domains and the amalgamation property
• scientific article; zbMATH DE number 956838

Cites work

• \(\mathbb{T}^\omega\) as a universal domain
• A Powerdomain Construction
• Continuously generated fixed points
• Data Types as Lattices
• scientific article; zbMATH DE number 3858394 (Why is no real title available?)
• scientific article; zbMATH DE number 3817067 (Why is no real title available?)
• scientific article; zbMATH DE number 3915610 (Why is no real title available?)
• scientific article; zbMATH DE number 4031931 (Why is no real title available?)
• scientific article; zbMATH DE number 3716749 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3783068 (Why is no real title available?)
• scientific article; zbMATH DE number 193320 (Why is no real title available?)
• scientific article; zbMATH DE number 3628344 (Why is no real title available?)
• scientific article; zbMATH DE number 3635472 (Why is no real title available?)
• scientific article; zbMATH DE number 3346618 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Models of the lambda calculus
• Randomized geometric algorithms and pseudorandom generators
• The Category-Theoretic Solution of Recursive Domain Equations
• The lambda calculus, its syntax and semantics
• The largest Cartesian closed category of domains

Cited in

(24)

• Domain theory in logical form
• Universal homogeneous event structures and domains
• Recursive types for Fun
• The mixed powerdomain
• Coherence and consistency in domains
• On a generalized product for domains
• Information categories
• Spectral sets
• Stable power domains
• Describing semantic domains with sprouts
• Domain theoretic models of polymorphism
• A concrete realization of the Hoare powerdomain
• The dependent product construction in various categories of domains
• A Purely Definitional Universal Domain
• scientific article; zbMATH DE number 3940731 (Why is no real title available?)
• Universal domains and the amalgamation property
• Toward a semantics for the QUEST language
• scientific article; zbMATH DE number 1538024 (Why is no real title available?)
• scientific article; zbMATH DE number 1405582 (Why is no real title available?)
• Almost every domain is universal
• Pseudo-retract functors for local lattices and bifinte L-domains
• Universal quasi-prime algebraic domains
• Domains via graphs
• I-categories as a framework for solving domain equations

This page was built for publication: Universal profinite domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093371)