M. Abadi & A. Gordon (1997):
A Calculus for Cryptographic Protocols: The Spi Calculus.
In: 4th CCS,
pp. 36–47,
doi:10.1145/266420.266432.
S. Abramsky & C.-H.L. Ong (1993):
Full Abstraction in the Lazy Lambda Calculus.
Information and Computation 105(2),
pp. 159–267,
doi:10.1006/inco.1998.2740.
S. van Bakel, L. Cardelli & M.G. Vigliotti (2008):
From X to π; Representing the Classical Sequent Calculus in the π-calculus.
In: CL&C'08.
S. van Bakel & P. Lescanne (2008):
Computation with Classical Sequents.
Mathematical Structures in Computer Science 18,
pp. 555–609,
doi:10.1017/S0960129508006762.
S. van Bakel & M.G. Vigliotti (2009):
A logical interpretation of the λ-calculus into the π-calculus, preserving spine reduction and types.
In: CONCUR'09,
5710.
Springer,
pp. 84 – 98,
doi:10.1007/978-3-642-04081-8_7.
S. van Bakel & M.G. Vigliotti (2012):
An Output-Based Semantics of λμ with Explicit Substitution in the π-calculus - Extended Abstract.
In: IFIP-TCS 2012,
LNCS 7604.
Springer,
pp. 372–387,
doi:10.1007/978-3-642-33475-7_26.
H. Barendregt (1984):
The Lambda Calculus: its Syntax and Semantics,
revised edition.
North-Holland.
R. Bloo & K.H. Rose (1995):
Preservation of Strong Normalisation in Named Lambda Calculi with Explicit Substitution and Garbage Collection.
In: CSN'95,
pp. 62–72,
doi:10.1.1.51.5026.
A. Church (1936):
A Note on the Entscheidungsproblem.
JSL 1(1),
pp. 40–41,
doi:10.2307/2269326.
M. Cimini, C. Sacerdoti Coen & D. Sangiorgi (2010):
Functions as Processes: Termination and the semcolour`l`m"797E`m-Calculus.
In: TGC'10,
LNCS 6084.
Springer,
pp. 73–86,
doi:10.1007/978-3-642-15640-3_5.
P.-L. Curien & H. Herbelin (2000):
The Duality of Computation.
In: ICFP'00,
ACM Sigplan Notices 35.9.
ACM,
pp. 233–243,
doi:10.1145/351240.351262.
U. de'Liguoro (2014):
The Approximation Theorem for the Λμ-Calculus.
To appear in MSCS.
Ph. de Groote (1994):
On the Relation between the λμ-Calculus and the Syntactic Theory of Sequential Control.
In: LPAR'94,
LNCS 822.
Springer,
pp. 31–43,
doi:10.1007/3-540-58216-9_27.
K. Honda & M. Tokoro (1991):
An Object Calculus for Asynchronous Communication.
In: ECOOP'91,
LNCS 512.
Springer,
pp. 133–147,
doi:10.1007/BFb0057019.
K. Honda, N. Yoshida & M. Berger (2004):
Control in the π-Calculus.
In: Proceedings of Fourth ACM-SIGPLAN Continuation Workshop (CW'04).
J.W. Klop (1992):
Term Rewriting Systems.
In: Handbook of Logic in Computer Science, chapter 1 2.
Clarendon Press,
pp. 1–116.
J-L. Krivine (2007):
A call-by-name lambda-calculus machine.
Higher Order and Symbolic Computation 20(3),
pp. 199–207,
doi:10.1007/s10990-007-9018-9.
Y. Lafont, B. Reus & Th. Streicher (1993):
Continuation Semantics or Expressing Implication by Negation.
Report 9321.
Ludwig-Maximilians-Universität,
München.
R. Milner (1992):
Functions as Processes.
Mathematical Structures in Computer Science 2(2),
pp. 269–310,
doi:10.1017/S0960129500001407.
M. Parigot (1992):
An algorithmic interpretation of classical natural deduction.
In: LPAR'92,
LNCS 624.
Springer,
pp. 190–201,
doi:10.1007/BFb0013061.
W. Py (1998):
Confluence en λμ-calcul.
Phd thesis.
Université de Savoie.
D. Sangiorgi (1994):
The Lazy Lambda Calculus in a Concurrency Scenario.
I&C 111(1),
pp. 120–153,
doi:10.1006/inco.1994.1042.
D. Sangiorgi & D. Walker (2001):
The Pi-Calculus.
Cambridge University Press.
A. Saurin (2010):
Standardization and Böhm Trees for λμ-calculus.
In: M. Blume, N. Kobayashi & G. Vidal: FLOPS'10,
LNCS 6009.
Springer,
pp. 134–149,
doi:10.1007/978-3-642-12251-4_11.
C.P. Wadsworth (1976):
The Relation Between Computational and Denotational Properties for Scott's D_\voidb@x infty-Models of the Lambda-Calculus.
SIAM JoC 5(3),
pp. 488–521,
doi:10.1137/0205036.
eptcs@eptcs.org