The search for a reduction in combinatory logic equivalent to λβ-reduction

Combinatory logic (CL) is generally regarded as equivalent to @l-calculus (@l), and in most respects, it is. However, with respect to reduction, the equivalence is not complete. In CL, there is not, as yet, a reduction relation which is generally accepted as an equivalent to @[email protected] in @l. There are some proposals for such a reduction, but so far none of them has as yet a complete syntactically useful characterization of the irreducible CL-terms. This paper is about the search for a reduction on CL equivalent to @[email protected]

[1]  J. Barkley Rosser,et al.  New sets of postulates for combinatory logics , 1942, Journal of Symbolic Logic.

[2]  J. Roger Hindley,et al.  Lambda-Calculus and Combinators: An Introduction , 2008 .

[3]  Adolfo Piperno,et al.  Abstraction Problems in Combinatory Logic a Compositive Approach , 1989, Theor. Comput. Sci..

[4]  Mohamed Mezghiche.  c-beta-Machine with lambda-beta-Reduction , 1997, Theor. Comput. Sci..

[5]  Haskell B. Curry,et al.  Some Additions to the Theory of Combinators , 1932 .

[6]  Haskell B. Curry,et al.  The paradox of Kleene and Rosser , 1941 .

[7]  S. Kleene.  Review: Haskell B. Curry, A Simplification of the Theory of Combinators , 1952 .

[8]  W. A. Howard.  Assignment of Ordinals to Terms for Primitive Recursive Functionals of Finite Type , 1970 .

[9]  William C. Frederick,et al.  A Combinatory Logic , 1995 .

[10]  A. Church.  A Set of Postulates for the Foundation of Logic , 1932 .

[11]  H. B. Curry.  First Properties of Functionality in Combinatory Logic , 1935 .

[12]  Mohamed Mezghiche.  On Pseudo-c-beta-Normal Form in Combinatory Logic , 1989, Theor. Comput. Sci..

[13]  Haskell B. Curry,et al.  Apparent Variables From the Standpoint of Combinatory Logic , 1933 .

[14]  J. Heijenoort.  From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 , 1967 .

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

[16]  H. B. Curry.  An Analysis of Logical Substitution , 1929 .

[17]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[18]  Mohamed Mezghiche.  Une Nouvelle C beta-Réduction dans la Logique Combinatoire , 1984, Theor. Comput. Sci..

[19]  H B Curry,et al.  Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.

[20]  S. Kleene,et al.  The Inconsistency of Certain Formal Logics , 1935 .

[21]  H. B. Curry.  Some Properties of Equality and Implication in Combinatory Logic , 1934 .

[22]  BRUCE LERCHER.  Lambda-calculus terms that reduce to themselves , 1976, Notre Dame J. Formal Log..

[23]  Haskell B. Curry.  The Universal Quantifier in Combinatory Logic , 1931 .

[24]  Haskell B. Curry.  Grundlagen der kombinatorischen Logik , 1930 .

[25]  Haskell B. Curry,et al.  The Undecidability of λK-Conversion , 1969 .

[26]  J. Roger Hindley.  Combinatory Reductions and Lambda Reductions Compared , 1977, Math. Log. Q..

[27]  Sushant Deshpande.  A new program for combinatory reduction and abstraction , 2009 .

[28]  H B Curry.  Some Advances in the Combinatory Theory of Quantification. , 1942, Proceedings of the National Academy of Sciences of the United States of America.