xnning / Consistent-Subtyping-for-All
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆15Updated 4 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
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆12Updated 7 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Setoid type theory implementation☆38Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Example row-polymorphism implementations☆61Updated last year
- Graded Dependent Type systems☆24Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 11 months ago
- Session types in Idris2!☆27Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- MetaML and MetaOCaml bibliography☆89Updated 4 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Benchmarking algebraic effect handler implementations☆26Updated 3 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago