Abstract
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.
Chapter PDF
References
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.
G. L. Cattani, I. Stark, and G. Winskel. Presheaf models for the π-calculus. In Proc. CTCS’97, volume 1290 of LNCS. Springer Verlag, 1997.
M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model forthe π-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996.
J.Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
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.
D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103–112, 1996.
M. Nygaard and G. Winskel. Hopla—a higher-order process language. In Proc. CONCUR’ 02, volume 2421 of LNCS. Springer Verlag, 2002.
M. Nygaard and G. Winskel. Domain theory for concurrency. To appear in Theoretical Computer Science, special issue on domain theory, accepted 2003.
M. Nygaard and G. Winskel. Full abstraction for HOPLA. In Proc. CONCUR’ 03, LNCS. Springer Verlag, 2003.
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.
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.
D. Sangiorgi. Bisimulation in higher-order calculi. In Proc. IFIP PROCOMET’94, pages 207–224. North-Holland, 1994.
D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
I. Stark. A fully-abstract domain model for the π-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996.
B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990.
F. Zappa Nardelli. De la sémantique des processus d’ordre supérieur. PhD thesis, Université de Paris 7, 2003. Available in English from http://www.di.ens.fr/R~zappa.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Winskel, G., Nardelli, F.Z. (2004). New-HOPLA a higher-order process language with name generation. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_40
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_40
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive