jordanspooner / haskell-tests
My past paper solutions for the Haskell final test at Imperial College London
☆8Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for haskell-tests
- Notes for the Lectures of Year 2 Computing 2021-22☆40Updated last year
- ☆10Updated 2 years ago
- Automated downloader for Imperial College London Department of Computing Materials platform☆8Updated 3 years ago
- ☆9Updated 4 years ago
- run and encode simple register machine programs☆14Updated 3 years ago
- Refreshed parsec-style library for compatibility with Scala parsley☆16Updated this week
- A selection of textbook-like course notes for the Imperial College Computing modules.☆61Updated 8 months ago
- Materials for the course "theorem prover lab: applications in programming languages" at KIT, SS2021 edition☆50Updated 3 years ago
- ☆16Updated 2 years ago
- Online platform to enable Logic students to write, verify, and store System L style Natural Deduction proofs with real-time proof-checkin…☆11Updated 6 years ago
- ☆24Updated last month
- A pure type system implemented in OCaml☆77Updated 3 years ago
- The Next Generation of Compositional Programming☆22Updated this week
- Staged compilation with dependent types☆162Updated this week
- Tutorial Questions for the Programming II course at Imperial College London☆50Updated last year
- A web-based graphical proof assistant for LK and Hoare logic.☆32Updated 2 years ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆14Updated 11 months ago
- A constructive proof assistant for second order logic.☆33Updated last month
- Functional Programming in Lean☆71Updated 6 months ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆19Updated last week
- bollu learns implementation of dependent typing☆25Updated last year
- Python bindings for the Coq interactive proof assistant☆50Updated 2 years ago
- Building group theory from scratch in Lean☆59Updated 3 years ago
- Notes for first year Computing at Imperial College London☆50Updated 2 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆43Updated 4 months ago
- Benchmarking algebraic effect handler implementations☆24Updated 3 years ago
- Formalization of the basic actuarial mathematics using Coq☆21Updated last year
- A monadic library for symbolic evaluation☆55Updated 2 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 7 months ago
- Type Checking in Lean 4☆25Updated 2 months ago