substitutionModel

substitutionModel - Part 1 Solution let initial x = 0 in...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 Part 1 Solution ------------------------------------------------- let initial x = 0 in let rec zardoz (f1, lst) = match lst with [] -> 3110 | h :: t -> let f x = h * List.length lst in if List.length t = 0 then f1 0 else zardoz (f, t) + f 0 in zardoz (initial, [14 ------------------------------------------------- let rec zardoz (f1, lst) = match lst with [] -> 3110 | h :: t -> let f x = h * List.length lst in if List.length t = 0 then f1 0 else zardoz (f, t) + f 0 in zardoz (fun x -> 0, [14 ------------------------------------------------- match [14 [] -> 3110 | h :: t -> let f x = h * List.length [14 if List.length t = 0 then (fun x -> 0) 0 else zardoz (f, t) + f 0 ------------------------------------------------- let f x = 14 * List.length [14 if List.length [0 else zardoz (f, [0 ------------------------------------------------- if List.length [0 else zardoz (fun x -> 14 * List.length [14 + (fun x -> 14 * List.length [14 ------------------------------------------------- zardoz (fun x -> 14 * List.length [14
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/25/2009 for the course CS 3110 at Cornell.

Page1 / 4

substitutionModel - Part 1 Solution let initial x = 0 in...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online