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:
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Fωμ type checker and compiler☆55Updated 2 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.☆23Updated 8 years ago
- Benchmarking algebraic effect handler implementations☆26Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- Benchmark repository of polyglot effect handler examples☆30Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 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
- Constructive Galois connections☆36Updated 7 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated last week
- MetaML and MetaOCaml bibliography☆96Updated last year
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- The Next Generation of Compositional Programming☆54Updated 2 weeks ago
- A nano "theorem prover".☆62Updated 6 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago