lexi-lambda / higher-rankLinks
A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
☆101Updated 8 years ago
Alternatives and similar repositories for higher-rank
Users that are interested in higher-rank are comparing it to the libraries listed below
Sorting:
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Example row-polymorphism implementations☆61Updated last year
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- compile your own functional language☆36Updated 6 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 8 years ago
- An implementation of miniKanren in Haskell☆78Updated 12 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Another implementation of Frank.☆70Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- TParsec - Total Parser Combinators in Idris☆95Updated 2 years ago
- ☆41Updated 8 years ago
- Haskell library for simple, concise and fast generic operations.☆81Updated last year
- Recursion schemes for Idris☆64Updated 7 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Fast linear time sorting and discrimination for a large class of data types☆137Updated 2 months ago
- Build tool for ATS.☆42Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆78Updated 5 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated 2 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 7 months ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month