A non-interactive proof assistant using the Haskell type system
☆38Apr 11, 2020Updated 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:
- A GHC source plugin which detects opportunities to use coerce☆17Aug 8, 2018Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Feb 19, 2026Updated 2 weeks ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Modular arithmetic, promoting moduli to the type level☆24Sep 13, 2025Updated 5 months ago
- Design, play with, and analyze sequent calculus proof systems.☆14Sep 5, 2024Updated last year
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Sep 1, 2025Updated 6 months ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Shamir Secret Sharing☆21Nov 27, 2019Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 3 years ago
- typesafe implementation of tensor algebra in Haskell☆13Feb 27, 2021Updated 5 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- Stack-based esoteric programming language☆18Jan 31, 2025Updated last year
- Austin's supercompiler work☆21Nov 17, 2019Updated 6 years ago
- Omit fields for instance deriving☆37Jun 5, 2020Updated 5 years ago
- An esoteric language based on overlapping tree-like structures☆10Oct 16, 2021Updated 4 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Oct 28, 2019Updated 6 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Combine and enhance Functors☆39Aug 12, 2025Updated 6 months ago
- Refined types☆57Sep 25, 2018Updated 7 years ago
- Transform a Folder into a Stack Template☆14May 8, 2023Updated 2 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- Ties the knot on data structures that reference each other by unique keys☆48Aug 2, 2024Updated last year
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Jan 11, 2018Updated 8 years ago
- A Zoo of Haskell Newtype Wrappers☆15Nov 30, 2020Updated 5 years ago
- machine fusion☆16Oct 13, 2018Updated 7 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- Horn Clause Constraint Solving for Liquid Types☆159Feb 25, 2026Updated last week
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago