Technical reports

new-HOPLA — a higher-order process language with name generation

Glynn Winskel, Francesco Zappa Nardelli

May 2004, 16 pages

DOI: 10.48456/tr-589

Abstract

This paper introduces new-HOPLA, a concise but powerful language for higher-order 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 of π-calculus and HOπ are presented.

Full text

PDF (0.3 MB)

BibTeX record

@TechReport{UCAM-CL-TR-589,
  author =	 {Winskel, Glynn and Nardelli, Francesco Zappa},
  title = 	 {{new-HOPLA --- a higher-order process language with name
         	   generation}},
  year = 	 2004,
  month = 	 may,
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-589.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-589},
  number = 	 {UCAM-CL-TR-589}
}