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:
- Example implementation of Algorithm W for Hindley-Milner type inference☆80Updated 3 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- The Makam Metalanguage☆198Updated 2 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- ☆89Updated 3 years ago
- Build system☆123Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆122Updated 4 months ago
- Example row-polymorphism implementations☆61Updated last year
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago
- Dependent type checker using normalisation by evaluation☆260Updated 8 months ago
- GRIN backend for GHC☆144Updated 3 years ago
- A bidirectional type checker☆63Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A prototype programming language for programming with runners☆89Updated 3 years ago
- Total Parser Combinators in Agda☆128Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆114Updated last week