1. Barendregt, H. P. (1984). The lambda calculus, its syntax and semantics (Revised ed.). Amsterdam: North-Holland.
2. Curry, H. B., & Feys, R. (1958). Combinatory logic (Vol. I). Amsterdam: North-Holland.
3. David, R. (2009). A direct proof of the confluence of combinatory strong reduction. Theoretical Computer Science, 410, 4204–4201.
4. Hasegawa, R., Paolini, L. & Urzyczyn, P., eds. (2006). TLCA (Typed Lambda Calculi and Applications) list of open problems. http//tlca.di.unito.it/opltlca/
5. Hindley, J. R., & Lercher, B. (1970). A short proof of Curry’s normal form theorem. Proceedings of American Mathematical Society, 24, 808–810.