1. 1. BARENDREGT H. P., Some Extensional Term Models for Combinatory Logics and λ-calculi, Ph. D. Thesis, Utrecht University, 1971.
2. 2.BÖHM C., The CUCH as a Formal and Description Language, in Formal Language, Description Languages for Computer Programming, T. B. STEELE, Jr, éd., 1966, p. 179-197, North Holland, Amsterdam.
3. 3. BÖHM C. et DEZANI-CIANCAGLINI M., Lambda-Terms as Total or Partial Function on Normal Forms, in Lambda Calculus and Computer Science Theory, C. BÖHM, éd., Lecture Notes in Computer Science n° 37, 1975, p. 96-121, Springer-Verlag.4852960342.02017
4. 4. BÖHM C. et DEZANI-CIANCAGLINI M., Termination Test Inside λ-Calculus, Automata Languages and Programming, (ICALP'77) A. SALOMAS, éd., Lecture Notes in Computer Science, n° 52, 1977, p. 95-110, Springer-Verlag.4658070358.02025
5. 5.CURRY H. B., HINDLEY J. R. et SELDIN J. P., Combinatory Logic, Amsterdam, North Holland, vol. II 1972.0242.02029