ivanbakel / hout-proverLinks
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
Sorting:
- A tutorial on how Agda infers things☆42Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆47Updated 3 weeks ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Paper and talk☆54Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- A work-in-progress core language for Agda, in Agda☆52Updated last week
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Fast equality saturation in Haskell☆84Updated 4 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- NbE course @ Chalmers☆28Updated 9 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- ☆30Updated 7 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Where my everyday research happens☆53Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Type Your Matrices For Great Good☆29Updated 4 years ago
- ☆29Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago