Martín Abadi & Andrew D. Gordon (1997):
A Calculus for Cryptographic Protocols: The Spi Calculus.
In: Proceedings of the 4th ACM Conference on Computer and Communications Security,
CCS '97.
ACM,
New York, NY, USA,
pp. 36–47,
doi:10.1145/266420.266432.
Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2011):
Psi-calculi: a framework for mobile processes with nominal data and logic.
Logical Methods in Computer Science 7(1),
doi:10.2168/LMCS-7(1:11)2011.
Jesper Bengtson & Joachim Parrow (2009):
Formalising the pi-calculus using nominal logic.
Logical Methods in Computer Science 5(2),
doi:10.2168/LMCS-5(2:16)2009.
Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor & Johannes Åman Pohjola (2013):
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract).
In: Trustworthy Global Computing,
pp. 103–118,
doi:10.1007/978-3-319-05119-2_7.
G. Boudol (1985):
Notes on Algebraic Calculi of Processes.
In: Krzysztof R. Apt: Logics and Models of Concurrent Systems.
Springer-Verlag New York, Inc.,
New York, NY, USA,
pp. 261–303,
doi:10.1007/978-3-642-82453-1_9.
Nadia Busi, Roberto Gorrieri & Gianluigi Zavattaro (2000):
On the Expressiveness of Linda Coordination Primitives..
Information and Computation 156(1-2),
pp. 90–121,
doi:10.1006/inco.1999.2823.
Marco Carbone & Sergio Maffeis (2003):
On the Expressive Power of Polyadic Synchronisation in π-calculus.
Nordic Journal of Computing 10(2),
pp. 70–98.
Available at http://dl.acm.org/citation.cfm?id=941344.941346.
Luca Cardelli & Andrew D. Gordon (1998):
Mobile Ambients.
In: Foundations of Software Science and Computation Structures: First International Conference, FoSSaCS '98,
pp. 140–155,
doi:10.1007/BFb0053547.
Giuseppe Castagna, Rocco De Nicola & Daniele Varacca (2008):
Semantic Subtyping for the Pi-calculus.
Theoretical Computer Science 398(1-3),
pp. 217–242,
doi:10.1016/j.tcs.2008.01.049.
Rocco De Nicola, Daniele Gorla & Rosario Pugliese (2006):
On the Expressive Power of KLAIM-based Calculi.
Theoretical Computer Science 356(3),
pp. 387–421,
doi:10.1016/j.tcs.2006.02.007.
David Gelernter (1985):
Generative communication in Linda.
ACM Transactions on Programming Languages and Systems 7(1),
pp. 80–112,
doi:10.1145/2363.2433.
Thomas Given-Wilson (2012):
Concurrent Pattern Unification.
PhD thesis, University of Technology, Sydney,
Australia.
Thomas Given-Wilson (2014):
An Intensional Concurrent Faithful Encoding of Turing Machines.
In: 7th Interaction and Concurrency Experience (ICE 2014),
Berlin, Germany.
Available at http://hal.inria.fr/hal-00987594.
Thomas Given-Wilson (2014):
Expressiveness via Intensionality and Concurrency.
In: To appear in: Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing,
ICTAC 2014.
Available at http://arxiv.org/abs/1404.0956.
Thomas Given-Wilson & Daniele Gorla (2013):
Pattern Matching and Bisimulation.
In: Rocco De Nicola & Christine Julien: Coordination Models and Languages,
Lecture Notes in Computer Science 7890.
Springer Berlin Heidelberg,
pp. 60–74,
doi:10.1007/978-3-642-38493-6_5.
Thomas Given-Wilson, Daniele Gorla & Barry Jay (2010):
Concurrent Pattern Calculus.
In: Cristian S. Calude & Vladimiro Sassone: Theoretical Computer Science,
IFIP Advances in Information and Communication Technology 323.
Springer Berlin Heidelberg,
pp. 244–258,
doi:10.1007/978-3-642-15240-5_18.
Thomas Given-Wilson, Daniele Gorla & Barry Jay (2014):
A Concurrent Pattern Calculus.
To appear in: Logical Methods in Computer Science.
Available at http://hal.inria.fr/hal-00987578.
Thomas Given-Wilson & Barry Jay (2011):
Getting the Goods with Concurrent bondi.
Proceedings of the Fourth Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES).
Rob J. van Glabbeek (2012):
Musings on Encodings and Expressiveness.
In: Proceedings of EXPRESS/SOS,
EPTCS 89,
pp. 81–98,
doi:10.4204/EPTCS.89.7.
D. Gorla (2008):
Comparing Communication Primitives via their Relative Expressive Power.
Information and Computation 206(8),
pp. 931–952,
doi:10.1016/j.ic.2008.05.001.
D. Gorla (2010):
A Taxonomy of Process Calculi for Distribution and Mobility.
Distributed Computing 23(4),
pp. 273–299,
doi:10.1007/s00446-010-0120-6.
D. Gorla (2010):
Towards a Unified Approach to Encodability and Separation Results for Process Calculi.
Information and Computation 208(9),
pp. 1031–1053,
doi:10.1016/j.ic.2010.05.002.
Christian Haack & Alan Jeffrey (2006):
Pattern-matching Spi-calculus.
Information and Computation 204(8),
pp. 1195–1263,
doi:10.1016/j.ic.2006.04.004.
Bjørn Haagensen, Sergio Maffeis & Iain Phillips (2008):
Matching Systems for Concurrent Calculi.
Electronic Notes in Theoretical Computer Science 194(2),
pp. 85 – 99,
doi:10.1016/j.entcs.2007.11.004.
Proceedings of the 14th International Workshop on Expressiveness in Concurrency (EXPRESS 2007).
Kohei Honda & Nobuko Yoshida (1995):
On reduction-based process semantics.
Theoretical Computer Science 152,
pp. 437–486,
doi:10.1016/0304-3975(95)00074-7.
Barry Jay & Thomas Given-Wilson (2011):
A combinatory account of internal structure.
Journal of Symbolic Logic 76(3),
pp. 807–826,
doi:10.2178/jsl/1309952521.
Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi & Alan Schmitt (2010):
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi.
In: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP),
LNCS 6199.
Springer,
pp. 442–453,
doi:10.1007/978-3-642-14162-1_37.
Ivan Lanese, Cátia Vaz & Carla Ferreira (2010):
On the Expressive Power of Primitives for Compensation Handling.
In: Proceedings of the 19th European Conference on Programming Languages and Systems,
ESOP'10.
Springer-Verlag,
Berlin, Heidelberg,
pp. 366–386,
doi:10.1007/978-3-642-11957-6_20.
Robin Milner (1993):
The Polyadic π-Calculus: A Tutorial.
In: Logic and Algebra of Specification,
Series F 94.
NATO ASI.
Springer,
doi:10.1007/978-3-642-58041-3_6.
Robin Milner, Joachim Parrow & David Walker (1992):
A Calculus of Mobile Processes, I.
Information and Computation 100(1),
pp. 1–40,
doi:10.1016/0890-5401(92)90008-4.
Robin Milner, Joachim Parrow & David Walker (1992):
A Calculus of Mobile Processes, II.
Information and Computation 100(1),
pp. 41–77,
doi:10.1016/0890-5401(92)90009-5.
Rocco De Nicola, Gian Luigi Ferrari & Rosario Pugliese (1998):
KLAIM: A Kernel Language for Agents Interaction and Mobility.
IEEE Transactions on Software Engineering 24(5),
pp. 315–330,
doi:10.1109/32.685256.
Lasse Nielsen, Nobuko Yoshida & Kohei Honda (2010):
Multiparty Symmetric Sum Types.
In: Proceedings of the 17th International Workshop on Expressiveness in Concurrency (EXPRESS 2010),
pp. 121–135,
doi:10.4204/EPTCS.41.9.
Catuscia Palamidessi (2003):
Comparing the Expressive Power of the Synchronous and Asynchronous pi-calculi.
Mathematical. Structures in Comp. Sci. 13(5),
pp. 685–719,
doi:10.1017/S0960129503004043.
J. Parrow & B. Victor (1998):
The fusion calculus: expressiveness and symmetry in mobile processes.
In: Proceedings of Thirteenth Annual IEEE Symposium on Logic in Computer Science,
pp. 176–185,
doi:10.1109/LICS.1998.705654.
Joachim Parrow (2008):
Expressiveness of Process Algebras.
Electronic Notes in Theoretical Computer Science 209,
pp. 173–186,
doi:10.1016/j.entcs.2008.04.011.
Vijay A. Saraswat, Martin Rinard & Prakash Panangaden (1991):
The Semantic Foundations of Concurrent Constraint Programming.
In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '91.
ACM,
New York, NY, USA,
pp. 333–352,
doi:10.1145/99583.99627.
Robert de Simone (1985):
Higher-Level Synchronising Devices in Meije-SCCS.
Theoretical Computer Science 37,
pp. 245–267,
doi:10.1016/0304-3975(85)90093-3.
Christian Urban, Stefan Berghofer & Michael Norrish (2007):
Barendregt’s Variable Convention in Rule Inductions.
In: Frank Pfenning: Automated Deduction – CADE-21,
Lecture Notes in Computer Science 4603.
Springer Berlin Heidelberg,
pp. 35–50,
doi:10.1007/978-3-540-73595-3_4.
eptcs@eptcs.org