ivanbakel / hout-proverLinks
A non-interactive proof assistant using the Haskell type system
☆38Updated 5 years ago
Alternatives and similar repositories for hout-prover
Users that are interested in hout-prover are comparing it to the libraries listed below
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fast equality saturation in Haskell☆88Updated 2 months ago
- ☆48Updated last month
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- Where my everyday research happens☆55Updated 3 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆55Updated last week
- Quantitative Type Theory implementation☆54Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Staged push/pull fusion with typed Template Haskell☆62Updated last year
- Haskell library for doing category theory with a central role for profunctors☆23Updated last week
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A TACtic library for Agda☆49Updated last year
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- A Really Cool Calculator written in Haskell... or is it?☆43Updated 4 years ago