mit-plv / reification-by-parametricityLinks
Fast Setup for Proof by Reflection, in Two Lines of Ltac.
☆14Updated 4 years ago
Alternatives and similar repositories for reification-by-parametricity
Users that are interested in reification-by-parametricity are comparing it to the libraries listed below
Sorting:
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- ☆56Updated this week
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- Denotational semantics based on graph and filter models☆23Updated 10 months ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated 3 weeks ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 2 years ago
- Relation algebra library for Coq☆49Updated last month
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆72Updated 2 weeks ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Lenses in Coq☆17Updated 3 years 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
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆45Updated 6 months ago
- Bedrock Bit Vector Library☆28Updated 3 weeks ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Robots powered by Constructive Reals☆34Updated 7 years ago
- Gallina to Bedrock2 compilation toolkit☆61Updated 2 weeks ago
- Finite sets, finite maps, multisets and generic sets☆50Updated this week
- ☆17Updated 7 years ago
- ☆21Updated 7 years ago
- A proof of Abel-Ruffini theorem.☆30Updated last week
- Library of Coq proof automation☆16Updated 3 years ago
- ☆22Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago