jozefg / higher-order-unificationLinks
A small implementation of higher-order unification
☆191Updated 8 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:
- Total Parser Combinators in Agda☆132Updated 2 months ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- Programming library for Agda☆133Updated last year
- An implementation of Pie in Haskell☆211Updated 5 years ago
- Library of the ##dependent distributed research support group☆117Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆213Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- SPLV20 course notes☆113Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Organization and planning for the Initial Types Club☆73Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 9 months ago
- Horn Clause Constraint Solving for Liquid Types☆153Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated 2 years ago
- A language experiment -- irc.freenode.net ##coda☆163Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Compiling Agda code to readable Haskell☆194Updated 3 weeks ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Fast parsing from bytestrings☆170Updated 3 weeks ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆83Updated 2 months ago