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:
- A simple implementation of linear type theory☆38Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- flexible 'let rec' generation for MetaOCaml☆26Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A repository of MetaOCaml packages☆12Updated last month
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ☆21Updated 7 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- An interpreter of F-ing modules☆19Updated 5 years ago
- Experimental functional language☆17Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated last month
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago