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
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- MetaML and MetaOCaml bibliography☆94Updated 10 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
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- A verified compiler for a lazy functional language☆37Updated this week
- Generation of abstract binding trees☆27Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- A toy dependent typed language.☆32Updated this week
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 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.☆22Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- ☆39Updated 2 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- # A simple variable binding library based on well-scoped indices and environments☆21Updated last week
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆29Updated 2 months ago