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 3 months 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 simple implementation of linear type theory☆38Updated 8 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 9 months ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 9 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- ☆12Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A repository of MetaOCaml packages☆13Updated last month
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago