ollef / BidirectionalLinks
Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
☆133Updated 5 years ago
Alternatives and similar repositories for Bidirectional
Users that are interested in Bidirectional are comparing it to the libraries listed below
Sorting:
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Build system☆128Updated last year
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- The Makam Metalanguage☆199Updated 2 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- A prototype programming language for programming with runners☆91Updated 4 years ago
- A bidirectional type checker☆64Updated 8 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 7 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- A compiler for functional programs on serialized data☆168Updated this week
- A small implementation of higher-order unification☆191Updated 8 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- TParsec - Total Parser Combinators in Idris☆96Updated 2 years ago
- theseus, functional programming language with fully reversible computation☆123Updated 6 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Dependent type checker using normalisation by evaluation☆268Updated last year
- The Disco Discus Compiler☆174Updated 6 years ago
- An implementation of Pie in Haskell☆210Updated 5 years ago
- SPLV20 course notes☆112Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago