jozefg / higher-order-unificationLinks
A small implementation of higher-order unification
☆190Updated 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 3 weeks ago
- An implementation of Pie in Haskell☆209Updated 5 years ago
- Library of the ##dependent distributed research support group☆116Updated last year
- Programming library for Agda☆130Updated last year
- SPLV20 course notes☆112Updated 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
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 2 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 7 months ago
- A language experiment -- irc.freenode.net ##coda☆163Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- A proof assistant for general type theories☆308Updated 2 weeks ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆83Updated 2 weeks ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- Compiling Agda code to readable Haskell☆190Updated 3 weeks ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 3 years ago
- Fake dependent types in Haskell using singletons☆291Updated 4 months ago
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- an implementation of stuck macros☆145Updated 2 weeks ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆132Updated 5 years ago