-Here's more to read about combinatory logic.
-Surely the most entertaining exposition is Smullyan's [[!wikipedia To_Mock_a_Mockingbird]].
-Other sources include
-
-* [[!wikipedia Combinatory logic]] at Wikipedia
-* [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
-* [[!wikipedia SKI combinatory calculus]]
-* [[!wikipedia B,C,K,W system]]
-* [Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/)
-* Jeroen Fokker, "The Systematic Construction of a One-combinator Basis for Lambda-Terms" <cite>Formal Aspects of Computing</cite> 4 (1992), pp. 776-780.
-<http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
+Here's more to read about Combinatory Logic. Surely the most entertaining exposition is Smullyan's [[!wikipedia To_Mock_a_Mockingbird]].
+Other sources include:
+
+* [[!wikipedia Combinatory logic]] at Wikipedia
+* [Combinatory logic](http://plato.stanford.edu/entries/logic-combinatory/) at the Stanford Encyclopedia of Philosophy
+* [[!wikipedia SKI combinatory calculus]]
+* [[!wikipedia B,C,K,W system]]
+* [Chris Barker's Iota and Jot](http://semarch.linguistics.fas.nyu.edu/barker/Iota/)
+* Jeroen Fokker, "The Systematic Construction of a One-combinator Basis for Lambda-Terms" <cite>Formal Aspects of Computing</cite> 4 (1992), pp. 776-780. <http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>