From af16a855a4b8fd730bbd58a2a546e2bd8affbc21 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Mon, 20 Sep 2010 12:19:36 -0400 Subject: [PATCH] tweak ml code/instructions Signed-off-by: Jim Pryor --- using_the_programming_languages.mdwn | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/using_the_programming_languages.mdwn b/using_the_programming_languages.mdwn index d5eb31bd..6952e499 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 -- 2.11.0