mit-plv / reification-by-parametricityView external linksLinks
Fast Setup for Proof by Reflection, in Two Lines of Ltac.
☆14Jan 12, 2021Updated 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:
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- Implementation of sprintf for Coq☆18Apr 6, 2020Updated 5 years ago
- A compiler for Coq☆26Feb 22, 2013Updated 12 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018☆23May 9, 2018Updated 7 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Dec 22, 2018Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Sep 20, 2021Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Simple FRP implementation for Haskell. See blog post at http://travis.athougies.net/☆14May 5, 2015Updated 10 years ago
- An implementation of a simple asynchronous message-passing lock server, verified in Coq using the Verdi framework☆14Oct 23, 2017Updated 8 years ago
- Pure Type Systems for Functional Programming☆11Jun 11, 2014Updated 11 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A Language and its compiler on Ethereum Virtual Machine☆14Dec 17, 2018Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- Deriving Storable instances using GHC.Generics☆16Apr 9, 2022Updated 3 years ago
- Course website for Systems Verification Fall 2024☆14Jul 10, 2025Updated 7 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Nov 2, 2019Updated 6 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Oct 21, 2024Updated last year
- A Coq library for reasoning (co)inductively on infinite sequences using LTL-like modal operators☆17Jan 7, 2023Updated 3 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Nov 10, 2021Updated 4 years ago
- ☆18Feb 20, 2024Updated last year
- Library of Coq proof automation☆16Feb 15, 2022Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Apr 23, 2021Updated 4 years ago
- A Verified Implementation of Dijkstra's Algorithm☆18Mar 2, 2021Updated 4 years ago
- deprecated by `design-tools`☆17Dec 5, 2018Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Mar 31, 2025Updated 10 months ago