koengit / intuit
An automated theorem prover for intuitionistic propostional logic
☆12Updated 4 years ago
Alternatives and similar repositories for intuit:
Users that are interested in intuit are comparing it to the libraries listed below
- Notes (and implementation) of unification with binders☆14Updated this week
- ☆21Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 7 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- my phd thesis☆26Updated 7 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- ☆18Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 months ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- PL syntax macros.☆19Updated 3 weeks ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- A formalization of System Fω in Agda☆16Updated last month
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- miniKanren with a first-order representation of the search space☆16Updated 8 months ago
- Experiments with Realizability in Univalent Type Theory☆17Updated 5 months ago