ollef / BidirectionalLinks
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
Sorting:
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Build system☆124Updated last year
- Example row-polymorphism implementations☆61Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- The Makam Metalanguage☆199Updated 2 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- A bidirectional type checker☆63Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 weeks ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- a functional programming language with algebraic effects and handlers☆82Updated 6 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- Inigo: A Package Manager for Idris2☆63Updated 2 years ago
- Dependent type checker using normalisation by evaluation☆265Updated 11 months ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆90Updated 3 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆142Updated 6 years ago
- A small implementation of higher-order unification☆190Updated 8 years ago
- A compiler for functional programs on serialized data☆166Updated 2 months ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- an implementation of stuck macros☆145Updated last week
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated 2 years ago