Skip to main content
SpringerLink
Log in

Hennessy-Plotkin-Brookes Revisited

  • Conference paper
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4337))

Abstract

In [3] Hennessy and Plotkin gave a domain-theoretic semantics fully abstract for SIP (the Simple Imperative Programming language) + parallelism together with a certain unnatural synchronisation construct, but not, unfortunately, abstract without that construct. Later, in [1], Brookes gave a fully-abstract trace semantics for a slight variation on SIP + parallelism. In his semantics, meanings of programs are sets of traces subject to certain closure conditions, namely ‘stuttering’ and ‘mumbling’; traces are sequences of pairs of states.

This work has been done with the support of EPSRC grants GR/M56333 and GR/S86372/01 and a Royal Society-Wolfson research merit award.

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

References

  1. Brookes, S.D.: Full Abstraction for a Shared-Variable Parallel Language. Inf. Comput. 127(2), 145–163 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Benton, N., Hughes, J., Moggi, E.: Monads and effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 42–122. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Hennessy, M.C.B., Plotkin, G.D.: Full Abstraction for a Simple Parallel Programming Language. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 108–120. Springer, Heidelberg (1979)

    Google Scholar 

  4. Hyland, J.M.E., Plotkin, G.D., Power, A.J.: Combining Effects: Sum and Tensor. In: TCS, vol. 357(1-3), pp. 70–99 (2006)

    Google Scholar 

  5. Plotkin, G., Power, J.: Notions of Computation Determine Monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 342–356. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Moggi, E.: Computational Lambda-Calculus and Monads. In: Proc. LICS 1989, pp. 14–23. IEEE Press, Los Alamitos (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for the Foundations of Computer Science, School of Informatics, University of Edinburgh, King’s Buildings, Edinburgh, EH9 3JZ, Scotland

    Gordon Plotkin

Authors
  1. Gordon Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, P.O. Box, 110016, New Delhi, India

    S. Arun-Kumar

  2. Indian Institute of Technology, Delhi

    Naveen Garg

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plotkin, G. (2006). Hennessy-Plotkin-Brookes Revisited. In: Arun-Kumar, S., Garg, N. (eds) FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2006. Lecture Notes in Computer Science, vol 4337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944836_2

Download citation

  • DOI: https://doi.org/10.1007/11944836_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49994-7

  • Online ISBN: 978-3-540-49995-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation