jozefg / higher-order-unification
A small implementation of higher-order unification
☆188Updated 7 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
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 3 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Programming library for Agda☆127Updated 8 months ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Total Parser Combinators in Agda☆126Updated last year
- SPLV20 course notes☆108Updated 2 years ago
- Library of the ##dependent distributed research support group☆112Updated 9 months ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Convert Haskell source code to Coq source code☆280Updated 4 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Fake dependent types in Haskell using singletons☆290Updated last week
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- Compiling Agda code to readable Haskell☆184Updated last week
- 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
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A proof assistant for general type theories☆302Updated 6 months ago
- A friendly effect system for Haskell☆231Updated 11 months ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- Lecture notes on univalent foundations of mathematics with Agda☆226Updated last year
- being the lecture materials and exercises for the 2017/18 session of CS410 Advanced Functional Programming at the University of Strathcly…☆263Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- GRIN backend for GHC☆144Updated 3 years ago
- Horn Clause Constraint Solving for Liquid Types☆144Updated this week