xnning / Consistent-Subtyping-for-AllLinks
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆16Updated 5 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
Sorting:
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 3 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 7 months ago
- MetaML and MetaOCaml bibliography☆95Updated 11 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆30Updated 2 months ago
- ☆29Updated 10 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆18Updated 9 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- Session types in Idris2!☆27Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Graded Dependent Type systems☆25Updated 2 years ago