1. Barendregt, H., The Lambda Calculus, Its Syntax and Semantics, North-Holland, Amsterdam, 1984. Zbl 0551.03007 MR 86a:03012
2. Breazu-Tannen V., “Combining algebra and higher-order types,” pp. 82–90 in Proceedings of the Third Annual Symposium on Logic in Computer Science, 1988.
3. Breazu-Tannen, V., and J. Gallier, “Polymorphic rewriting conserves algebraic strong normalization,” Theoretical Computer Science, vol. 83 (1991), pp. 3–28. Zbl 0745.68065
4. Breazu-Tannen, V., and J. Gallier, “Polymorphic rewriting conserves algebraic confluence,” Information and Computation, vol. 114 (1994), pp. 1–29. Zbl 0820.68059 MR 95i:68066
5. Curry, H., and R. Feys, Combinatory Logic, Vol. I, North-Holland, Amsterdam, 1958. Zbl 0081.24104 MR 20:817