monadfix / named
Named parameters (keyword arguments) for Haskell
☆93Updated 3 months ago
Alternatives and similar repositories for named:
Users that are interested in named are comparing it to the libraries listed below
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated last month
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated last month
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- Haskell library for semigroup actions and torsors☆60Updated last week
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- JHC Haskell compiler split into reusable components☆57Updated 6 years ago
- A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.☆69Updated 4 months ago
- First-class type families☆87Updated 5 months ago
- In goes JSON, out comes a complete Haskell model complete with instances! CLI and web interface available.☆81Updated 4 years ago
- Stream editing with Haskell Megaparsec parsers☆79Updated 8 months ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆96Updated 3 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Inspection Testing for Haskell☆175Updated last month
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Dependent sums and supporting typeclasses for comparing and displaying them☆55Updated last year
- A magic typeclass that just does it☆124Updated 2 years ago
- Lightweight package providing commonly useful parser combinators☆53Updated 2 weeks ago
- do-notation for Category and "Arrow without arr"☆63Updated 7 years ago
- Generic Programming using True Sums of Products☆161Updated last month
- ⚡️Efficient implementation of Map with types as keys☆101Updated last year
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 3 months ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- A syntax for unions of constraints in Haskell☆70Updated 7 years ago
- Fast parsing from bytestrings☆156Updated last month
- Many-dimensional type-safe numeric ops☆46Updated 3 years ago
- A work stealing scheduler☆75Updated last month
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 4 years ago