xnning / Consistent-Subtyping-for-All
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆16Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for Consistent-Subtyping-for-All
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆29Updated 9 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Graded Dependent Type systems☆23Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Session types in Idris2!☆27Updated 3 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- The MLPolyR programming language, revived☆24Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Benchmarking algebraic effect handler implementations☆24Updated 3 years ago
- Two-Level Type Theory☆27Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 6 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Anders: Cubical Type Checker☆18Updated last year
- Generation of abstract binding trees☆27Updated last month
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆25Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 5 months ago
- The Alms Programming Language☆44Updated 6 years ago