1. 1. BARENDREGT H. P., Some Extensional Term Models for Combinatory Logics and λ-calculi, Ph. D. thesis, Utrecht University, the Netherlands, 1971.
2. 2. BÖHM C., The CUCH as a Formal and Description Language, in Formal Language, Description Languages for Computer Programming, T. B. STEAL Jr., éd.,p. 179-197, 1966, North Holland, Amsterdam.
3. 3. BÖHM C. et DEZANI-CIANCAGLINI M., Lambda-Terms as Total or Partial Function on Normal Forms, Lambda Calculus and Computer Science Theory, Lecture Notes in Computer Science, vol. 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, A. SOLOMA, éd., Lecture Notes in Computer Science, vol. 52, 1977, Springer-Verlag, Turku.0358.02025465807
5. 5. CURRY H. B., HINDLEY J. R. et SELDIN J. P., Combinatory Logic, vol. 2, 1972, Amsterdam, North Holland.0242.02029