neel-krishnaswami / inverse-bidirectional-typecheckingLinks
A Toy Inverse Bidirectional Typechecker
☆31Updated 6 years ago
Alternatives and similar repositories for inverse-bidirectional-typechecking
Users that are interested in inverse-bidirectional-typechecking are comparing it to the libraries listed below
Sorting:
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- A repository of MetaOCaml packages☆12Updated 2 weeks ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- ☆18Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- ☆12Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆20Updated 8 months ago
- ☆16Updated 3 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago