Complexité de la réduction en logique combinatoire

[1]  Mariangiola Dezani-Ciancaglini,et al.  Termination Tests inside lambda-Calculus , 1977, ICALP.

[2]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[3]  Bernard Robinet,et al.  Un Modèle Fonctionnel des Structures de Contrôle , 1977, RAIRO Theor. Informatics Appl..

[4]  J. Vuillemin.  Proof techniques for recursive programs , 1973 .

[5]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[6]  J. Rosser.  A Mathematical Logic Without Variables. I , 1935 .

[7]  Carlo Batini,et al.  On subrecursiveness in weak combinatory logic , 1975, Lambda-Calculus and Computer Science Theory.

[8]  John C. Reynolds,et al.  GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept , 1970, Commun. ACM.

[9]  P. J. Landin.  A λ-CALCULUS APPROACH , 1966 .

[10]  Mariangiola Dezani-Ciancaglini,et al.  Combinatorial Problems, Combinator Equations and Normal Forms , 1974, ICALP.

[11]  R. M. Burstall,et al.  Advances in programming and non-numerical computation , 1967, The Mathematical Gazette.

[12]  Giorgio Ausiello,et al.  Abstract Computational Complexity and Cycling Computations , 1971, J. Comput. Syst. Sci..

[13]  Luis E. Sanchis,et al.  Types in combinatory logic , 1964, Notre Dame J. Formal Log..

[14]  Mariangiola Dezani-Ciancaglini,et al.  Lambda-terms as total or partial functions on normal forms , 1975, Lambda-Calculus and Computer Science Theory.