namin / higher-rank
Practical type inference for arbitrary-rank types
☆11Updated 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
Sorting:
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Experimentation project☆16Updated 11 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Dependent hash maps☆14Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- A tiny statically typed programming language☆18Updated 10 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Haskell implementation of interaction net-based lambda evaluation☆20Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- A toy dependent typed language.☆28Updated 3 weeks ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- ☆21Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 2 weeks ago
- playing with resumable computations☆13Updated 5 years ago
- Educational implementation of dependent types☆19Updated 7 years ago
- ☆17Updated 6 years ago