ollef / BidirectionalLinks
Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
☆134Updated 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☆134Updated 3 months ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆64Updated last year
- A prototype programming language for programming with runners☆92Updated 4 years ago
- a functional programming language with algebraic effects and handlers☆81Updated 11 months ago
- The Makam Metalanguage☆199Updated 2 years ago
- A bidirectional type checker☆67Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Updated 6 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Hindley-Milner type inference using constraints☆50Updated 9 years ago
- TParsec - Total Parser Combinators in Idris☆99Updated 2 years ago
- A language experiment -- irc.freenode.net ##coda☆163Updated last year
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A compiler for functional programs on serialized data☆174Updated last week
- ☆90Updated 4 years ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- an implementation of stuck macros☆152Updated last month
- theseus, functional programming language with fully reversible computation☆126Updated 6 years ago
- Dependent type checker using normalisation by evaluation☆273Updated last year