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
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 5 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated this week
- ☆55Updated 5 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Bedrock Bit Vector Library☆28Updated 2 months ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- ☆22Updated 9 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 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
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆72Updated 3 weeks ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated last week
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- Finite sets, finite maps, multisets and generic sets☆50Updated 2 months ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- ☆21Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Denotational semantics based on graph and filter models☆23Updated 8 months ago
- ☆17Updated 6 years ago
- Relation algebra library for Coq☆49Updated 5 months ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated 2 weeks ago
- Graded Dependent Type systems☆25Updated 2 years ago