mit-plv / reification-by-parametricityLinks
Fast Setup for Proof by Reflection, in Two Lines of Ltac.
☆14Updated 5 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 7 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- ☆21Updated 9 years ago
- ☆17Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- ☆56Updated last week
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- Bedrock Bit Vector Library☆28Updated 2 months ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Updated last week
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 5 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 formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated 4 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A formalization of properties of a simple imperative, memory-safe language.☆20Updated 4 years ago
- Denotational semantics based on graph and filter models☆23Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Formal topology (and some probability) in Coq☆31Updated 7 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated 2 months ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- ☆21Updated 7 years ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- Lenses in Coq☆17Updated 3 years ago
- Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@…☆25Updated this week
- Library of Coq proof automation☆16Updated 3 years ago