monadfix / named
Named parameters (keyword arguments) for Haskell
☆91Updated 2 weeks ago
Related projects ⓘ
Alternatives and complementary repositories for named
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆73Updated last month
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆95Updated 2 years ago
- Inspection Testing for Haskell☆173Updated last month
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Compile Dhall expressions to Cabal files☆100Updated last year
- Generic Programming using True Sums of Products☆157Updated 5 months ago
- Dependent sums and supporting typeclasses for comparing and displaying them☆54Updated 11 months ago
- A Haskell library for open records and variants using closed type families and type literals☆111Updated 2 years ago
- Stream editing with Haskell Megaparsec parsers☆79Updated 5 months ago
- Hopefully verifiable code generation in GHC☆95Updated 7 years ago
- The Software Foundations book, in GHC☆83Updated 2 weeks ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 4 years ago
- Learn the Agda basics in three 2-hour sessions.☆54Updated last year
- Dependently-typed finite maps (partial dependent products)☆63Updated 5 months ago
- ⚡️Efficient implementation of Map with types as keys☆100Updated 9 months ago
- type level sets☆67Updated 4 years ago
- Moved to Haskell.org GitLab.☆62Updated 6 months ago
- A syntax for unions of constraints in Haskell☆70Updated 7 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆66Updated 3 weeks ago
- Fast parsing from bytestrings☆148Updated last month
- JHC Haskell compiler split into reusable components☆58Updated 5 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Repository accompanying the ZuriHac Advanced Track lecture on Datatype-Generic Programming☆44Updated 4 years ago
- UI experiments for coda☆65Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- 👓 Profunctor based lightweight implementation of Lenses☆73Updated last year
- ☆39Updated 4 years ago