Source paper: released examination archive, member 2015/T/a10097w1.pdf; original cover dated 2016-06-14. The archive directory is not the examination year.

Source paper: released examination archive, member a10100w1-2.pdf; original cover dated 2016-09-14.

Source paper: released examination archive, member a10100w1-3.pdf; original cover dated 2016-06-23.

Source paper: released examination archive, member a10101w1-2.pdf; original cover dated 2016-09-15.

Source paper: released examination archive, member 2015/T/a10101w1.pdf; original cover dated 2016-06-16. The cover establishes the examination year despite the archive directory name.

Source paper: released examination archive, member 2015-fpdaa.pdf. The printed cover dates this examination to 16 June 2015.

The original cover identifies the examination as 9 September 2015.^[ref]

The original cover establishes the date as 19 June 2015. The solutions use the printed question numbering and the natural deduction rules supplied with this paper.^[ref]

Solutions to all eight questions of the 18 June 2014 paper. The Scala fragments use the paper's Scala 2 style. Unless stated otherwise, array dimensions and array indices meet the supplied preconditions, and size calculations fit Int.^[ref]

The solutions use the original 17 June 2014 preliminary examination, code 4208.^[ref] Haskell definitions use separate question namespaces; names suffixed F or U distinguish alternative implementations. For Question 4, use import Prelude hiding (foldr, (++), concat, flip) when compiling the definitions together. Unless an infinite input is discussed explicitly, inputs are finite and total. Arithmetic operation counts do not include the growing bit costs of exact integers.^[ref]

Solutions to all nine questions of the examination dated 26 June 2014.^[ref]

The original cover dates this paper to 20 June 2014. The solutions follow the printed numbering and use the supplied natural deduction rules, including double-negation elimination. In the proof tables, the context column lists the numbered assumptions still in force; temporary assumptions are explicitly discharged by the indicated rule.^[ref]

Solutions to all eight questions of the 12 June 2013 paper. The Scala code uses the paper's Scala 2 conventions. Arithmetic is exact unless a machine type is explicitly discussed; in particular, Question 1 permits ignoring integer overflow. Each code block extends the implementation introduced in its question, unless it supplies a complete replacement.^[ref]

These solutions follow the original examination of 11 June 2013, code 4208.^[ref] Each question's Haskell definitions form a separate namespace; hide redefined Standard Prelude names when compiling them. Unless stated otherwise, arguments are finite and total. Time complexity counts primitive operations; the cost of comparing variable-length words and the growing bit cost of exact integer arithmetic are stated separately where relevant.^[ref]

Solutions to the nine questions in the original paper.^[ref]

These solutions follow the original numbering and the supplied natural deduction rules. The datapath conventions are specified where the diagram leaves control polarity open; the repeated part 8(a)(iii) is treated exactly as printed.^[ref]