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:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- ☆48Updated 2 weeks ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- A tutorial on how Agda infers things☆61Updated last month
- Setoid type theory implementation☆38Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Demo for dependent types + runtime code generation☆70Updated 6 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- high-performance cubical evaluation☆75Updated 4 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 2 weeks ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- Mechanizations of Type Theories☆32Updated 2 weeks ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆46Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last month
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- Fast equality saturation in Haskell☆86Updated last month
- Let's rethink how we interact with Agda☆18Updated 2 years ago