Question

Haskell coding problem please do problem two

Here is problem one for the types

Problem Two (Polymorphic Type Inference): Give the type of the following functions in the space indicated. Assume that we have only the types given in Problem One, plus Haskell's built-in types Integer and Bool. Assume that all arithmetic operators take only Integer, e.g., () is Integer -> Integer -> Integer. test :: test x xs = (Cons x (Cons (x+1) xs)) second second xs = f (g xs) where f (Cons x _) - x pair pair xy=P(y x) y twice :: twice f x f (f x) apply: apply f g xf (g x) mixUp :: mixUp f g -> f ((g. ) x) peculiar :: peculiar x (P y z) = (P (x y) (x z)) Problem One (Non-Polymorphic Type Inference): Give the type of the following expressions. We assume that we can have Integer and Bools as defined in the Haskell Prelude. Assume that all arithmetic operators in these examples operate only on Integers, so the type of (+) is Integer->Integer -» Integer. data D a = A Integer | B Bool | C a data Pair a b = Pab data List aNil | Cons a (List a) al: al-(P (P 3 (True && (3 P x (P x y))) (C 4) (C True ) a5 = (\x-> (lx-> (P x (C x)))) 3 True (lx-> ('mod- ((lx-> (ly-> x y y)) a6 x)) (+) 4) =

Answer 1

a1: is true satisfying the condition

a2: is false div not satisfied

a3: is true it satisfying condition

a4:is true satisfies condition

a5:true satisfying condition

a6: satisfying + condition