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 tutorial on how Agda infers things☆61Updated 2 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Distributors - Unifying Parsers, Printers & Grammars☆53Updated this week
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- A bidirectional type checker☆64Updated 8 years ago
- ☆48Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- A simple functional programming language.☆22Updated 4 years ago
- Where my everyday research happens☆55Updated 3 months ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- Paper and talk☆55Updated 2 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated last month
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year