1. ARSAC J., Les langages sans étiquettes. Publication 73/13. Institut de Programmation. Université de Paris VI.0291.68030
2. BOHM C. et JACOPINI G., Flow diagrams, Turing machines and languages with only two formation rules, Comm. ACM, may 1966, vol. 9, n° 5, 366-371.0145.24204
3. CADIOU J., Recursive definitions of partial functions and their conditions. Ph D, thesis. Computer Science department, Stanford University. June 1972.
4. KLEENE S. C., Introduction to Metamathematics (the récursion theorem, p. 348). Van Nostrand, 1952.0047.00703
5. KOTT J., Remarques sur la structure des schémas de programme, in Théorie des automates, des langages et de la programmation, Colloques IRIA, 1972, pp. 191-194.0262.68005