jozefg / higher-order-unification
A small implementation of higher-order unification
☆182Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for higher-order-unification
- An implementation of Pie in Haskell☆204Updated 5 years ago
- Library of the ##dependent distributed research support group☆110Updated 3 months ago
- Total Parser Combinators in Agda☆123Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- GRIN backend for GHC☆143Updated 3 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 5 months ago
- Lecture notes on univalent foundations of mathematics with Agda☆219Updated 6 months ago
- A friendly effect system for Haskell☆228Updated 5 months ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Relational programming in Haskell. Mostly developed on twitch.☆256Updated 2 months ago
- Fake dependent types in Haskell using singletons☆287Updated 2 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A library for formalizing Haskell types and functions in Coq☆167Updated last year
- A language experiment -- irc.freenode.net ##coda☆163Updated 7 months ago
- Compiling Agda code to readable Haskell☆176Updated last month
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- SPLV20 course notes☆106Updated last year
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 2 years ago
- Organization and planning for the Initial Types Club☆70Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Programming library for Agda☆121Updated 2 months ago
- Fast parsing from bytestrings☆148Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Convert Haskell source code to Coq source code☆279Updated 3 years ago