kwanghoon / bidiLinks
bidirectional type checking algorithms for higher-ranked polymorphism
☆19Updated 3 years ago
Alternatives and similar repositories for bidi
Users that are interested in bidi are comparing it to the libraries listed below
Sorting:
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- A verified compiler for a lazy functional language☆36Updated last month
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆33Updated 8 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated 9 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 6 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆47Updated 3 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- Mechanizations of Type Theories☆30Updated 2 weeks ago
- ☆14Updated 5 years ago
- Setoid type theory implementation☆38Updated last year
- Anders: Cubical Type Checker☆24Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- Deadlock freedom by type checking☆20Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆61Updated this week