Skip to main content
SpringerLink
Log in

Logical Relations and Nondeterminism

  • Chapter
Software, Services, and Systems

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8950))

  • 974 Accesses

Abstract

The purpose of this article is to illustrate some technical difficulties encountered when trying to extend a logical relation to the Hoare powerdomain. We give a partial solution and some applications. Our vehicle is a simple call-by-value programming language with binary nondeterministic choice. We define both a big-step operational semantics and a denotational semantics using the Hoare powerdomain. Using our logical relation we then show equivalence of the two semantics in the sense of computational adequacy and some type-dependent program equivalences.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Jung, A.: Domain theory. Online Lecture Notes, avaliable from CiteSeerX (1994)

    Google Scholar 

  2. Amadio, R.M., Cardelli, L.: Subtyping recursive types, pp. 575–631 (1993)

    Google Scholar 

  3. Benton, N., Hofmann, M., Nigam, V.: Abstract effects and concurrency (under review 2014)

    Google Scholar 

  4. Birkedal, L., Sieczkowski, F., Thamsborg, J.: A concurrent logical relation. In: Cégielski, P., Durand, A. (eds.) CSL. LIPIcs, vol. 16, pp. 107–121. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

    Google Scholar 

  5. Broy, M., Gnatz, R., Wirsing, M.: Semantics of nondeterministic and noncontinuous constructs. In: Gerhart, S.L., et al. (eds.) Program Construction. LNCS, vol. 69, pp. 553–592. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  6. Broy, M., Wirsing, M.: On the algebraic specification of nondeterministic programming languages. In: Astesiano, E., Böhm, C. (eds.) CAAP 1981. LNCS, vol. 112, pp. 162–179. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  7. Katsumata, S.-y.: Relating computational effects by ⊤ ⊤-lifting. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 174–185. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Krivine, J.-L.: Classical logic, storage operators and second-order lambda-calculus. Ann. Pure Appl. Logic 68(1), 53–78 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Plotkin, G.D.: A powerdomain construction. SIAM J. Comput. 5(3), 452–487 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Plotkin, G.D.: “lcf” considered as a programming language. Theor. Comput. Sci. 5(3), 223–255 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sieber, K.: Call-by-value and nondeterminism. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 376–390. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  12. Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4), 761–783 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LMU Munich, Germany

    Martin Hofmann

Authors
  1. Martin Hofmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IMT Institute for Advanced Studies Lucca, Piazza S. Francesco, 19, 55100, Lucca, Italy

    Rocco De Nicola

  2. Ludwig-Maximilians-Universität München, Germany

    Rolf Hennicker

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hofmann, M. (2015). Logical Relations and Nondeterminism. In: De Nicola, R., Hennicker, R. (eds) Software, Services, and Systems. Lecture Notes in Computer Science, vol 8950. Springer, Cham. https://doi.org/10.1007/978-3-319-15545-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15545-6_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15544-9

  • Online ISBN: 978-3-319-15545-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation