julesjacobs / boaLinks
Partition refinement
☆16Updated 2 years ago
Alternatives and similar repositories for boa
Users that are interested in boa are comparing it to the libraries listed below
Sorting:
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- Deadlock freedom by type checking☆20Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 3 weeks ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆39Updated 2 weeks ago
- A OCaml generator for well-typed terms (that use their arguments).☆11Updated 9 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- Constructive Galois connections☆36Updated 7 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated 2 weeks ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Lenses in Coq☆17Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Coq library on rewriting theory and termination☆37Updated 2 weeks ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Relation algebra library for Coq☆49Updated 2 weeks ago