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:
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- MetaML and MetaOCaml bibliography☆93Updated 9 months ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A toy dependent typed language.☆32Updated last week
- Example row-polymorphism implementations☆61Updated last year
- Graded Dependent Type systems☆25Updated 2 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
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- # A simple variable binding library based on well-scoped indices and environments☆17Updated 3 weeks ago
- Generation of abstract binding trees☆27Updated 10 months 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
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated last year
- The Next Generation of Compositional Programming☆53Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago