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
• mit-frap / spring20
  Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020
  ☆19Updated 5 years ago
• math-comp / finmap
  Finite sets, finite maps, multisets and generic sets
  ☆51Updated last month
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• Mtac2 / Mtac2
  ☆56Updated last month
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• damien-pous / relation-algebra
  Relation algebra library for Coq
  ☆48Updated 2 months ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• strub / elliptic-curves-ssr
  A Formal Library about Elliptic Curves for the Mathematical Components Library.
  ☆15Updated 4 years ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated 11 months ago
• mit-frap / spring18
  Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018
  ☆23Updated 7 years ago
• leanprover / tc
  Reference type checker for the Lean theorem prover
  ☆64Updated 8 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated this week
• tchajed / coq-tactical
  Library of Coq proof automation
  ☆16Updated 3 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆46Updated last year
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆21Updated 2 years ago
• mit-frap / spring17
  Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
  ☆20Updated 8 years ago
• mit-plv / rewriter
  Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
  ☆25Updated this week
• jonsterling / lcf-sequent-calculus-example
  A self-contained implementation of forward and backward inference for intuitionistic propositional logic
  ☆18Updated 8 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated last year
• 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
• rocq-community / coqeal
  The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
  ☆73Updated last month
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆64Updated last week
• bedrocksystems / coq-lens
  Lenses in Coq
  ☆17Updated 3 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated this week
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated last week
• mit-plv / bbv
  Bedrock Bit Vector Library
  ☆28Updated last month
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆20Updated 4 years ago