samuela / bidirectional-typing
A bidirectional type checker
☆59Updated 7 years ago
Alternatives and similar repositories for bidirectional-typing:
Users that are interested in bidirectional-typing are comparing it to the libraries listed below
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago
- Demo for dependent types + runtime code generation☆66Updated last week
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Experimental effects library for Idris 2☆42Updated 2 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Setoid type theory implementation☆38Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- a functional programming language with algebraic effects and handlers☆81Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Fωμ type checker and compiler☆52Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- ICFP tutorial☆39Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- a proof-of-concept programming language based on Call-by-push-value☆54Updated this week
- ☆30Updated 4 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 3 weeks ago
- Fast equality saturation in Haskell☆82Updated last week
- A simple functional programming language.☆21Updated 3 years ago
- ☆89Updated 3 years ago
- Type inference from scratch - Material for my talk at F(by)19☆64Updated 5 years ago