-
Notifications
You must be signed in to change notification settings - Fork 5
Notes for Week 6 Higher Order Functions
learnhaskell-brisbane edited this page Jan 6, 2012
·
5 revisions
-
Tests for exercises:
testProb1Curry = (curry' fst) 11 22 == 11 testProb1Uncurry = (uncurry' (+)) (12,23) == 35 testProb2 = prob2 (+11) odd [1..10] == [13,15,17,19,21] testProb3Length = length' [1..10] == 10 testProb3Append = append' "has" "kell" == "haskell" testProb3Flatten = flatten' ["abc","def","ghi"] == "abcdefghi" testProb3Flatmap = flatmap' (replicate 3) [1..4] == [1,1,1,2,2,2,3,3,3,4,4,4] testProb4 = dec2nat [2, 3, 4, 5] == 2345 testProb5 = fib' 10 == [0,1,1,2,3,5,8,13,21,34,55] testProb6 = prob6 2 == 9 testProb7Fst = fst' (1,2) == 1 testProb7Snd = snd' (1,2) == 2
//TODO
Will be checked in after the meetup!