jozefg / higher-order-unificationLinks
A small implementation of higher-order unification
☆192Updated 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:
- An implementation of Pie in Haskell☆211Updated 6 years ago
- Programming library for Agda☆134Updated last year
- Total Parser Combinators in Agda☆132Updated 4 months ago
- Library of the ##dependent distributed research support group☆117Updated last year
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆213Updated 3 years ago
- SPLV20 course notes☆114Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Compiling Agda code to readable Haskell☆196Updated last month
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 11 months ago
- Fast parsing from bytestrings☆173Updated 2 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- A language experiment -- irc.freenode.net ##coda☆163Updated last year
- A proof assistant for general type theories☆309Updated 4 months ago
- GRIN backend for GHC☆143Updated 4 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- Fake dependent types in Haskell using singletons☆292Updated last month
- A library for formalizing Haskell types and functions in Coq☆171Updated 2 years ago
- Horn Clause Constraint Solving for Liquid Types☆155Updated last week
- being an operating system for typechecking processes☆130Updated 2 months ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆84Updated 4 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago