cole-k / cc-lemma
Refreshing automation for inductive equational proofs using e-graphs
☆20Updated 10 months ago
Alternatives and similar repositories for cc-lemma:
Users that are interested in cc-lemma are comparing it to the libraries listed below
- Canonical is a performant sound and complete type inhabitation solver for dependent type theory.☆21Updated this week
- Separation Logic Proofs in Lean☆36Updated last month
- Logical Relation for MLTT in Coq☆24Updated 2 weeks ago
- ☆16Updated last year
- ☆33Updated 7 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last week
- A monadic library for symbolic evaluation☆60Updated this week
- A (WIP) equality saturation tactic for Lean based on egg.☆60Updated this week
- ☆20Updated this week
- Benchmark repository of polyglot effect handler examples☆24Updated 3 weeks ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆35Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- Type Checking in Lean 4☆28Updated last month
- ☆47Updated 2 months ago
- sockets for Lean 4☆18Updated 9 months ago
- embedding MLIR in LEAN☆47Updated 10 months ago
- ☆20Updated 2 weeks ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆14Updated last year
- An extension of the NbE algorithm to produce computational traces☆21Updated 3 years ago
- Experiments with some ways of automating reasoning in lean 4☆16Updated last year
- Deadlock freedom by type checking☆20Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- 🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/☆27Updated last month
- Graph Theory [maintainers=@chdoc,@damien-pous]☆35Updated last week
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Intrinsic Verification of Formal Grammar Theory☆20Updated last week
- An itree-like data-structure to additionally support internal non-determinism☆17Updated last month
- A toy example of a verified compiler.☆28Updated 2 weeks ago
- Verifying encodings into propositional logic in Lean☆12Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 3 years ago