Mads Sig Ager, Dariusz Biernacki, Olivier Danvy & Jan Midtgaard (2003):
A Functional Correspondence Between Evaluators and Abstract Machines.
In: Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declaritive Programming,
PPDP '03.
ACM,
New York, NY, USA,
pp. 8–19,
doi:10.1145/888251.888254.
H.P Barendregt (1984):
The Lambda Calculus: Its Syntax and Semantics.
North-Holland, Amsterdam.
Małgorzata Biernacka & Olivier Danvy (2007):
A Concrete Framework for Environment Machines.
ACM Transactions on Computational Logic 9(1),
pp. 1–30,
doi:10.1145/1297658.1297664.
Corrado Böhm (1968):
Alcune proprieta delle forme β-η-normali nel λ-K-calcolo.
Pubblicazioni dell'Istituto per le Applicazioni del Calcolo 696.
N.G de Bruijn (1972):
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem.
Indagationes Mathematicae (Proceedings) 75(5),
pp. 381 – 392,
doi:10.1016/1385-7258(72)90034-0.
Alberto Carraro, Thomas Ehrhard & Antonino Salibra (2012):
The stack calculus.
In: Proceedings Seventh Workshop on Logical and Semantic Frameworks, with Applications, LSFA 2012, Rio de Janeiro, Brazil, September 29-30, 2012.,
pp. 93–108,
doi:10.4204/EPTCS.113.10.
P.L. Curien (1988):
The λρ-calculus: an Abstract Framework for Environment Machines.
Ecole Normale Supérieure (Paris). Laboratoire d'Informatique.
Paul Downen & Zena M. Ariola (2014):
The Duality of Construction.
In: Zhong Shao: Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings,
Lecture Notes in Computer Science 8410.
Springer,
pp. 249–269,
doi:10.1007/978-3-642-54833-8_14.
Jean-Yves Girard, Paul Taylor & Yves Lafont (1989):
Proofs and types,
web reprint (2003) edition.
Cambridge University Press.
Hugo Herbelin (2005):
C'est maintenant qu'on calcule : Au cœur de la dualité.
In: Habilitation à diriger les reserches.
J. Hughes (1989):
Why Functional Programming Matters.
Comput. J. 32(2),
pp. 98–107,
doi:10.1093/comjnl/32.2.98.
Jean-Louis Krivine (2007):
A Call-by-name Lambda-calculus Machine.
Higher Order Symbol. Comput. 20(3),
pp. 199–207,
doi:10.1007/s10990-007-9018-9.
Simon Marlow (2002):
State monads don't respect the monad laws in Haskell.
Haskell mailing list.
Guillaume Munch-Maccagnoni (2013):
Syntax and Models of a non-Associative Composition of Programs and Proofs.
Univ. Paris Diderot.
Koji Nakazawa & Tomoharu Nagai (2014):
Reduction System for Extensional Lambda-mu Calculus..
In: RTA-TLCA,
pp. 349–363,
doi:10.1007/978-3-319-08918-8_24.
John C. Reynolds (1972):
Definitional Interpreters for Higher-order Programming Languages.
In: Proceedings of the ACM Annual Conference - Volume 2,
ACM '72.
ACM,
New York, NY, USA,
pp. 717–740,
doi:10.1023/A:1010027404223.
Amr Sabry & Philip Wadler (1997):
A Reflection on Call-by-Value.
ACM Trans. Program. Lang. Syst. 19(6),
pp. 916–941,
doi:10.1145/267959.269968.
Peter Sestoft (2002):
Demonstrating Lambda Calculus Reduction.
In: Torben ÆMogensen, David A. Schmidt & I. Hal Sudborough: The Essence of Computation.
Springer-Verlag New York, Inc.,
New York, NY, USA,
pp. 420–435,
doi:10.1007/3-540-36377-7_20.