koengit / intuitLinks
An automated theorem prover for intuitionistic propostional logic
☆14Updated 5 years ago
Alternatives and similar repositories for intuit
Users that are interested in intuit are comparing it to the libraries listed below
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- PL syntax macros.☆21Updated last month
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆13Updated 6 years ago
- ☆21Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 9 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Relation algebra library for Coq☆50Updated last month
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Quasi-quoting library for agda☆18Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Finite sets and maps for Coq with extensional equality☆30Updated 2 months ago
- Partition refinement☆16Updated 2 years ago
- ☆56Updated last week
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last week
- Logical Relation for MLTT in Coq☆28Updated this week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Congruence Closure Procedure in Cubical Agda☆18Updated 5 years ago
- Constructive Galois connections☆36Updated 7 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆40Updated last month