From: Jim Pryor <profjim@jimpryor.net>
Date: Mon, 20 Sep 2010 16:19:12 +0000 (-0400)
Subject: tweak ml code/instructions
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=26f6bb00d57f1cbfb02f8d774ca2affe292c8597

tweak ml code/instructions

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---

diff --git a/using_the_programming_languages.mdwn b/using_the_programming_languages.mdwn
index ae404997..d5eb31bd 100644
--- a/using_the_programming_languages.mdwn
+++ b/using_the_programming_languages.mdwn
@@ -43,16 +43,16 @@ know much OCaml yet to use it. Using it looks like this:
 		let add = << fun m n -> n $succ$ m >>;;
 		(* or *)
 		let add = << fun m n -> fun s z -> m s (n s z) >>;;
-		
+		 
 		(* now use:
 			pp FORMULA				to print a formula, unreduced
 			pn FORMULA				to print the normal form of a formula (when possible)
 			pi FORMULA				to print the integer which FORMULA is a Church numeral for (when possible)
-		
+		 
 			alpha_eq FORM1 FORM2	are FORM1 and FORM2 syntactically equivalent (up to alpha-conversion)?
 									this does not do reductions on the formulae
 		*)
-		
+		 
 		pi << $add$ $one$ $two$ >>;;
 		- : int = 3