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:
- ☆51Updated 3 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Haskell library for doing category theory with a central role for profunctors☆24Updated last week
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A TACtic library for Agda☆50Updated last year
- Fast equality saturation in Haskell☆88Updated 2 weeks ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- ICFP tutorial☆39Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Where my everyday research happens☆55Updated last month
- Paper and talk☆55Updated 2 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆57Updated last week
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year
- NbE course @ Chalmers☆28Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 4 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago