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
- 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
- ⚡️Efficient implementation of Map with types as keys☆101Updated last year
- Generic Programming using True Sums of Products☆162Updated 2 months ago
- Extensional capabilities and deriving combinators☆214Updated 8 months ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Measure allocations of a Haskell functions/values☆93Updated 4 months ago
- Fast and concise extensible effects☆108Updated last year
- Experimental, user-contributed effects and interpreters for polysemy☆71Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A PureScript interpreter in Haskell☆119Updated 2 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 months ago
- GRIN backend for GHC☆144Updated 3 years ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆96Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆91Updated 7 months ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Higher-kinded data via generics☆170Updated 7 months ago
- ☆99Updated last week
- Benchmarks for sequence data structures: lists, vectors, etc.☆88Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 5 years ago
- First-class type families☆87Updated 7 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year