Alternatives and similar repositories for advent-of-coq-2021

Users that are interested in advent-of-coq-2021 are comparing it to the libraries listed below

• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 3 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated 2 weeks ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 4 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 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
• cedille / ial
  The Iowa Agda Library
  ☆48Updated this week
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated 6 months ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 5 months ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆61Updated this week
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated last month
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆52Updated last week
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated 7 months ago
• frex-project / idris-frex
  ☆47Updated 3 weeks ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 4 months ago
• rocq-community / manifesto
  Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.
  ☆68Updated 2 months ago
• rocq-prover / rfcs
  Rocq RFCs: documents to discuss changes to the Rocq Prover
  ☆57Updated 5 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 4 months ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆30Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• math-comp / algebra-tactics
  Ring, field, lra, nra, and psatz tactics for Mathematical Components
  ☆33Updated last month
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 4 months ago