From bdb2d785e628954f3237010069716818db51a2b3 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sat, 18 Sep 2010 17:40:39 -0400 Subject: [PATCH] tweaked week3 Signed-off-by: Jim Pryor --- week3.mdwn | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/week3.mdwn b/week3.mdwn index 1f1b6325..f5f075a1 100644 --- a/week3.mdwn +++ b/week3.mdwn @@ -2,8 +2,9 @@ How could we compute the length of a list? Without worrying yet about what lambda-calculus implementation we're using for the list, the basic idea would be to define this recursively: - the empty list has length 0 - any non-empty list has length 1 + (the length of its tail) +> the empty list has length 0 + +> any non-empty list has length 1 + (the length of its tail) In OCaml, you'd define that like this: -- 2.11.0