# CS代考计算机代写 Haskell module TypesPractice where

module TypesPractice where

import Prelude hiding ((.),Maybe(..),even,flip,map)

— * Notes

— 1. On the quiz, I’ll only give you the types of relevant functions, not
— their implementations. I assume that you know Haskell’s Bool and list
— data types, and so won’t repeat their definitions here or on the quiz.
— All other data types and relevant function types will be provided.

— 2. There are three kinds of problems, broken into three sets.

— 3. All problems are commented out since some are not type correct. You can
— check your answers using the instructions at the beginning of each set.

— 4. Many of these problems (especially near the end of the first set) are
— more difficult than the problems you’ll see on the quiz. So if you feel
— comfortable with all of the problems in this practice, you’re in good shape.

— 5. You can pretty easily generate your own typing problems by just combining
— these functions and data constructors in various ways.

— * Definitions

data Maybe a
= Nothing
| Just a
deriving (Eq,Show)

data Tree a b
= Leaf a
| Node b (Tree a b) (Tree a b)
deriving (Eq,Show)

one :: Int
one = 1

two :: Int
two = 2

even :: Int -> Bool
even i = mod i 2 == 0

bit :: Bool -> Int
bit b = if b then 1 else 0

gt :: Int -> Int -> Bool
gt x y = x > y

flip :: (a -> b -> c) -> b -> a -> c
flip f b a = f a b

(.) :: (b -> c) -> (a -> b) -> a -> c
f . g = x -> f (g x)
infixr 9 . — this says . is right-associative

map :: (a -> b) -> [a] -> [b]
map _ [] = []
map f (x:xs) = f x : map f xs

treeMap :: (a -> c) -> (b -> d) -> Tree a b -> Tree c d
treeMap f _ (Leaf b) = Leaf (f b)
treeMap f g (Node a l r) = Node (g a) (treeMap f g l) (treeMap f g r)

— * Problems

— ** Determine the type

— In this problem set, you’re given an expression and have to determine its
— type. If the expression is type correct, write down its type. If not,
— write “type error”.

— You can check your answer for a problem by uncommenting the expression and
— reloading the file in GHCi. If you do not get a type error, you can check
— the type of the expression with the :type command.

— ex1 = Leaf one

— ex2 = [Just True, Nothing]

— ex3 = [Leaf one, Leaf True]

— ex4 = [Leaf one, Node Nothing (Leaf one) (Leaf two)]

— ex5 = Just bit True

— ex6 = Just . bit

— ex7 = Leaf (Leaf one)

— ex8 = bit . even

— ex9 = even . gt one

— ex10 = gt one . bit

— ex11 = Node True (Leaf one) . Leaf

— ex12 = flip Just

— ex13 = flip map [one,two]

— ex14 = treeMap bit even

— ex15 = flip treeMap bit even

— ex16 = flip (treeMap bit) (Leaf one)

— ex17 = flip (treeMap even) (Leaf one)

— ex18 = flip (.) even bit

— ** Create an expression

— In this problem set, you’re given a type. Your goal is to construct an
— expression of the given type using *only* the definitions in this file.
— If this is possible, write the expression. If it’s not, write “impossible”.

— the definitions to the file without changing the type. If the file

— ex19 :: Maybe (Bool -> Int)
— ex19 = undefined

— ex20 :: Maybe (Maybe a)
— ex20 = undefined

— ex21 :: Maybe (Maybe Int)
— ex21 = undefined

— ex22 :: Tree Int
— ex22 = undefined

— ex23 :: Tree (Maybe a) b
— ex23 = undefined

— ex24 :: [Int] -> [Bool]
— ex24 = undefined

— ex25 :: Tree a Bool -> Tree (Maybe a) Int
— ex25 = undefined

— ex26 :: Tree Int b -> (b -> d) -> Tree Bool d
— ex26 = undefined

— ex27 :: (a -> c) -> Tree a Int -> Tree c Bool
— ex27 = undefined

— ** Figure out the type of “secret”

— In this problem set, you’re given a type and an expression with an
— undefined ‘secret’ value. Determine whether the expression can possibly
— have the indicated type. If so, write the type of ‘secret’ that makes the
— expression type correct. Note that you do *not* need to define the value
— of ‘secret’, only its type. If the expression cannot possibly be type
— correct, write “impossible”.

— For expressions that are not impossible, you can check your answers by
— adding an expicit type annotation to the undefined secret value as
— correct.

— | I’ve given you the answer for this one already so you can see how to check
— your own solutions in GHCi.
ex28 :: Maybe Int
ex28 = Just secret
where secret = undefined :: Int

— ex29 :: Tree Char Bool
— ex29 = Leaf secret
— where secret = undefined

— ex30 :: Bool
— ex30 = even secret
— where secret = undefined

— ex31 :: Bool -> Int
— ex31 = bit secret
— where secret = undefined

— ex32 :: Char -> Bool -> Int
— ex32 = flip secret
— where secret = undefined

— ex33 :: [Char]
— ex33 = map secret [one,two]
— where secret = undefined

— ex34 :: Tree Bool Bool -> Tree Int Char
— ex34 = treeMap bit secret
— where secret = undefined

— ex35 :: [Char]
— ex35 = map secret (map even [one,two])
— where secret = undefined

— ex36 :: [Bool]
— ex36 = map even (map secret [one,two])
— where secret = undefined