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
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- ☆56Updated 3 weeks ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- ☆21Updated 9 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Denotational semantics based on graph and filter models☆23Updated 10 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated 7 months 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
- Lenses in Coq☆17Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated last week
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Bedrock Bit Vector Library☆28Updated 2 weeks ago
- Formal topology (and some probability) in Coq☆31Updated 6 years ago
- ☆21Updated 7 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Gallina to Bedrock2 compilation toolkit☆64Updated this week
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- ☆17Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆46Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@…☆25Updated 3 weeks ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last week
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago