Beniamino Accattoli (2011):
Jumping around the box: graphical and operational studies on λ-calculus and Linear Logic.
PhD thesis.
La Sapienza University of Rome.
Beniamino Accattoli (2012):
A linear analysis of call-by-value λ-calculus.
Available at the address https://sites.google.com/site/beniaminoaccattoli/Accattoli-Alinearanalysisofcall-by-valuelambdacalculus.pdf?attredirects=0.
Beniamino Accattoli (2012):
Proof nets and the call-by-value λ-calculus.
LSFA 2012.
Available at the address https://sites.google.com/site/beniaminoaccattoli/Accattoli-Proofnetsandthecallbyvaluelambdacalculus.pdf?attredirects=0.
Beniamino Accattoli & Ugo Dal Lago (2012):
On the Invariance of the Unitary Cost Model for Head Reduction.
In: RTA,
pp. 22–37.
Available at http://dx.doi.org/10.4230/LIPIcs.RTA.2012.22.
Gérard Boudol (1998):
The π-Calculus in Direct Style.
Higher-Order and Symbolic Computation 11(2),
pp. 177–208.
Available at http://dx.doi.org/10.1023/A:1010064516533.
Gérard Boudol & Cosimo Laneve (1996):
The Discriminating Power of Multiplicities in the Lambda-Calculus.
Inf. Comput. 126(1),
pp. 83–102.
Available at http://dx.doi.org/10.1006/inco.1996.0037.
Matteo Cimini, Claudio Sacerdoti Coen & Davide Sangiorgi (2010):
Functions as Processes: Termination and the λμtilde07Eμ-Calculus.
In: TGC,
pp. 73–86.
Available at http://dx.doi.org/10.1007/978-3-642-15640-3_5.
Vincent Danos & Laurent Regnier (1999):
Reversible, Irreversible and Optimal lambda-Machines.
Theor. Comput. Sci. 227(1-2),
pp. 79–97.
Available at http://dx.doi.org/10.1016/S0304-3975(99)00049-3.
Vincent Danos & Laurent Regnier (2004):
Head Linear Reduction.
Technical Report.
Henry DeYoung, Luís Caires, Frank Pfenning & Bernardo Toninho (2012):
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication.
In: CSL,
pp. 228–242.
Available at http://dx.doi.org/10.4230/LIPIcs.CSL.2012.228.
Thomas Ehrhard & Olivier Laurent (2010):
Interpreting a finitary pi-calculus in differential interaction nets.
Inf. Comput. 208(6),
pp. 606–633.
Available at http://dx.doi.org/10.1016/j.ic.2009.06.005.
Thomas Ehrhard & Laurent Regnier (2006):
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms.
In: CiE,
pp. 186–197.
Available at http://dx.doi.org/10.1007/11780342_20.
Kohei Honda & Olivier Laurent (2010):
An exact correspondence between a typed pi-calculus and polarised proof-nets.
Theor. Comput. Sci. 411(22-24),
pp. 2223–2238.
Available at http://dx.doi.org/10.1016/j.tcs.2010.01.028.
John Maraist, Martin Odersky, David N. Turner & Philip Wadler (1999):
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci. 228(1-2),
pp. 175–210.
Available at http://dx.doi.org/10.1016/S0304-3975(98)00358-2.
Gianfranco Mascari & Marco Pedicini (1994):
Head Linear Reduction and Pure Proof Net Extraction.
Theor. Comput. Sci. 135(1),
pp. 111–137.
Available at http://dx.doi.org/10.1016/0304-3975(94)90263-1.
Damiano Mazza (2003):
Pi et Lambda. Une étude sur la traduction des lambda-termes dans le pi-calcul.
Memoire de DEA (in french).
Dale Miller & Alwen Tiu (2010):
Proof search specifications of bisimulation and modal logics for the π-calculus.
ACM Trans. Comput. Log. 11(2).
Available at http://doi.acm.org/10.1145/1656242.1656248.
Robin Milner (2007):
Local Bigraphs and Confluence: Two Conjectures.
Electr. Notes Theor. Comput. Sci. 175(3),
pp. 65–73.
Available at http://dx.doi.org/10.1016/j.entcs.2006.07.035.
Davide Sangiorgi (1994):
The Lazy Lambda Calculus in a Concurrency Scenario.
Inf. Comput. 111(1),
pp. 120–153.
Available at http://dx.doi.org/10.1006/inco.1994.1042.
Davide Sangiorgi (1999):
From lambda to pi; or, Rediscovering continuations.
Math. Str. in Comput. Sci. 9(4),
pp. 367–401.
Available at http://dx.doi.org/10.1017/S0960129599002881.
Davide Sangiorgi & David Walker (2001):
The Pi-Calculus - a theory of mobile processes.
Cambridge University Press.
Vasco Thudichum Vasconcelos (2005):
Lambda and pi calculi, CAM and SECD machines.
J. Funct. Program. 15(1),
pp. 101–127.
Available at http://dx.doi.org/10.1017/S0956796804005386.