Alternatives and similar repositories for higher-order-unification

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

• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 4 months ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆211Updated 6 years ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆212Updated 3 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆119Updated 3 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆133Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 6 months ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆75Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆103Updated 3 months ago
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆143Updated 4 years ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆173Updated 2 months ago
• ekmett / coda
  A language experiment -- irc.freenode.net ##coda
  ☆163Updated last year
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 10 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆114Updated 3 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆105Updated 3 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆91Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆84Updated 9 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆195Updated last week
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆155Updated this week
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 4 months ago
• jwiegley / coq-haskell
  A library for formalizing Haskell types and functions in Coq
  ☆170Updated 2 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆125Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• goldfirere / singletons
  Fake dependent types in Haskell using singletons
  ☆292Updated last month
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆127Updated last year
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆97Updated 2 years ago