Skip to main content
SpringerLink
Log in

HOPLA—A Higher-Order Process Language

  • Conference paper
  • First Online:
CONCUR 2002 — Concurrency Theory (CONCUR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2421))

Included in the following conference series:

Abstract

A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends itself to a more operational account. The language can be viewed as an extension of the lambda calculus with a “prefixed sum”, in which types express the form of computation path of which a process is capable. Its operational semantics, bisimulation, congruence properties and expressive power are explored; in particular, it is shown how it can directly encode process languages such as CCS, CCS with process passing, and mobile ambients with public names.

Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. S. Abramsky. The lazy lambda calculus. In D. Turner (ed): Research Topics in Functional Programming. Addison-Wesley, 1990.

    Google Scholar 

  2. L. Cardelli and A. D. Gordon. Anytime, anywhere. Modal logics for mobile ambients. In Proc. POPL’00.

    Google Scholar 

  3. L. Cardelli and A. D. Gordon. A commitment relation for the ambient calculus. Note. October 6th, 2000.

    Google Scholar 

  4. G. L. Cattani. Presheaf Models for Concurrency. BRICS Dissertation Series DS-99-1, 1999.

    Google Scholar 

  5. G. L. Cattani, M. Fiore, and G. Winskel. Weak bisimulation and open maps. In Proc. LICS’99.

    Google Scholar 

  6. G. L. Cattani, I. Stark, and G. Winskel. Presheaf models for the π-calculus.In Proc. CTCS’97, LNCS 1290.

    Google Scholar 

  7. G. L. Cattani and G. Winskel. Profunctors, open maps and bisimulation. Manuscript, 2000.

    Google Scholar 

  8. A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Proc. FoSSaCS’99.

    Google Scholar 

  9. A. D. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS’95, ENTCS 1.

    Google Scholar 

  10. M. Hennessy. A fully abstract denotational model for higher-order processes. Information and Computation, 112(1):55–95, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103–112, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In Proc. LICS’99.

    Google Scholar 

  13. A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70:51–86, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127:164–185, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. M. Kelly. Basic concepts of enriched category theory. London Math. Soc. Lecture Note Series 64, CUP, 1982.

    Google Scholar 

  16. J. H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968.

    Google Scholar 

  17. F. Nielson. The typed λ-calculus with first-class processes. In Proc. PARLE’89, LNCS 366.

    Google Scholar 

  18. M. Nygaard and G. Winskel. Linearity in process languages. In Proc. LICS’02.

    Google Scholar 

  19. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference, LNCS 104, 1981.

    Google Scholar 

  20. A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What’s new? In Proc. MFCS’93, LNCS 711.

    Google Scholar 

  21. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  22. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992.

    Google Scholar 

  23. B. Thomsen. A calculus of higher order communicating systems. In Proc. POPL’89.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, University of Aarhus, Aarhus

    Mikkel Nygaard

  2. Computer Laboratory, University of Cambridge, Cambridge

    Glynn Winskel

Authors
  1. Mikkel Nygaard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Glynn Winskel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nygaard, M., Winskel, G. (2002). HOPLA—A Higher-Order Process Language. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation