New-HOPLA a higher-order process language with name generation

  • Glynn Winskel
  • Francesco Zappa Nardelli
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 155)


This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain theory are sketched but for the most part the paper concentrates on its operational semantics. The language is typed, the type of a process describing the shape of the computation paths it can perform. Its transition semantics, bisimulation, congruence properties and expressive power are explored. Encodings are given of well-known process algebras, including π-calculus, Higher-Order π-calculus and Mobile Ambients.


Operational Semantic Transition Rule Parallel Composition Computation Path Domain Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    G. Boudol. Towards a lambda calculus for concurrent and communicating systems. In Proc. TAPSOFT’ 89, volume 351 of LNCS, pages 149–161. Springer Verlag, 1989.Google Scholar
  2. [2]
    G. L. Cattani, I. Stark, and G. Winskel. Presheaf models for the π-calculus. In Proc. CTCS’97, volume 1290 of LNCS. Springer Verlag, 1997.Google Scholar
  3. [3]
    M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model forthe π-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996.Google Scholar
  4. [4]
    J.Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.CrossRefzbMATHMathSciNetGoogle Scholar
  5. [5]
    A. D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of CS, University of Aarhus, July 1995.Google Scholar
  6. [6]
    D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103–112, 1996.CrossRefzbMATHMathSciNetGoogle Scholar
  7. [7]
    M. Nygaard and G. Winskel. Hopla—a higher-order process language. In Proc. CONCUR’ 02, volume 2421 of LNCS. Springer Verlag, 2002.Google Scholar
  8. [8]
    M. Nygaard and G. Winskel. Domain theory for concurrency. To appear in Theoretical Computer Science, special issue on domain theory, accepted 2003.Google Scholar
  9. [9]
    M. Nygaard and G. Winskel. Full abstraction for HOPLA. In Proc. CONCUR’ 03, LNCS. Springer Verlag, 2003.Google Scholar
  10. [10]
    A. M. Pitts. Operationally-based theories of program equivalence. In P. Dybjer and A. M. Pitts, editors, Semantics and Logics of Computation, Publications of the Newton Institute, pages 241–298. Cambridge University Press, 1997.Google Scholar
  11. [11]
    A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Proc. UPC 2000, volume 1837 of LNCS. Springer Verlag, 2000.Google Scholar
  12. [12]
    D. Sangiorgi. Bisimulation in higher-order calculi. In Proc. IFIP PROCOMET’94, pages 207–224. North-Holland, 1994.Google Scholar
  13. [13]
    D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.Google Scholar
  14. [14]
    I. Stark. A fully-abstract domain model for the π-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996.Google Scholar
  15. [15]
    B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990.Google Scholar
  16. [16]
    F. Zappa Nardelli. De la sémantique des processus d’ordre supérieur. PhD thesis, Université de Paris 7, 2003. Available in English from

Copyright information

© Springer Science + Business Media, Inc. 2004

Authors and Affiliations

  • Glynn Winskel
    • 1
  • Francesco Zappa Nardelli
    • 2
  1. 1.Computer LaboratoryUniversity of CambridgeUK
  2. 2.INRIA & Computer LaboratoryUniversity of CambridgeUK

Personalised recommendations