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:
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- MetaML and MetaOCaml bibliography☆93Updated 10 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 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
- Benchmark repository of polyglot effect handler examples☆28Updated last month
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- ☆29Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- The Next Generation of Compositional Programming☆53Updated last month
- A dependently typed programming language, and verification tool☆27Updated 9 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 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
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Generation of abstract binding trees☆27Updated last week
- Example row-polymorphism implementations☆61Updated 2 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago