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
- A simple implementation of linear type theory☆38Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last month
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A tiny statically typed programming language☆18Updated 10 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- ☆17Updated 6 years ago
- A toy dependent typed language.☆24Updated this week
- The Alms Programming Language☆44Updated 6 years ago
- Dependent hash maps☆14Updated 7 months ago
- Session types in Idris2!☆27Updated 4 years ago
- Experimentation project☆16Updated 10 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆15Updated 6 years ago
- Linear map categories in Agda☆5Updated last year
- System F in coq.☆19Updated 9 years ago
- ☆29Updated 9 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆30Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago