M. Abadi, &. Andrew, and D. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.36-47, 1997.
DOI : 10.1145/266420.266432

J. Bengtson, M. Johansson, J. Parrow, and &. Victor, Psi-calculi: a framework for mobile processes with nominal data and logic, Logical Methods in Computer Science, vol.7, issue.1, pp.10-2168, 2011.
DOI : 10.2168/LMCS-7(1:11)2011

J. Bengtson and &. Parrow, Formalising the pi-calculus using nominal logic, Logical Methods in Computer Science, vol.5, issue.2, pp.10-2168, 2009.
DOI : 10.2168/LMCS-5(2:16)2009
URL : http://arxiv.org/abs/0809.3960

J. Borgström, R. Gutkovas, J. Parrow, B. Victor, and &. Pohjola, A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) In: Trustworthy Global Computing, pp.103-118, 2013.

G. Boudol, Notes on Algebraic Calculi of Processes Logics and Models of Concurrent Systems, pp.261-303, 1985.

N. Busi, R. Gorrieri, and &. Zavattaro, On the Expressiveness of Linda Coordination Primitives, Information and Computation, vol.156, issue.1-2, pp.90-121, 2000.
DOI : 10.1006/inco.1999.2823

M. Carbone and &. Maffeis, On the Expressive Power of Polyadic Synchronisation in ??-calculus, Electronic Notes in Theoretical Computer Science, vol.68, issue.2, 2003.
DOI : 10.1016/S1571-0661(05)80361-5

G. Castagna, R. De-nicola, and &. Varacca, Semantic subtyping for the pi-calculus, Theoretical Computer Science, vol.398, issue.1-3, pp.217-242, 2008.
DOI : 10.1016/j.tcs.2008.01.049
URL : https://hal.archives-ouvertes.fr/hal-00148929

R. De-nicola, D. Gorla, and &. Rosario-pugliese, On the expressive power of KLAIM-based calculi, Theoretical Computer Science, vol.356, issue.3, pp.387-421, 2006.
DOI : 10.1016/j.tcs.2006.02.007

D. Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems, vol.7, issue.1, pp.80-112, 1985.
DOI : 10.1145/2363.2433

T. Given-wilson, Concurrent Pattern Unification, 2012.

T. Given-wilson, An Intensional Concurrent Faithful Encoding of Turing Machines, 7th Interaction and Concurrency Experience, 2014.
DOI : 10.4204/EPTCS.166.4
URL : https://hal.archives-ouvertes.fr/hal-00987594

T. Given-wilson, Expressiveness via Intensionality and Concurrency, 2014.
DOI : 10.1007/978-3-319-10882-7_13
URL : https://hal.archives-ouvertes.fr/hal-00999082

T. Given-wilson and D. Gorla, Pattern Matching and Bisimulation, Coordination Models and Languages, pp.60-74, 2013.
DOI : 10.1007/978-3-642-38493-6_5
URL : https://hal.archives-ouvertes.fr/hal-01486035

T. Given-wilson, D. Gorla, and &. Jay, Concurrent Pattern Calculus, Theoretical Computer Science, IFIP Advances in Information and Communication Technology, pp.244-258, 2010.
DOI : 10.1007/978-3-642-15240-5_18
URL : https://hal.archives-ouvertes.fr/hal-01054456

T. Given-wilson, D. Gorla, and &. Jay, A Concurrent Pattern Calculus. To appear in: Logical Methods in Computer Science, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00987578

T. Jay, Getting the Goods with Concurrent bondi, Proceedings of the Fourth Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES), 2011.

D. Gorla, Comparing communication primitives via their relative expressive power, Information and Computation, vol.206, issue.8, pp.931-952, 2008.
DOI : 10.1016/j.ic.2008.05.001

D. Gorla, A taxonomy of process calculi for distribution and mobility, Distributed Computing, vol.13, issue.5, pp.273-299, 2010.
DOI : 10.1007/s00446-010-0120-6

D. Gorla, Towards a unified approach to encodability and separation results for process calculi, Information and Computation, vol.208, issue.9, pp.1031-1053, 2010.
DOI : 10.1016/j.ic.2010.05.002

C. Haack and &. Jeffrey, Pattern-matching spi-calculus, Information and Computation, vol.204, issue.8, pp.1195-1263, 2006.
DOI : 10.1016/j.ic.2006.04.004
URL : http://doi.org/10.1016/j.ic.2006.04.004

S. Bjrn-haagensen, &. Maffeis, and . Phillips, Matching Systems for Concurrent Calculi, Proceedings of the 14th International Workshop on Expressiveness in Concurrency, pp.85-99, 2007.
DOI : 10.1016/j.entcs.2007.11.004

K. Honda and &. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.152, issue.95, pp.437-48610, 1995.

B. Jay and &. Thomas-given-wilson, Abstract, The Journal of Symbolic Logic, vol.2, issue.03, pp.807-826, 2011.
DOI : 10.1145/321738.321750

I. Lanese, J. A. Pérez, D. Sangiorgi, and &. Schmitt, On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi, Proc. of ICALP, pp.442-453, 2010.
DOI : 10.1007/978-3-642-14162-1_37
URL : https://hal.archives-ouvertes.fr/inria-00514912

I. Lanese, C. Vaz, and C. Ferreira, On the Expressive Power of Primitives for Compensation Handling, Proceedings of the 19th European Conference on Programming Languages and Systems, ESOP'10, pp.366-386, 2010.
DOI : 10.1007/978-3-642-11957-6_20

R. Milner, The polyadic ??-calculus, NATO ASI, 1993.
DOI : 10.1007/BFb0084778

R. Milner, J. Parrow, and &. Walker, A calculus of mobile processes, I, Information and Computation, vol.100, issue.1, pp.1-4010, 1992.
DOI : 10.1016/0890-5401(92)90008-4

R. Milner, J. Parrow, and &. Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.41-7710, 1992.
DOI : 10.1016/0890-5401(92)90009-5

R. De-nicola, G. L. Ferrari, and R. Pugliese, KLAIM: a kernel language for agents interaction and mobility, IEEE Transactions on Software Engineering, vol.24, issue.5, pp.315-33010, 1998.
DOI : 10.1109/32.685256

L. Nielsen, N. Yoshida, and &. Honda, Multiparty Symmetric Sum Types, Electronic Proceedings in Theoretical Computer Science, vol.41, pp.121-135, 2010.
DOI : 10.4204/EPTCS.41.9
URL : http://doi.org/10.4204/eptcs.41.9

C. Palamidessi, Comparing the expressive power of the synchronous and asynchronous $pi$ -calculi, Mathematical Structures in Computer Science, vol.13, issue.5, pp.685-71910, 2003.
DOI : 10.1017/S0960129503004043
URL : https://hal.archives-ouvertes.fr/inria-00201104

J. Parrow and &. B. Victor, The fusion calculus: expressiveness and symmetry in mobile processes, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.176-18510, 1998.
DOI : 10.1109/LICS.1998.705654

J. Parrow, Expressiveness of Process Algebras, Electronic Notes in Theoretical Computer Science, vol.209, pp.173-186, 2008.
DOI : 10.1016/j.entcs.2008.04.011

V. A. Saraswat, M. Rinard, and &. Prakash-panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-35210, 1991.
DOI : 10.1145/99583.99627

S. Robert-de, Higher-Level Synchronising Devices in Meije-SCCS, Theor. Comput. Sci, vol.3785, pp.245-26710, 1985.

C. Urban, S. Berghofer, and &. Michael-norrish, Barendregt???s Variable Convention in Rule Inductions, Lecture Notes in Computer Science, vol.4603, pp.35-50, 2007.
DOI : 10.1007/978-3-540-73595-3_4