1. Computational interpretations of linear logic;Abramsky;Theoretical Computer Science,1993
2. A. Arbiser, E. Bonelli, and A. Rı´os, Perpetuality in a lambda calculus with explicit substitutions and composition, Workshop Argentino de Informática Teórica (WAIT), JAIIO, 2000.
3. Explicit substitutions;Abadi;Journal of Functional Programming,1991
4. A. Asperti, S. Guerrini, The Optimal Implementation of Functional Programming Languages, volume 45 of Cambridge Tracts in Theoretical Computer Science Cambridge University Press, 1998.
5. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984. Revised Edition.