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

J. Bengtson and J. Parrow, Formalising the pi-calculus using nominal logic, Logical Methods in Computer Science, vol.5, issue.2, 2009.
DOI : 10.2168/LMCS-5(2:16)2009

G. Boudol, Notes on Algebraic Calculi of Processes, Logics and Models of Concurrent Systems, pp.261-303, 1985.
DOI : 10.1007/978-3-642-82453-1_9
URL : https://hal.archives-ouvertes.fr/inria-00076161

N. Busi, R. Gorrieri, and G. 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 S. Maffeis, On the expressive power of polyadic synchronisation in ?calculus, Nordic Journal of Computing, vol.10, issue.2, pp.70-98, 2003.

F. S. De-boer and C. Palamidessi, Concurrent logic programming: Asynchronism and language comparison, Proceedings of the 1990 North American Conference on Logic Programming, pp.175-194, 1990.

F. S. Deboer and C. Palamidessi, Embedding as a tool for language comparison. Information and computation, pp.128-157, 1994.

C. Fournet and G. Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.372-385, 1996.
DOI : 10.1145/237721.237805

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, Proceedings ICE 2014, pp.21-37, 2014.
DOI : 10.4204/EPTCS.166.4
URL : https://hal.archives-ouvertes.fr/hal-00987594

T. Given-wilson, On the Expressiveness of Intensional Communication, Proceedings of EXPRESS/SOS, 2014.
DOI : 10.4204/EPTCS.160.4
URL : https://hal.archives-ouvertes.fr/hal-01026301

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 B. Jay, A Concurrent Pattern Calculus, Logical Methods in Computer Science, vol.10, issue.3, p.2014
URL : https://hal.archives-ouvertes.fr/hal-00987578

T. Given-wilson and A. Legay, On the Expressiveness of Joining, ICE 2015, 2015.
DOI : 10.4204/EPTCS.189.9
URL : https://hal.archives-ouvertes.fr/hal-01152456

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, 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

B. Jay, The pattern calculus, ACM Transactions on Programming Languages and Systems, vol.26, issue.6, 2009.
DOI : 10.1145/1034774.1034775

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

I. Lanese, J. Prez, D. Sangiorgi, and A. Schmitt, On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi, Automata, Languages and Programming, 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: a Tutorial, Logic and Algebra of Specification of Series F. NATO ASI, 1993.
DOI : 10.1007/978-3-642-58041-3_6

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

L. Nielsen, N. Yoshida, and K. Honda, Multiparty Symmetric Sum Types, Proceedings of EXPRESS, pp.121-135, 2010.
DOI : 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-719, 2003.
DOI : 10.1017/S0960129503004043
URL : https://hal.archives-ouvertes.fr/inria-00201104

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

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-185, 1998.
DOI : 10.1109/LICS.1998.705654

K. Peters, Translational expressiveness: comparing process calculi using encodings, Fakultät IV

E. Shapiro, Separating concurrent languages with categories of language embeddings, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.198-208, 1991.
DOI : 10.1145/103418.103423

R. J. Van-glabbeek, Musings on Encodings and Expressiveness, Proceedings of EX- PRESS/SOS, pp.81-98, 2012.
DOI : 10.4204/EPTCS.89.7

@. If, interacts via only the form (?q).T then it follows that

@. Therefore, must have multiple forms of interaction, which can in turn be used to show that the encoding is contradictory via either operational correspondence or divergence reflection