Exercise 1
Exercise 2
until :: (a -> a) -> (a -> Bool) -> a -> a
until f p x =
if (p x)
then x
else until f p (f x)Exercise 3
Prove that : Base Case: Inductive Case: Suppose . We want to show .
[2, 3]
until :: (a -> a) -> (a -> Bool) -> a -> a
until f p x =
if (p x)
then x
else until f p (f x)Prove that : Base Case: Inductive Case: Suppose . We want to show .
[2, 3]