From: Jim Pryor Date: Tue, 26 Oct 2010 14:19:20 +0000 (-0400) Subject: week6: formatting, add primes after monad ops X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=1228661abce27f550f65903fb49c36634e5726b6;hp=0d85c76d0d37b32bf99483b86828a7d2829db44e week6: formatting, add primes after monad ops Signed-off-by: Jim Pryor --- diff --git a/week6.mdwn b/week6.mdwn index 25e52557..7a5ae2c2 100644 --- a/week6.mdwn +++ b/week6.mdwn @@ -6,11 +6,11 @@ Types, OCaml OCaml has type inference: the system can often infer what the type of an expression must be, based on the type of other known expressions. -For instance, if we type +For instance, if we type # let f x = x + 3;; -The system replies with +The system replies with val f : int -> int = @@ -65,7 +65,7 @@ That is, # match true with true -> 1 | false -> 2;; - : int = 1 -Compare with +Compare with # match 3 with 1 -> 1 | 2 -> 4 | 3 -> 9;; - : int = 9 @@ -112,7 +112,7 @@ correct type is the unit: Let's have some fn: think of `rec` as our `Y` combinator. Then - # let rec f n = if (0 = n) then 1 else (n * (f (n - 1)));; + # let rec f n = if (0 = n) then 1 else (n * (f (n - 1)));; val f : int -> int = # f 5;; - : int = 120 @@ -181,7 +181,7 @@ Here's what my OCaml interpreter says: # 12/0;; Exception: Division_by_zero. -So we want to explicitly allow for the possibility that +So we want to explicitly allow for the possibility that division will return something other than a number. We'll use OCaml's option type, which works like this: @@ -192,22 +192,22 @@ We'll use OCaml's option type, which works like this: - : int option = Some 3 So if a division is normal, we return some number, but if the divisor is -zero, we return None: +zero, we return None. As a mnemonic aid, we'll append a `'` to the end of our new divide function. 
-let div (x:int) (y:int) = 
+let div' (x:int) (y:int) =
   match y with 0 -> None |
                _ -> Some (x / y);;
 
 (*
-val div : int -> int -> int option = fun
-# div 12 3;;
+val div' : int -> int -> int option = fun
+# div' 12 3;;
 - : int option = Some 4
-# div 12 0;;
+# div' 12 0;;
 - : int option = None
-# div (div 12 3) 2;;
+# div' (div' 12 3) 2;;
 Characters 4-14:
-  div (div 12 3) 2;;
+  div' (div' 12 3) 2;;
       ^^^^^^^^^^
 Error: This expression has type int option
        but an expression was expected of type int
@@ -220,19 +220,19 @@ the output of the safe-division function as input for further division
 operations.  So we have to jack up the types of the inputs:
 
 
-let div (x:int option) (y:int option) = 
+let div' (x:int option) (y:int option) =
   match y with None -> None |
                Some 0 -> None |
                Some n -> (match x with None -> None |
                                        Some m -> Some (m / n));;
 
 (*
-val div : int option -> int option -> int option = 
-# div (Some 12) (Some 4);;
+val div' : int option -> int option -> int option = 
+# div' (Some 12) (Some 4);;
 - : int option = Some 3
-# div (Some 12) (Some 0);;
+# div' (Some 12) (Some 0);;
 - : int option = None
-# div (div (Some 12) (Some 0)) (Some 4);;
+# div' (div' (Some 12) (Some 0)) (Some 4);;
 - : int option = None
 *)
 

@@ -240,74 +240,74 @@ val div : int option -> int option -> int option = 
 Beautiful, just what we need: now we can try to divide by anything we
 want, without fear that we're going to trigger any system errors.
 
-I prefer to line up the `match` alternatives by using OCaml's 
+I prefer to line up the `match` alternatives by using OCaml's
 built-in tuple type:
 
 
-let div (x:int option) (y:int option) = 
+let div' (x:int option) (y:int option) =
   match (x, y) with (None, _) -> None |
                     (_, None) -> None |
                     (_, Some 0) -> None |
                     (Some m, Some n) -> Some (m / n);;
 

 
-So far so good.  But what if we want to combine division with 
-other arithmetic operations?  We need to make those other operations 
+So far so good.  But what if we want to combine division with
+other arithmetic operations?  We need to make those other operations
 aware of the possibility that one of their arguments will trigger a
 presupposition failure:
 
 
-let add (x:int option) (y:int option) = 
+let add' (x:int option) (y:int option) =
   match (x, y) with (None, _) -> None |
                     (_, None) -> None |
                     (Some m, Some n) -> Some (m + n);;
 
 (*
-val add : int option -> int option -> int option = 
-# add (Some 12) (Some 4);;
+val add' : int option -> int option -> int option = 
+# add' (Some 12) (Some 4);;
 - : int option = Some 16
-# add (div (Some 12) (Some 0)) (Some 4);;
+# add' (div' (Some 12) (Some 0)) (Some 4);;
 - : int option = None
 *)
 

 
-This works, but is somewhat disappointing: the `add` operation
+This works, but is somewhat disappointing: the `add'` operation
 doesn't trigger any presupposition of its own, so it is a shame that
 it needs to be adjusted because someone else might make trouble.
 
 But we can automate the adjustment.  The standard way in OCaml,
 Haskell, etc., is to define a `bind` operator (the name `bind` is not
-well chosen to resonate with linguists, but what can you do):
+well chosen to resonate with linguists, but what can you do). To continue our mnemonic association, we'll put a `'` after the name "bind" as well.
 
 
-let bind (x: int option) (f: int -> (int option)) = 
-  match x with None -> None | 
+let bind' (x: int option) (f: int -> (int option)) =
+  match x with None -> None |
                Some n -> f n;;
 
-let add (x: int option) (y: int option)  =
-  bind x (fun x -> bind y (fun y -> Some (x + y)));;
+let add' (x: int option) (y: int option)  =
+  bind' x (fun x -> bind' y (fun y -> Some (x + y)));;
 
-let div (x: int option) (y: int option) =
-  bind x (fun x -> bind y (fun y -> if (0 = y) then None else Some (x / y)));;
+let div' (x: int option) (y: int option) =
+  bind' x (fun x -> bind' y (fun y -> if (0 = y) then None else Some (x / y)));;
 
 (*
-#  div (div (Some 12) (Some 2)) (Some 4);;
+#  div' (div' (Some 12) (Some 2)) (Some 4);;
 - : int option = Some 1
-#  div (div (Some 12) (Some 0)) (Some 4);;
+#  div' (div' (Some 12) (Some 0)) (Some 4);;
 - : int option = None
-# add (div (Some 12) (Some 0)) (Some 4);;
+# add' (div' (Some 12) (Some 0)) (Some 4);;
 - : int option = None
 *)
 

 
-Compare the new definitions of `add` and `div` closely: the definition
-for `add` shows what it looks like to equip an ordinary operation to
+Compare the new definitions of `add'` and `div'` closely: the definition
+for `add'` shows what it looks like to equip an ordinary operation to
 survive in dangerous presupposition-filled world.  Note that the new
-definition of `add` does not need to test whether its arguments are
+definition of `add'` does not need to test whether its arguments are
 None objects or real numbers---those details are hidden inside of the
-`bind` function.
+`bind'` function.
 
-The definition of `div` shows exactly what extra needs to be said in
+The definition of `div'` shows exactly what extra needs to be said in
 order to trigger the no-division-by-zero presupposition.
 
 For linguists: this is a complete theory of a particularly simply form