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.
Hendrik Pieter Barendregt (1984):
The Lambda calculus: Its syntax and semantics.
North-Holland,
Amsterdam.
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.
Gerard Berry & Gerard Boudol (1990):
The Chemical Abstract Machine.
In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '90.
ACM,
New York, NY, USA,
pp. 81–94,
doi:10.1145/96709.96717.
G.S. Boolos, J.P. Burgess & R.C. Jeffrey (2007):
Computability and Logic.
Cambridge University Press,
doi:10.1017/CBO9780511804076.
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.
H. B. Curry & R. Feys (1958):
Combinatory Logic I.
North-Holland,
Amsterdam.
H. B. Curry, J. R. Hindley & J. P. Seldin (1972):
Combinatory Logic II.
North-Holland,
Amsterdam.
Thomas Given-Wilson (2012):
Concurrent Pattern Unification.
PhD thesis, University of Technology, Sydney,
Australia.
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: CristianS. 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.
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.
S.C. Kleene (1952):
Introduction to Metamathematics.
North-Holland (originally published by D. Van Nostrand).
John McCarthy (1960):
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I.
Commun. ACM 3(4),
pp. 184–195,
doi:10.1145/367177.367199.
Robin Milner (1990):
Functions as processes.
In: MichaelS. Paterson: Automata, Languages and Programming,
Lecture Notes in Computer Science 443,
pp. 167–180,
doi:10.1007/BFb0032030.
Robin Milner (1999):
Communicating and mobile systems - the Pi-calculus.
Cambridge University Press.
Robin Milner, Joachim Parrow & David Walker (1992):
A Calculus of Mobile Processes, I.
Inf. Comput. 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.
Inf. Comput. 100(1),
pp. 41–77,
doi:10.1016/0890-5401(92)90009-5.
J. Parrow & B. Victor (1998):
The fusion calculus: expressiveness and symmetry in mobile processes.
In: Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on,
pp. 176–185,
doi:10.1109/LICS.1998.705654.
M. Schönfinkel (1924):
Über die Bausteine der mathematischen Logik.
Mathematische Annalen 92(3-4),
pp. 305–316,
doi:10.1007/BF01448013.
A. Tarski (1956):
Logic, semantics, metamathematics.
In: Intentions in Communication.
Oxford University Press,
pp. 325–363.
A. M. Turing (1936):
On Computable Numbers, with an application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society 2(42),
pp. 230–265,
doi:10.1112/plms/s2-43.6.544.
A. M. Turing (1937):
Computability and λ-definability..
Journal of Symbolic Logic 2,
pp. 153–163,
doi:10.2307/2268280.
eptcs@eptcs.org