Functional Programming and Combinatory Algebras

[1]  Mario Coppo,et al.  A Completeness Theorem for Recursively Defined Types , 1985, ICALP.

[2]  Thomas Johnsson,et al.  Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.

[3]  Corrado Böhm,et al.  Combinatory foundation of functional programming , 1982, LFP '82.

[4]  J. Backus.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[5]  S. Kamal Abdali,et al.  An abstraction algorithm for combinatory logic , 1976, Journal of Symbolic Logic.

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

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

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

[9]  M. Schönfinkel.  Über die Bausteine der mathematischen Logik , 1924 .

[10]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[11]  Corrado Böhm,et al.  Automatic Synthesis of Typed Lambda-Programs on Term Algebras , 1985, Theor. Comput. Sci..

[12]  H. Keisler,et al.  Handbook of mathematical logic , 1977 .

[13]  C. Böhm,et al.  λ-Calculus and Computer Science Theory , 1975, Lecture Notes in Computer Science.

[14]  C. Parsons.  Hierarchies of Primitive Recursive Functions , 1968 .

[15]  A. Church.  The calculi of lambda-conversion , 1941 .