namin / higher-rank
Practical type inference for arbitrary-rank types
☆10Updated 5 years ago
Alternatives and similar repositories for higher-rank:
Users that are interested in higher-rank are comparing it to the libraries listed below
- An extended typed Lambda Calculus☆21Updated 7 months ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆10Updated 10 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A tiny statically typed programming language☆18Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated this week
- A usable type system for call by push-value☆33Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- The Prettiest Printer☆35Updated last year
- ☆17Updated 6 years ago
- Linear map categories in Agda☆5Updated last year