H. P. Barendregt
1984
The Lambda Calculus—Its Syntax and Semantics
North-Holland
Nigel Cutland
1980
Computability: An Introduction to Recursive Function Theory
Cambridge University Press
U. H. Engberg
M. Nielsen
1986
A Calculus of Communicating Systems with Label Passing
Technical Report
DAIMI PB-208
Computer Science Department, University of Aarhus
http://www.daimi.au.dk/PB/208/
U. H. Engberg
M. Nielsen
2000
A Calculus of Communicating Systems with Label Passing - Ten Years After
Proof, Language, and Interaction: Essays in Honour of Robin Milner
MIT Press Cambridge
599–622
Yuxi Fu
2005
On Quasi Open Bisimulation
Theoretical Computer Science
338(1-3)
96–126
10.1016/j.tcs.2004.10.041
Yuxi Fu
2014
Theory of interaction
Theoretical Computer Science
10.1016/j.tcs.2015.07.043
Yuxi Fu
Hao Lu
2010
On the Expressiveness of Interaction
Theoretical Computer Science
411
1387–1451
10.1016/j.tcs.2009.11.011
D. Gorla
2008
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
Proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008)
LNCS
5201
Springer Verlag
492–507
10.1007/978-3-540-85361-9_38
I. Lanese
J. A. Pérez
D. Sangiorgi
A. Schmitt
2010
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2010)
LNCS
Springer Verlag
442–453
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)
198–226
10.1016/j.ic.2010.10.001
R. Milner
1989
Communication and Concurrency
Prentice Hall
R. Milner
J. Parrow
D. Walker
1992
A Calculus of Mobile Processes (Parts I and II)
Information and Computation
100(1)
1–77
10.1016/0890-5401(92)90008-4, 10.1016/0890-5401(92)90009-5
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
Proceedings of Theory and Practice of Software Development (TAPSOFT) 1993
LNCS
668
Springer Verlag
151–166
10.1007/3-540-56610-4_62
D. Sangiorgi
1996
Bisimulation for Higher-order Process Calculi
Information and Computation
131(2)
141–178
10.1006/inco.1996.0096
D. Sangiorgi
1998
On the Bisimulation Proof Method
Mathematical Structures in Computer Science
8(6)
447–479
10.1017/S0960129598002527
D. Sangiorgi
D. Walker
2001
The Pi-calculus: a Theory of Mobile Processes
Cambridge Universtity Press
B. Thomsen
1993
Plain CHOCS, a Second Generation Calculus for Higher-Order Processes
Acta Informatica
30(1)
1–59
10.1007/BF01200262
Xian Xu
2012
Distinguishing and Relating Higher-order and First-order Processes by Expressiveness
Acta Informatica
49(7-8)
445–484
10.1007/s00236-012-0168-9
Xian Xu
Qiang Yin
Huan Long
On the Computation Power of Name Parameterization in Higher-order Processes
http://basics.sjtu.edu.cn/~yin/Papers/ice15.pdf
Online version (with appendix) of the ICE 2015 paper
Xian Xu
Qiang Yin
Huan Long
2013
On the Expressiveness of Parameterization in Process-passing
Proceedings of the 10th International Workshop on Web Services and Formal Methods
LNCS
8739
Springer Verlag
147–167
10.1007/978-3-319-08260-8_9