namin / higher-rank
Practical type inference for arbitrary-rank types
☆9Updated 5 years ago
Related projects: ⓘ
- The Alms Programming Language☆43Updated 6 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
- A simple implementation of linear type theory☆38Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆13Updated 5 years ago
- An extended typed Lambda Calculus☆20Updated last month
- ☆28Updated 9 years ago
- A proof that Idris is pacman complete☆8Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆13Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- System F in coq.☆19Updated 9 years ago
- Dependent hash maps☆14Updated 3 months ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆19Updated last year
- A tiny statically typed programming language☆18Updated 10 years ago
- ☆14Updated this week
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- being an experiment with potato power☆23Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- IO using sized types and copatterns☆33Updated 3 years ago