Universal profinite domains
DOI10.1016/0890-5401(87)90048-4zbMath0628.68050OpenAlexW1964273999MaRDI QIDQ1093371
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
information systemspreorderdomain theoryprofinite domainsprogramming semanticsuniversal domainbicartesian closed categorydomain equationPlotkin order
Specification and verification (program logics, model checking, etc.) (68Q60) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Preorders, orders, domains and lattices (viewed as categories) (18B35) Theory of computing (68Q99)
Related Items (20)
Cites Work
- The largest Cartesian closed category of domains
- \(\mathbb{T}^\omega\) as a universal domain
- The lambda calculus, its syntax and semantics
- Continuously generated fixed points
- Randomized geometric algorithms and pseudorandom generators
- Models of the lambda calculus
- The Category-Theoretic Solution of Recursive Domain Equations
- Data Types as Lattices
- A Powerdomain Construction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Universal profinite domains