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/cbv-analysis.pdf?attredirects=0.
Roberto Di Cosmo & Delia Kesner (1997):
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract).
In: LICS,
pp. 35–46.
Available at http://doi.ieeecomputersociety.org/10.1109/LICS.1997.614927.
Roberto Di Cosmo, Delia Kesner & Emmanuel Polonovski (2003):
Proof Nets And Explicit Substitutions.
Math. Str. in Comput. Sci. 13(3),
pp. 409–450.
Available at http://dx.doi.org/10.1017/S0960129502003791.
Vincent Danos (1990):
La Logique Linéaire appliqué à l'étude de divers processus de normalisation (principalment du λ-calcul).
Phd thesis.
Université Paris 7.
Vincent Danos & Laurent Regnier (1995):
Proof-nets and the Hilbert space.
In: Advances in Linear Logic.
Cambridge University Press,
pp. 307–328.
Available at http://dx.doi.org/10.1017/CBO9780511629150.016.
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.
Maribel Fernández & Ian Mackie (2002):
Call-by-Value lambda-Graph Rewriting Without Rewriting.
In: ICGT,
pp. 75–89.
Available at http://dx.doi.org/10.1007/3-540-45832-8_8.
Maribel Fernández & Nikolaos Siafakas (2009):
Labelled Lambda-calculi with Explicit Copy and Erase.
In: LINEARITY,
pp. 49–64.
Available at http://dx.doi.org/10.4204/EPTCS.22.5.
Cormac Flanagan, Amr Sabry, Bruce F. Duba & Matthias Felleisen (1993):
The Essence of Compiling with Continuations.
In: PLDI,
pp. 237–247.
Available at http://doi.acm.org/10.1145/155090.155113.
Hugo Herbelin & Stéphane Zimmermann (2009):
An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form.
In: TLCA,
pp. 142–156.
Available at http://dx.doi.org/10.1007/978-3-642-02273-9_12.
Delia Kesner & Stéphane Lengrand (2007):
Resource operators for lambda-calculus.
Inf. Comput. 205(4),
pp. 419–473.
Available at http://dx.doi.org/10.1016/j.ic.2006.08.008.
Ian Mackie (2005):
Encoding Strategies in the Lambda Calculus with Interaction Nets.
In: IFL,
pp. 19–36.
Available at http://dx.doi.org/10.1007/11964681_2.
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.
Alberto Pravato, Simona Ronchi Della Rocca & Luca Roversi (1999):
The call-by-value λ-calculus: a semantic investigation.
Math. Str. in Comput. Sci. 9(5),
pp. 617–650.
Available at http://dx.doi.org/10.1017/S0960129598002722.
Laurent Regnier (1992):
Lambda-calcul et réseaux.
PhD thesis.
Univ. Paris VII.
Amr Sabry & Matthias Felleisen (1993):
Reasoning about Programs in Continuation-Passing Style.
Lisp and Symbolic Computation 6(3-4),
pp. 289–360.
Available at http://dx.doi.org/10.1007/BF01019462.
Paolo Tranquilli (2009):
Nets Between Determinism and Nondeterminism.
Ph.D. thesis.
Università degli Studi Roma Tre/Université Paris Diderot (Paris 7).
Paolo Tranquilli (2011):
Intuitionistic differential nets and lambda-calculus.
Theor. Comput. Sci. 412(20),
pp. 1979–1997.
Available at http://dx.doi.org/10.1016/j.tcs.2010.12.022.
Lionel Vaux (2007):
λ-calcul différentiel et logique classique: interactions calculatoires.
Ph.D. thesis.
Université Aix-Marseille II.
eptcs@eptcs.org