lexi-lambda / higher-rank
A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
☆101Updated 7 years ago
Alternatives and similar repositories for higher-rank:
Users that are interested in higher-rank are comparing it to the libraries listed below
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- Example row-polymorphism implementations☆61Updated last year
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- The Disco Discus Compiler☆174Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Haskell library for simple, concise and fast generic operations.☆79Updated last year
- Generic Programming using True Sums of Products☆162Updated 2 months ago
- compile your own functional language☆36Updated 5 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Recursion schemes for Idris☆64Updated 6 years ago
- ☆41Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- ☆111Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated last year
- Monad Transformers and Classes☆77Updated 5 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆108Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 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
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago