A concrete realization of the Hoare powerdomain

The lattice of non-empty Scott-closed subsets of a domain D is called the Hoare powerdomain of D. The Hoare powerdomain is used in programming semantics as a model for angelic nondeterminism. In this paper, we show that the Hoare powerdomain of any domain can be realized as the lattice of full subin...

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Germany), 2007-09, Vol.11 (11), p.1059-1063
Main Authors: Hart, James B., Tsinakis, Constantine
Format: Article
Language:English
Subjects:
Semantics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The lattice of non-empty Scott-closed subsets of a domain D is called the Hoare powerdomain of D. The Hoare powerdomain is used in programming semantics as a model for angelic nondeterminism. In this paper, we show that the Hoare powerdomain of any domain can be realized as the lattice of full subinformation systems of the domain’s corresponding information system as well as the lattice of non-empty down-sets of the system’s consistency predicate.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-007-0153-3