xnning / Consistent-Subtyping-for-All
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆15Updated 4 years ago
Alternatives and similar repositories for Consistent-Subtyping-for-All:
Users that are interested in Consistent-Subtyping-for-All are comparing it to the libraries listed below
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Graded Dependent Type systems☆24Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- ☆22Updated 9 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 10 months ago
- ☆29Updated 9 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Generation of abstract binding trees☆28Updated 5 months ago
- Benchmarking algebraic effect handler implementations☆26Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- ☆23Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- ☆54Updated 3 weeks ago
- Setoid type theory implementation☆38Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago