jozefg / higher-order-unificationLinks
A small implementation of higher-order unification
☆188Updated 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
Sorting:
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 5 months ago
- Programming library for Agda☆129Updated 10 months ago
- Total Parser Combinators in Agda☆129Updated 2 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Library of the ##dependent distributed research support group☆114Updated 11 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated last year
- GRIN backend for GHC☆144Updated 3 years ago
- Fake dependent types in Haskell using singletons☆290Updated 2 months ago
- A friendly effect system for Haskell☆232Updated last year
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- SPLV20 course notes☆111Updated 2 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- A minimalistic, elegant and powerful approach to working with graphs in a functional programming language☆197Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Horn Clause Constraint Solving for Liquid Types☆148Updated last week
- Fast parsing from bytestrings☆161Updated this week
- The home of the Glamorous Glambda interpreter☆224Updated 2 months ago