论文信息 - Combinators, Proofs and Implicational Logics

Combinators, Proofs and Implicational Logics

In this chapter we first look at operators called combinators. These are very simple but extremely powerful. They provide a means of doing logic and mathematics without using variables, are powerful enough to allow the definition of all recursive functions and have more recently been used as a basis for certain “functional” computer languages.

Martin W. Bunder

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

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

[3] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .

[4] Martin W. Bunder,et al. Lambda Terms Definable as Combinators , 1996, Theor. Comput. Sci..

[5] John N. Crossley,et al. Extracting programs from proofs by an extension of the Curry-Howard process , 1993 .

[6] J. V. Tucker,et al. Basic Simple Type Theory , 1997 .

[7] Alasdair Urquhart. The Complexity of Decision Procedures in Relevance Logic II , 1999 .

[8] Sachio Hirokawa. The proofs of α → α in P - W , 1996 .

[9] de Ng Dick Bruijn,et al. The mathematical language AUTOMATH, its usage, and some of its extensions , 1970 .

[10] de Ng Dick Bruijn,et al. A survey of the project Automath , 1980 .

[11] H. Läuchli. An Abstract Notion of Realizability for Which Intuitionistic Predicate Calculus is Complete , 1970 .

[12] Martin W. Bunder,et al. Combinatory Abstraction Bsing B, B' and Friends , 1994, Theor. Comput. Sci..

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