combinatory tweaks and formatting

[lambda.git] / exercises / assignment3.mdwn

diff --git a/exercises/assignment3.mdwn b/exercises/assignment3.mdwn
index 674cf40..9545021 100644 (file)
--- a/exercises/assignment3.mdwn
+++ b/exercises/assignment3.mdwn
@@ -40,7 +40,7 @@ where `one` abbreviates `succ zero`, and `two` abbreviates `succ (succ zero)`.
 
     You'll need to make use of the predecessor function, but it's not essential to understanding this problem that you have successfully implemented it yet. You can treat it as a black box.
 
 
     You'll need to make use of the predecessor function, but it's not essential to understanding this problem that you have successfully implemented it yet. You can treat it as a black box.
 

-## Combinatorial Logic
+## Combinatory Logic

 
 Reduce the following forms, if possible:
 
 
 Reduce the following forms, if possible:
 


@@ -53,7 +53,7 @@ Reduce the following forms, if possible:
 
 <!-- -->
 
 
 <!-- -->
 

-16. Give Combinatorial Logic combinators (that is, expressed in terms of `S`, `K`, and `I`) that behave like our boolean functions. You'll need combinators for `true`, `false`, `neg`, `and`, `or`, and `xor`.
+16. Give Combinatory Logic combinators (that is, expressed in terms of `S`, `K`, and `I`) that behave like our boolean functions. You'll need combinators for `true`, `false`, `neg`, `and`, `or`, and `xor`.

 
 Using the mapping specified in this week's notes, translate the following lambda terms into combinatory logic:
 
 
 Using the mapping specified in this week's notes, translate the following lambda terms into combinatory logic: