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
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- ☆56Updated last week
- ☆17Updated 7 years ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆73Updated 2 months ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Updated last week
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated 3 months ago
- Denotational semantics based on graph and filter models☆23Updated last year
- ☆21Updated 9 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated last month
- Relation algebra library for Coq☆49Updated 3 weeks ago
- Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@…☆25Updated 2 months ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated last week
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Constructive Galois connections☆36Updated 7 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 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
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018☆23Updated 7 years ago