tweak lambda evaluator

[lambda.git] / using_the_programming_languages.mdwn

diff --git a/using_the_programming_languages.mdwn b/using_the_programming_languages.mdwn
index dabcf14..6952e49 100644 (file)
--- 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