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
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- GRIN backend for GHC☆143Updated 3 years ago
- Total Parser Combinators in Agda☆123Updated last year
- Library of the ##dependent distributed research support group☆110Updated 4 months ago
- SPLV20 course notes☆106Updated 2 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆76Updated 7 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
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- The home of the Glamorous Glambda interpreter☆219Updated 4 months ago
- Fake dependent types in Haskell using singletons☆287Updated 3 weeks ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Programming library for Agda☆121Updated 3 months ago
- Compiling Agda code to readable Haskell☆177Updated last month
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- A minimal proof language.☆204Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Convert Haskell source code to Coq source code☆279Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- A language experiment -- irc.freenode.net ##coda☆163Updated 7 months ago
- Dependently Typed Lambda Calculus in Haskell☆112Updated 3 years ago
- Fast parsing from bytestrings☆150Updated this week
- Horn Clause Constraint Solving for Liquid Types☆141Updated this week
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆129Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago