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
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Fωμ type checker and compiler☆54Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last week
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A toy dependent typed language.☆31Updated 2 weeks ago
- Benchmark repository of polyglot effect handler examples☆26Updated last week
- A dependent type theory with user defined data types☆47Updated 3 years ago
- MetaML and MetaOCaml bibliography☆93Updated 8 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☆47Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 6 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
- A verified compiler for a lazy functional language☆37Updated 3 weeks ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- Example row-polymorphism implementations☆61Updated last year
- An experimental language server for SomewhatML☆24Updated 2 years ago
- The MLPolyR programming language, revived☆25Updated 4 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- The Next Generation of Compositional Programming☆52Updated last week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago