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.

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

 

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:

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:

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

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

 

# Hindley, J.R. and Seldin, J.P. (1986), ''Introduction to Combinators and <math>\lambda</math>-Calculus'', London Mathematical Society Student Texts No.&nbsp;1, Cambridge University Press, Cambridge, UK.

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

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

 

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

==Work Area==

==Work Area==