A repository containing my solutions to the Imperial College January Haskell Test.
- Binary Decision Diagrams (2009)
- Suffix Trees (2010)
- Polymorphic Type Inference (2011) [Difficulty: ***] ✅
- Labelled Transition Systems (2012) [Difficulty: ***] ✅
- Binomial Heaps (2013)
- Regular Expressions and Finite Automata (2014) [Difficulty: ***] ✅
- Functions, Procedures and Memoisation (2015) [Difficulty: ***] ✅
- XML and XSL Transformations (2016) [Difficulty: ***] ✅
- Decision Trees (2017) [Difficulty: **] ✅
- Constant Propagation (2018) [Difficulty: **] ✅
- SAT Solving (2019) [Difficulty: *] ✅
- Hash Array Mapped Tries (2020) [Difficulty: *] ✅
- Graph Colouring and Register Allocation (2021) [Difficulty: **] ✅
- Supercombinators (2022) [Difficulty: ***] ✅
- Cryptic Clue Solving (2023) [Difficulty: *] ✅