benjaminselfridge / propcheckLinks
Proof checker for propositional logic
☆16Updated 8 years ago
Alternatives and similar repositories for propcheck
Users that are interested in propcheck are comparing it to the libraries listed below
Sorting:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 weeks ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Category theory and algebra☆27Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- classical sequent calculus, embedded in Haskell☆21Updated last month
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 4 months ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago