ivanbakel / hout-prover
A non-interactive proof assistant using the Haskell type system
☆37Updated 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
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Paper and talk☆53Updated last year
- Distributors - Unifying Parsers, Printers & Grammars☆24Updated last week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated 3 weeks ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆47Updated 4 months ago
- ☆29Updated 2 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- A work-in-progress core language for Agda, in Agda☆51Updated last week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Fast equality saturation in Haskell☆84Updated 2 months ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 2 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- WIP: A modern step-through debugger for GHC Haskell☆11Updated this week
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆68Updated 2 weeks ago
- Eventually a practical 2-level TT-based compiler☆27Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- NbE course @ Chalmers☆28Updated 6 months ago
- Ground Zero: Lean 4 HoTT Library☆57Updated last week
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 8 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- ☆23Updated 9 months ago