Z. Cao (2006):
More on Bisimulations for Higher Order π-Calculus.
In: L. Aceto & A. In\'golfsdóttir: Proceedings of FOSSACS2006,
LNCS 3921,
pp. 63–78,
doi:10.1007/11690634_5.
Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006..
A. Jeffrey & J. Rathke (2005):
Contextual equivalence for higher-order pi-calculus revisited.
Logical Methods in Computer Science 1(1:4),
doi:10.2168/LMCS-1(1:4)2005.
I. Lanese, J. A. Pérez, D. Sangiorgi & A. Schmitt (2010):
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi.
In: Proceedings of ICALP 2010,
LNCS.
Springer Verlag,
pp. 442–453,
doi:10.1007/978-3-642-14162-1_37.
I. Lanese, J. A. Pérez, D. Sangiorgi & A. Schmitt (2011):
On the Expressiveness and Decidability of Higher-Order Process Calculi.
Information and Computation 209(2),
pp. 198–226,
doi:10.1016/j.ic.2010.10.001.
I. Lanese, J.A. Perez, D. Sangiorgi & A. Schmitt (2008):
On the Expressiveness and Decidability of Higher-Order Process Calculi.
In: Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008).
IEEE Computer Society,
pp. 145–155,
doi:10.1109/LICS.2008.8.
Journal version in LPSS10a.
R. Milner (1992):
Functions as Processes.
Mathematical Structures in Computer Science 2(2),
pp. 119–141,
doi:10.1017/S0960129500001407.
Research Report 1154, INRIA, Sofia Antipolis, 1990.
D. Sangiorgi (1992):
Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms.
Phd thesis.
University of Edinburgh.
D. Sangiorgi (1992):
From π-Calculus to Higher-Order π-Calculus—and Back.
In: Proceedings of TAPSOFT '93,
LNCS 668.
Springer Verlag,
pp. 151–166,
doi:10.1007/3-540-56610-4_62.
D. Sangiorgi (1996):
Bisimulation for Higher-order Process Calculi.
Information and Computation 131(2),
pp. 141–178,
doi:10.1006/inco.1996.0096.
Preliminary version in proceedings of PROCOMET'94 (IFIP Working Conference on Programming Concepts, Methods and Calculi), pages 207-224, North Holland, 1994.
D. Sangiorgi (1996):
Pi-calculus, Internal Mobility and Agent-Passing Calculi.
Theoretical Computer Science 167(2),
doi:10.1016/0304-3975(96)00075-8.
Extracts of parts of the material contained in this paper can be found in the Proceedings of TAPSOFT'95 and ICALP'95.
D. Sangiorgi (1998):
On the Bisimulation Proof Method.
Mathematical Structures in Computer Science 8(6),
pp. 447–479,
doi:10.1017/S0960129598002527.
An extended abstract in Proceedings of MFCS'95, LNCS 969, pp. 479-488, Springer Verlag.
D. Sangiorgi, N. Kobayashi & E. Sumii (2011):
Environmental bisimulations for higher-order languages.
ACM Transactions on Programming Languages and Systems 33(1),
pp. 5,
doi:10.1145/1889997.1890002.
D. Sangiorgi & D. Walker (2001):
The Pi-calculus: a Theory of Mobile Processes.
Cambridge Universtity Press.
B. Thomsen (1990):
Calculi for Higher Order Communicating Systems.
Phd thesis.
Department of Computing, Imperial College.
B. Thomsen (1993):
Plain CHOCS, a Second Generation Calculus for Higher-Order Processes.
Acta Informatica 30(1),
pp. 1–59,
doi:10.1007/BF01200262.
J.-L. Vivas & M. Dam (1998):
From Higher-Order Pi-Calculus to Pi-Calculus in the Presence of Static Operators.
In: Proceedings of the 9th International Conference on Concurrency Theory,
LNCS 1466,
pp. 115–130,
doi:10.1007/BFb0055619.
Nice, France, September 8-11, 1998.
Xian Xu (2012):
Distinguishing and Relating Higher-order and First-order Processes by Expressiveness.
Acta Informatica 49(7-8),
pp. 445–484,
doi:10.1007/s00236-012-0168-9.
eptcs@eptcs.org