Alternatives and similar repositories for higher-order-unification

Users that are interested in higher-order-unification are comparing it to the libraries listed below

• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆210Updated 5 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆130Updated last year
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 2 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆211Updated 3 years ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆102Updated last month
• edwinb / SPLV20
  SPLV20 course notes
  ☆113Updated 2 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆91Updated 7 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 2 months ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 8 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆104Updated 3 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated last month
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆167Updated last month
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆72Updated 6 years ago
• goldfirere / singletons
  Fake dependent types in Haskell using singletons
  ☆291Updated last week
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆125Updated last year
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 3 years ago
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆308Updated 2 months ago
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆124Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• ekmett / coda
  A language experiment -- irc.freenode.net ##coda
  ☆163Updated last year
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆96Updated 2 years ago
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆152Updated last month