ollef / Bidirectional
Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
☆131Updated 4 years ago
Alternatives and similar repositories for Bidirectional:
Users that are interested in Bidirectional are comparing it to the libraries listed below
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Dependent type checker using normalisation by evaluation☆260Updated 8 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- Build system☆123Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- A bidirectional type checker☆63Updated 7 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆89Updated 6 years ago
- SPLV20 course notes☆108Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- A small implementation of higher-order unification☆188Updated 7 years ago
- higher order dependently typed logic programing☆171Updated 6 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- A prototype programming language for programming with runners☆89Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago