xnning / Consistent-Subtyping-for-AllLinks
Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
☆15Updated 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☆31Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Session types in Idris2!☆27Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated last month
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Graded Dependent Type systems☆24Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- ☆22Updated 9 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- A pretty-printing combinator library for OCaml☆51Updated 10 months ago
- Setoid type theory implementation☆38Updated last year
- Benchmarking algebraic effect handler implementations☆26Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated 9 months ago
- An interpreter of F-ing modules☆19Updated 5 years ago