neel-krishnaswami / inverse-bidirectional-typecheckingLinks
A Toy Inverse Bidirectional Typechecker
☆32Updated 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 5 months ago
- 🪆 A Staged Type Theory☆35Updated 2 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 tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- A simple λProlog interpreter☆20Updated 3 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 3 weeks ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Anders: Cubical Type Checker☆23Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- MetaML and MetaOCaml bibliography☆93Updated 9 months ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 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 tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- A verified compiler for a lazy functional language☆37Updated this week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A type theory with native support for Polynomial Functors.☆39Updated last year