From: Chris Barker <barker@kappa.linguistics.fas.nyu.edu>
Date: Mon, 25 Oct 2010 19:10:17 +0000 (-0400)
Subject: added proto-monad
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=ac9dca9445dd794a3cbda9cfa80d48cb521a96d7

added proto-monad
---

diff --git a/assignment5.mdwn b/assignment5.mdwn
index f6ae94b0..4a4e06d2 100644
--- a/assignment5.mdwn
+++ b/assignment5.mdwn
@@ -185,7 +185,7 @@ binary trees working in OCAML.
 
    Consider the following list type:
 
-    datatype ’a list = Nil | Cons of ’a * ’a list
+    type ’a list = Nil | Cons of ’a * ’a list
 
    We can encode τ lists, lists of elements of type τ as follows: