Unification and type inference algorithms
☆127Feb 21, 2015Updated 11 years ago
Alternatives and similar repositories for type-inference
Users that are interested in type-inference are comparing it to the libraries listed below
Sorting:
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Where my everyday research happens☆56Feb 17, 2026Updated 2 weeks ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- A TOML parser for Idris 2☆17Jun 27, 2024Updated last year
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Feb 17, 2023Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- ☆16Feb 18, 2025Updated last year
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Total Parser Combinators in Agda☆132Aug 5, 2025Updated 7 months ago
- Simplify and render Template Haskell☆18Aug 19, 2018Updated 7 years ago
- van Laarhoven lenses for Idris☆20Sep 25, 2017Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆56Apr 23, 2017Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- Miller/pattern unification in Agda☆68Oct 29, 2025Updated 4 months ago
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust☆121Sep 21, 2020Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94May 10, 2017Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- A functional test framework for LSP servers☆35Mar 22, 2021Updated 4 years ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- being a slightly rethought version of the Frank implementation☆23Feb 9, 2016Updated 10 years ago
- A compiler for a strongly typed, haskell-like functional language☆22Feb 1, 2018Updated 8 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Jul 23, 2013Updated 12 years ago
- Literature review of GHC's Core language, System FC☆67Jun 27, 2018Updated 7 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Minimal implementations for dependent type checking and elaboration☆768Jan 30, 2026Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago