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:
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A tutorial on how Agda infers things☆58Updated this week
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- ☆48Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆63Updated last week
- Fωμ type checker and compiler☆54Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- A simple functional programming language.☆21Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- high-performance cubical evaluation☆74Updated 2 months ago