A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
☆101May 9, 2017Updated 8 years ago
Alternatives and similar repositories for higher-rank
Users that are interested in higher-rank are comparing it to the libraries listed below
Sorting:
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- ☆14Jan 12, 2018Updated 8 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Aug 28, 2020Updated 5 years ago
- Hopefully verifiable code generation in GHC☆94May 10, 2017Updated 8 years ago
- Hindley-Milner type inference using constraints☆50Jan 2, 2017Updated 9 years ago
- ☆21May 9, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Building self-contained (offline-only) Haskell program tarballs; only Stack+GHC needed☆10Jun 8, 2017Updated 8 years ago
- A simple bidirectional type checker☆18Feb 27, 2019Updated 7 years ago
- ScopeT and ScopeH☆13Aug 3, 2024Updated last year
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Jan 11, 2018Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- Haskell typechecker☆39May 7, 2019Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- being a slightly rethought version of the Frank implementation☆23Feb 9, 2016Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- ☆23Aug 30, 2017Updated 8 years ago
- Dive into GHC☆82Dec 26, 2016Updated 9 years ago
- Functional programming with fewer indirections☆781Aug 20, 2020Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Oct 24, 2021Updated 4 years ago
- ICFP tutorial☆39Jul 31, 2021Updated 4 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Robust prettyprinter for output of auto-generated Show instances☆17Dec 13, 2019Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- The Ntha Programming Language☆91Nov 17, 2016Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆118Apr 6, 2019Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Frank compiler☆305Apr 23, 2024Updated last year
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- A language experiment -- irc.freenode.net ##coda☆163Apr 10, 2024Updated last year
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago
- A monadic (and pretty) pretty printer for Haskell☆39Jul 12, 2023Updated 2 years ago
- Generic Programming using True Sums of Products☆162Jan 7, 2026Updated last month