AndrasKovacs / flatparse
Fast parsing from bytestrings
☆157Updated this week
Alternatives and similar repositories for flatparse:
Users that are interested in flatparse are comparing it to the libraries listed below
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- Fast and concise extensible effects☆108Updated last year
- GRIN backend for GHC☆144Updated 3 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- Featherlight benchmark framework, drop-in replacement for criterion and gauge.☆81Updated this week
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Inspection Testing for Haskell☆176Updated 3 months ago
- A re-implementation of weeder using HIE files☆173Updated last month
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A community-driven collection of documentation for Haskell error messages and warnings☆105Updated 3 weeks ago
- Extensional capabilities and deriving combinators☆214Updated 9 months ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 weeks ago
- 🚧 a work in progress effect system for Haskell 🚧☆125Updated last year
- Visual tool to spot odd runtime behaviour of Haskell programs.☆109Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A friendly effect system for Haskell☆231Updated 11 months ago
- Total Parser Combinators in Agda☆126Updated last year
- Haskell Functional Reactive Programming framework with type-level clocks☆129Updated last week
- Named parameters (keyword arguments) for Haskell☆94Updated last month
- ☆92Updated 3 weeks ago
- ☆99Updated this week
- ☆100Updated last month
- A Haskell blog☆134Updated 9 months ago
- Repository with code snippets that accompany episodes of The Haskell Unfolder☆97Updated last month
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆93Updated this week
- Higher-kinded data via generics☆170Updated 7 months ago
- ⚡️Efficient implementation of Map with types as keys☆100Updated last year
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 2 years ago