Alternatives and similar repositories for cgc

Users that are interested in cgc are comparing it to the libraries listed below

• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 9 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 4 months ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 6 years ago
• mietek / research
  Work in progress
  ☆38Updated 3 months 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
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 5 months ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 3 months ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 3 weeks ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆30Updated 3 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆18Updated 9 years ago
• 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
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆66Updated this week
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆48Updated 4 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated last month
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 5 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 7 months ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago