mit-plv / reification-by-parametricity
Fast Setup for Proof by Reflection, in Two Lines of Ltac.
☆12Updated 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
- Formalization of termination of Gödel's System T☆9Updated 3 years ago
- ☆17Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 2 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 4 years ago
- ☆18Updated 2 years ago
- Lenses in Coq☆16Updated 2 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A tool for translating imperative programs to CSP.☆10Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- ☆51Updated 3 weeks ago
- Library of Coq proof automation☆16Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 7 months ago
- Dafny for Metatheory of Programming Languages☆22Updated 2 weeks ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆15Updated 4 months ago
- Denotational semantics based on graph and filter models☆17Updated last month
- Unofficial repository for the experimental porting of mathlib into lean4☆10Updated 4 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆22Updated 5 months ago
- Experimentation project☆16Updated 10 years ago
- ☆22Updated 8 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 9 months ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 4 months ago
- Linear map categories in Agda☆5Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago