Alternatives and similar repositories for reification-by-parametricity

Users that are interested in reification-by-parametricity are comparing it to the libraries listed below

• ybertot / plugin_tutorials
  A collection of small projects to illustrate how to write plugins for Coq
  ☆21Updated 6 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 8 months ago
• mit-frap / spring20
  Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020
  ☆19Updated 5 years ago
• leanprover / tc
  Reference type checker for the Lean theorem prover
  ☆62Updated 8 years ago
• Mtac2 / Mtac2
  ☆55Updated 4 months ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆59Updated last week
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• mit-plv / rewriter
  Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
  ☆25Updated last week
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated 8 months ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆27Updated last year
• strub / elliptic-curves-ssr
  A Formal Library about Elliptic Curves for the Mathematical Components Library.
  ☆15Updated 3 years ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆35Updated 8 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆53Updated last month
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆22Updated 8 years ago
• mit-frap / spring17
  Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
  ☆20Updated 8 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 4 months ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆19Updated 4 years ago
• GaloisInc / lean-protocol-support
  This project contains various supporting libraries for lean to reason about protocols.
  ☆43Updated 7 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• rocq-community / coqeal
  The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
  ☆72Updated last month
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• lthms / FreeSpec
  A framework for implementing and certifying impure computations in Coq
  ☆52Updated last year
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 5 years ago
• arthuraa / memory-safe-language
  A formalization of properties of a simple imperative, memory-safe language.
  ☆19Updated 3 years ago
• damien-pous / relation-algebra
  Relation algebra library for Coq
  ☆49Updated 4 months ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 months ago