xnning / Consistent-Subtyping-for-All
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆16Updated 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 copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Benchmarking algebraic effect handler implementations☆24Updated 3 years ago
- ☆29Updated 9 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last month
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- LL(1) parser generator verified in Coq☆45Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- 🪆 A Staged Type Theory☆34Updated last year
- Graded Dependent Type systems☆24Updated last year
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆30Updated last year
- A verified compiler for a lazy functional language☆32Updated this week
- Example row-polymorphism implementations☆61Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago