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☆98Updated last year
- A pure type system implemented in OCaml☆78Updated 5 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
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- The Next Generation of Compositional Programming☆56Updated last week
- Example row-polymorphism implementations☆61Updated 2 years ago
- Benchmark repository of polyglot effect handler examples☆34Updated 5 months ago
- An experimental language server for SomewhatML☆24Updated 3 years ago
- A pretty-printing combinator library for OCaml☆51Updated last year
- ☆29Updated 10 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Generation of abstract binding trees☆27Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- An enhanced unification algorithm for Coq☆58Updated this week
- A dependently typed programming language, and verification tool☆27Updated 9 years ago
- Monadic effects and equational reasoning in Rocq☆74Updated last month
- 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
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A proof tree viewer that works with Coq through Proof General☆28Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago