A concrete realization of the Hoare powerdomain

DOI10.1007/s00500-007-0153-3zbMath1125.68069OpenAlexW1969667939MaRDI QIDQ2642996

Constantine Tsinakis, James B. Hart

Publication date: 6 September 2007

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-007-0153-3

zbMATH Keywords

lattice of full subinformation systemslattice of non-empty down-sets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (1)

Ordinal decompositions for preordered root systems

Cites Work

• The largest Cartesian closed category of domains
• Non-deterministic information systems and their domains
• Universal profinite domains
• Mathematical foundations of programming language semantics. 3rd workshop, Tulane University, New Orleans, Louisiana, USA, April 8--10, 1987. Proceedings
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A concrete realization of the Hoare powerdomain