Functional Programming & Imperative Design
Department of Computer Science, University of Oxford
Honour School of Computer Science · Prelims
Oxford First Public Examination curriculum covering functional computation in Haskell, inductive proof invariants, algorithmic complexity, and imperative data structures.
Preview Syllabus Topics (5)▼
Verified Institutional Syllabus:
- 1.Functional Computation & Recursive Data Types in Haskell
- 2.Inductive Correctness Proofs on Lists and Trees
- 3.Formal Algorithmic Complexity & Asymptotic Bounds
- 4.Imperative State, Dynamic Memory & Pointers
- 5.Abstract Data Types: Queues, Stacks & Search Trees