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 tutorial on how Agda infers things☆63Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- A verified compiler for a lazy functional language☆36Updated last week
- Setoid type theory implementation☆38Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆51Updated 3 months ago
- Distributors - Unifying Parsers, Printers & Grammars☆58Updated 2 weeks ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- Where my everyday research happens☆55Updated last week
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- A work-in-progress core language for Agda, in Agda☆59Updated 3 weeks ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 4 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- https://metaborg.github.io/mj.agda/☆13Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- ☆10Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated 2 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- Paper and talk☆55Updated 2 years ago