Skip to main content
SpringerLink
Log in

A concrete realization of the Hoare powerdomain

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abramsky S, Jung A (1994) Domain theory. In: Abramsky S, Gabbay D, Maibaum TSE (eds). Handbook of logic in computer science. Oxford University Press, New York, pp. 1–168

    Google Scholar 

  • Davey BA, Priestley HA (1990) Introduction to lattices and order. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Droste M, Göbel R (1990) Non-deterministic information systems and their domains. Theor Comput Sci 75:289–309

    Article  MATH  Google Scholar 

  • Geirz G, Hofmann KH, Keimel K, Lawson JD, Mislove M, Scott DS (1980) A compendium of continuous lattices. Springer, Berlin

    Google Scholar 

  • Gunter C (1986) The largest first-order axiomatizable cartesian-closed category of domains. In: Meyer AR (ed) Symposium on logic in computer science. IEEE Computer Soc. Press, Silver Spring, pp 142–148

    Google Scholar 

  • Gunter C (1987) Universal profinite domains. Inform Comput 72(1): 1–30

    Article  MATH  MathSciNet  Google Scholar 

  • Gunter C (1985) Profinite solutions for recursive domain equations, Technical Report CMU-CS-85-107, Carnegie-Melon University

  • Jung A (1989) Cartesian closed categories of domains, CWI Tracts, Centrum voor Wiskunde en Informatica, vol 66

  • Jung A (1988) New results on hierarchies of domains. In: Mathematical foundations of programming language semantics. Lecture Notes on Computer Science, vol 238. Springer, New York, pp. 303–310

  • Plotkin GD (1976) A powerdomain construction. SIAM J Comput 5:452–487

    Article  MATH  MathSciNet  Google Scholar 

  • Plotkin GD (1981) Post-graduate lecture notes in advanced domain theory (incorporating the Pisa Lecture Notes). Technical report, Department of Computer Science, University of Edinburgh

  • Scott DS (1970) Outline of a mathematical theory of computation. In: Proceedings of 4th annual Princeton conference on information science and systems, pp 169–176

  • Scott DS (1971) The lattice of flow diagrams. In: Engeler E (ed) Symposium on semantics of algorithmic languages. Lecture Notes in Mathematics, vol 188. Springer, New York, pp 311–366

  • Scott DS (1972a) Lattice theory, data types, and semantics. In: Rustin R (eds). Formal semantics of programming languages. Prentice Hall, Englewood Cliffs, pp. 65–106

    Google Scholar 

  • Scott DS (1972b) Continuous lattices. In: Lawvere FW (eds). Toposes, algebraic geometry and logic. Lecture Notes in Mathematics 274. Springer, New York, pp. 97–136

    Chapter  Google Scholar 

  • Scott DS (1982) Domains for denotational semantics. In: Lecture notes in computer science, vol 140. Springer, Berlin, pp 577–613

  • Smyth M (1983) The largest cartesian-closed category of domains. Theor Comput Sci 27:109–119

    Article  MATH  MathSciNet  Google Scholar 

  • Vickers S (1989) Topology via logic. Cambridge University Press, Cambridge

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Middle Tennessee State University, Murfreesboro, TN, 37132, USA

    James B. Hart

  2. Department of Mathematics, Vanderbilt University, Nashville, TN, 37240, USA

    Constantine Tsinakis

Authors
  1. James B. Hart
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Constantine Tsinakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Constantine Tsinakis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hart, J.B., Tsinakis, C. A concrete realization of the Hoare powerdomain. Soft Comput 11, 1059–1063 (2007). https://doi.org/10.1007/s00500-007-0153-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-007-0153-3

Keywords

Search

Navigation