jozefg / higher-order-unificationLinks
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
Sorting:
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Library of the ##dependent distributed research support group☆114Updated 10 months ago
- Total Parser Combinators in Agda☆128Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆122Updated 4 months ago
- Programming library for Agda☆128Updated 9 months 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☆114Updated last week
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated last year
- SPLV20 course notes☆108Updated 2 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A library for formalizing Haskell types and functions in Coq☆170Updated last year
- Fake dependent types in Haskell using singletons☆290Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A friendly effect system for Haskell☆231Updated last year
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆98Updated 7 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- Convert Haskell source code to Coq source code☆281Updated 4 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…☆156Updated 4 years ago
- Relational programming in Haskell. Mostly developed on twitch.☆263Updated 8 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Fast parsing from bytestrings☆161Updated last month