lamdu / hypertypes
Hypertypes - generic programming for heterogeneous recursive types
☆121Updated 2 months ago
Alternatives and similar repositories for hypertypes:
Users that are interested in hypertypes are comparing it to the libraries listed below
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 2 years ago
- Inspection Testing for Haskell☆175Updated 2 months ago
- Fast parsing from bytestrings☆156Updated 2 months ago
- Extensional capabilities and deriving combinators☆214Updated 8 months ago
- ⚡️Efficient implementation of Map with types as keys☆101Updated last year
- Fast and concise extensible effects☆108Updated last year
- GRIN backend for GHC☆143Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Measure allocations of a Haskell functions/values☆93Updated 4 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Generic Programming using True Sums of Products☆161Updated 2 months ago
- Visual tool to spot odd runtime behaviour of Haskell programs.☆109Updated 3 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Stream editing with Haskell Megaparsec parsers☆79Updated 9 months ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- JHC Haskell compiler split into reusable components☆57Updated 6 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 months ago
- Named parameters (keyword arguments) for Haskell☆94Updated 4 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆96Updated 3 years ago
- ☆92Updated 11 months ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- Haskell library for type-inference with Hindley-Milner type-system.☆34Updated 9 months ago