1. Martín Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, October 1991.
2. Samson Abramsky. The lazy lambda calculus. In David Turner, editor, Research Topics in Functional Programming, pages 65–116. Addison-Wesley, 1990.
3. Thorsten Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In TLCA '93 International Conference on Typed Lambda Calculi and Applications, Utrecht, 16–18 March 1993, volume 664 of Lecture Notes in Computer Science, pages 13–28. Springer-Verlag, 1993.
4. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in logic and the foundations of mathematics. North-Holland, revised edition, 1984.
5. Richard Boulton, Andrew Gordon, Mike Gordon, John Harrison, John Herbert, and John Van Tassel. Experience with embedding hardware description languages in HOL. In V. Stavridou, T. F. Melham, and R. T. Boute, editors, Theorem Provers in Circuit Design: Theory, Practice and Experience: Proceedings of the IFIP TC10/WG 10.2 International Conference, Nijmegen, June 1992, IFIP Transactions A-10, pages 129–156. North-Holland, 1992.