Alternatives and similar repositories for library

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

• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 7 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆101Updated last week
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆190Updated 8 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 2 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆103Updated 3 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆130Updated last year
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated 3 weeks ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 2 weeks ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆114Updated 5 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆75Updated 3 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated last week
• 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
• fredefox / cat
  A formalization of category theory in cubical Agda
  ☆59Updated 5 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆60Updated last month
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 7 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆54Updated 2 months ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆57Updated 6 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 3 weeks ago