mit-plv / rewriterLinks
Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
☆26Updated this week
Alternatives and similar repositories for rewriter
Users that are interested in rewriter are comparing it to the libraries listed below
Sorting:
- Relation algebra library for Coq☆49Updated 3 weeks ago
- Lenses in Coq☆17Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Updated last month
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Bedrock Bit Vector Library☆28Updated last month
- Coq library for tactics, basic definitions, sets, maps☆51Updated last week
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆11Updated 2 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- A Coq library providing tactics to deal with hypothesis☆21Updated 2 weeks ago
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- ☆38Updated 8 months ago
- A Coq library for abstract syntactical reasoning☆24Updated 7 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆18Updated 3 weeks ago
- Coq library on rewriting theory and termination☆37Updated 3 weeks ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- a version of the 2048 game for Coq☆22Updated 2 years ago
- ☆18Updated 3 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated last month
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last week