jozefg / higher-order-unification
A small implementation of higher-order unification
☆184Updated 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
- An implementation of Pie in Haskell☆204Updated 5 years ago
- Total Parser Combinators in Agda☆125Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- Programming library for Agda☆125Updated 4 months ago
- Benchmarks for capture-avoiding substitution☆108Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 7 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated this week
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- SPLV20 course notes☆107Updated 2 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Compiling Agda code to readable Haskell☆180Updated this week
- Fake dependent types in Haskell using singletons☆288Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Fast parsing from bytestrings☆154Updated 2 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 3 months ago
- GRIN backend for GHC☆144Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- being an operating system for typechecking processes☆123Updated last year
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆112Updated last week
- 😎TT☆221Updated last year
- Horn Clause Constraint Solving for Liquid Types☆141Updated this week
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- A friendly effect system for Haskell☆229Updated 8 months ago
- TParsec - Total Parser Combinators in Idris☆92Updated last year
- A language experiment -- irc.freenode.net ##coda☆162Updated 9 months ago