Alternatives and similar repositories for higher-order-unification

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

• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated this week
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆205Updated 5 years ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆115Updated last year
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆130Updated 11 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆210Updated 3 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 6 months ago
• 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 10 months ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆165Updated last month
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 2 years ago
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago
• jwiegley / coq-haskell
  A library for formalizing Haskell types and functions in Coq
  ☆170Updated last year
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• ekmett / coda
  A language experiment -- irc.freenode.net ##coda
  ☆164Updated last year
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆103Updated 3 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆190Updated last week
• goldfirere / singletons
  Fake dependent types in Haskell using singletons
  ☆291Updated 3 months ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆113Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 2 weeks ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆150Updated 2 weeks ago
• lexi-lambda / freer-simple
  A friendly effect system for Haskell
  ☆232Updated last year
• grin-compiler / ghc-whole-program-compiler-project
  GHC Whole Program Compiler and External STG IR tooling
  ☆118Updated 8 months ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• martinescardo / HoTT-UF-Agda-Lecture-Notes
  Lecture notes on univalent foundations of mathematics with Agda
  ☆229Updated last year