All homework and programming exercises must be prepared in accordance with the instructions given in the Syllabus. Each assignment must be submitted to your instructor by its stated deadline.
In accordance with expected scholarly and academic standards, if you reference outside textbooks, reference books, articles, websites, etc., or discuss this assignment with individuals inside or outside the class, you must document these by including appropriate citations or comments in the header of the primary source file or in another prominent place in the program documentation.
This is an individual assignment. When complete, submit your Haskell source and testing modules to the course Blackboard site.
CSci 450 students do all parts of exercise 3 and five of the six problems 4-9 from Chapter 5 of Introduction to Functional Programming Using Haskell (shown below).
Put your functions in a module named HW03 (in file HW03.hs).
Test your functions thoroughly. Put your testing code in a module HW03_Test (in file HW03_Test.hs).
CSci 503 students do all ten of the exercises listed above.
I encourage all students to work on all exercises.
Suppose you need a Haskell function sumSqNeg that takes a list of integers (type Integer) and returns the sum of the squares of the negative values in the list.
Define the following Haskell functions. Use the higher order library functions (from this chapter) such as map, filter, foldr, and foldl as appropriate.
Function sumSqNeg1 that is backward recursive. (Use recursion directly. Do not use the list-folding Prelude functions such as foldr or sum.)
Function sumSqNeg2 that is tail recursive. (Use recursion directly. Do not use the list-folding Prelude functions such as foldr or sum.)
Function sumSqNeg3 that uses standard prelude functions such as map, filter, foldr, and foldl.
Function sumSqNeg4 that uses list comprehensions (Chapter 7).
Define a Haskell function
total :: (Integer -> Integer) -> Integer -> Integerso that total f n gives f 0 + f 1 + f 2 + ... + f n.
Define a Haskell function
removeFirst :: (a -> Bool) -> [a] -> [a} so that removeFirst p xs removes the first element of xs that does has the property p.
Define a Haskell function
removeLast :: (a -> Bool) -> [a] -> [a]so that removeLast p xs removes the last occurrence of element of xs that has the property p.
How could you define it using removeFirst?
Define a Haskell function map2 that takes a list of functions and a list of values and returns the list of results of applying each function in the first list to the corresponding value in the second list.
Define a Haskell function fmap that takes a value and a list of functions and returns the list of results from applying each function to the argument value. (For example, fmap 3 [((*) 2), ((+) 2)] yields [6,5].)
Define a Haskell function composeList that takes a list of functions and composes them into a single function. (Be sure to give the type signature.)