Changes

===Commentary Note 2===

===Commentary Note 2===

Notice that I am carrying out combinator applications "on the right", so the formulas might be backwards from what many people are used to.

Re: PAT. http://stderr.org/pipermail/inquiry/2005-July/thread.html#2872

Notice that I am carrying out combinator applications "on the right",

Here are a three references on combinatory logic and lambda calculus, given in order of difficulty from introductory to advanced, that are especially pertinent to the use of combinators in computer science:

so the formulas might be backwards from what many people are used to.

Here are a three references on combinatory logic and lambda calculus,

* Smullyan, R., ''To Mock a Mockingbird, And Other Logic Puzzles, Including an Amazing Adventure in Combinatory Logic'', Alfred A. Knopf, New York, NY, 1985.

given in order of difficulty from introductory to advanced, that are

| Smullyan, R.,

* Hindley, J.R. and Seldin, J.P., ''Introduction to Combinators and λ-Calculus'', London Mathematical Society Student Texts No. 1, Cambridge University Press, Cambridge, UK, 1986.

|'To Mock a Mockingbird, And Other Logic Puzzles,

| Including an Amazing Adventure in Combinatory Logic',

| Alfred A. Knopf, New York, NY, 1985.

* Lambek, J. and Scott, P.J., ''Introduction To Higher Order Categorical Logic'', Cambridge University Press, Cambridge, UK, 1986.

 

| Lambek, J. and Scott, P.J.,

|'Introduction To Higher Order Categorical Logic',

| Cambridge University Press, Cambridge, UK, 1986.

==Work Area==

==Work Area==