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
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- 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
- Benchmarking algebraic effect handler implementations☆26Updated 4 years ago
- Constructive Galois connections☆36Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Benchmark repository of polyglot effect handler examples☆32Updated 4 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Session types in Idris2!☆27Updated 5 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Generation of abstract binding trees☆27Updated 3 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆29Updated 10 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago