xnning / Consistent-Subtyping-for-AllLinks
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆17Updated 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
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- Fωμ type checker and compiler☆56Updated 3 years ago
- MetaML and MetaOCaml bibliography☆99Updated last year
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- ☆29Updated 10 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Generation of abstract binding trees☆27Updated 4 months ago
- Benchmark repository of polyglot effect handler examples☆34Updated 5 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Benchmarking algebraic effect handler implementations☆27Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Session types in Idris2!☆27Updated 5 years ago
- The Next Generation of Compositional Programming☆56Updated 2 weeks ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 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 9 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A toy dependent typed language.☆36Updated this week
- An experimental language server for SomewhatML☆24Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago