Assignment 1

Mon, 01 Jan 0001 00:00:00 +0000

Assignment 1: higher-order functions and linear recursion #

Hint. In this assignment, you can often take advantage of the native higher-order functions that we have encountered: filter, map, all, any, etc.

Exercise 1: utility functions #

Implement the functions below by completing the function stubs in the file Src/Utility.hs.

Hint. Some of these functions can be used to implement others.

Hint. Feel free to create additional (auxiliary) functions to simplify your implementation.

Assignment 2

Mon, 01 Jan 0001 00:00:00 +0000

Assignment 2: functional patterns #

Exercise 1: utility functions #

Implement the functions below by completing the function stubs in the file Src/Utility.hs.

Hint. Some of these functions can be used to implement others.

Hint. Feel free to create additional (auxiliary) functions to simplify your implementation.

`lastMatch` #

Implement the function

lastMatch :: (a -> Bool) -> [a] -> Maybe a

such that lastMatch f xs is:

Just x if x is the last element of the list xs for which f x is True, or
Nothing if there is no such x.

For instance,

Assignments on OOFP 2025-26

Assignment 1

Assignment 1: higher-order functions and linear recursion #

Exercise 1: utility functions #

Assignment 2

Assignment 2: functional patterns #

Exercise 1: utility functions #

lastMatch #

`lastMatch` #