1. Abelson, H., and Sussman, G., Structure And Interpretation Of Computer Progams, MIT Press/McGraw-Hill, NY, 1984.
2. Aho, A.V. and Ullman, J.D., Principles of Compiler Design, Addison-Wesley, 1979.
3. Auslander, M.A., and Strong, H.R., “Systematic recursion removal”, Communications ACM, 21, no. 2, pp 127–134, Feb 1978.
4. Barendregt, H.P., The Lambda Calculus, Its Syntax and Semantics, revised edition, North-Holland, Amsterdam, 1984.
5. Böhm, C., and Berarducci, A., “Automatic synthesis of typed lambda-programs on term algebras”, Theoretical Computer Science, 39, pp 135–154, 1985.