mit-plv / rewriter
Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
☆22Updated last month
Related projects: ⓘ
- Lenses in Coq☆17Updated last year
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 2 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated this week
- Multinomials for the Mathematical Components library.☆14Updated 2 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆29Updated this week
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆27Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A plugin for Coq that implements the call-by-name forcing translation☆12Updated 3 years ago
- A Coq library providing tactics to deal with hypothesis☆20Updated 9 months ago
- a version of the 2048 game for Coq☆22Updated 10 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆44Updated this week
- Coq library for serialization to S-expressions☆18Updated last year
- Coq Enhancement Proposals☆43Updated last week
- A repository of MetaOCaml packages☆12Updated last year
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆33Updated last year
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- ☆18Updated 2 years ago
- ☆17Updated 5 years ago
- ☆13Updated 4 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 5 years ago
- ☆33Updated this week
- Partial Commutative Monoids☆26Updated this week
- A Coq tactic for proving multivariate inequalities using SDP solvers☆9Updated 6 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆16Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆19Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago