jozefg / higher-order-unification
A small implementation of higher-order unification
☆186Updated 7 years ago
Alternatives and similar repositories for higher-order-unification:
Users that are interested in higher-order-unification are comparing it to the libraries listed below
- Total Parser Combinators in Agda☆126Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 2 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Programming library for Agda☆127Updated 7 months ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Library of the ##dependent distributed research support group☆112Updated 8 months ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- A language experiment -- irc.freenode.net ##coda☆162Updated 11 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last month
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Fake dependent types in Haskell using singletons☆290Updated 2 weeks ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated this week
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A friendly effect system for Haskell☆231Updated 10 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Convert Haskell source code to Coq source code☆280Updated 4 years ago
- Compiling Agda code to readable Haskell☆183Updated last week
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- Fast parsing from bytestrings☆156Updated 2 months ago
- A proof assistant for general type theories☆302Updated 5 months ago