 Functional programming, design and analysis of algorithms (resit)

Source paper: released examination archive, member 2020/L/a10097w1.pdf.

The held cover identifies the Long Vacation sitting of 8 September 2021. All eight questions and all 37 printed letter leaves are answered here, including the unnumbered cases within 5(a) and 5(b). Code is written for Haskell 2010 unless marked as pseudocode. Sorting assumes a lawful terminating ordering on finite inputs; the partial-value qualifications in Question 1 are stated where they matter. No native Haskell compiler is installed in the checking environment, so executable checks use independent Python models and are not claimed as native compilation.