X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2Fassignment3.mdwn;h=95450217af616d66cbef151d142bae4efef359fb;hp=674cf40e3087dab73ed20099411a1280b1745a2a;hb=ee79965dbd07b39cd3ab7d489ba87b8cc5e2b68b;hpb=8d11f56b4dd370271a919f2cc037c399851d4bc8

diff --git a/exercises/assignment3.mdwn b/exercises/assignment3.mdwn
index 674cf40e..95450217 100644
--- 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.
 
-## Combinatorial Logic
+## Combinatory Logic
 
 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: