Alternatives and similar repositories for library:

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

• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆188Updated 7 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 4 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆116Updated 2 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆101Updated 2 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆97Updated 6 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 9 months ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 3 months ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆127Updated 8 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆108Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆82Updated 8 years ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆111Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆126Updated 11 months ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆107Updated 10 years ago
• llelf / icfp2020-papers
  ICFP 2020 papers. Crowd-sourced
  ☆91Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆51Updated 9 months 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.
  ☆81Updated 3 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆72Updated 2 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• nomeata / veggies
  Hopefully verifiable code generation in GHC
  ☆94Updated 7 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆157Updated 3 weeks ago