benjaminselfridge / propcheck
Proof checker for propositional logic
☆16Updated 7 years ago
Alternatives and similar repositories for propcheck:
Users that are interested in propcheck are comparing it to the libraries listed below
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Typed DSLs for sorting☆19Updated 6 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Haskell library of algebraic topology☆23Updated 13 years ago
- Type-level assertion operators☆16Updated 6 years ago
- An experimental build system based on the Haxl library☆8Updated 5 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆19Updated last week
- System F implemented in Haskell☆24Updated 12 years ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 5 years ago
- Modular Reifiable Matching, A List-of-Functors Approach to Two-Level Types☆9Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated 3 months ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago