AndrasKovacs / flat-maybe
Rust-style strict Maybe in Haskell: no space/indirection overhead.
☆18Updated 10 months ago
Related projects ⓘ
Alternatives and complementary repositories for flat-maybe
- ST with efficient exceptions☆20Updated 8 years ago
- Bidirectional mapping between two key types☆22Updated 6 months ago
- A text editor zipper libary☆17Updated last week
- the 'invariant' Haskell package for invariant functors☆15Updated 8 months ago
- Fast ByteString Builder☆22Updated 2 months ago
- keyed functors☆22Updated 4 months ago
- Uniform interface to reified data type information via Template Haskell☆20Updated 8 months ago
- Various type-aligned sequence data structures.☆20Updated 3 years ago
- Show programming language printed values in a web UI☆24Updated 5 years ago
- Maps using values' monoidal structure during merging☆42Updated 5 months ago
- Exhaustive pattern matching using lenses, traversals, and prisms☆32Updated 2 years ago
- Portable temporary file and directory support for Windows and Unix.☆24Updated 2 years ago
- Memory-efficient representation of Unicode text strings☆22Updated 4 months ago
- generate contextually sensible fuzz tests for servant apps☆26Updated 3 weeks ago
- Expands type synonyms in Template Haskell ASTs☆11Updated 7 months ago
- Type-aligned Deques in Haskell☆9Updated 9 years ago
- Conduit interface for cassava [Haskell]☆15Updated 10 months ago
- A fuzzy string set implementation in Haskell.☆10Updated 8 months ago
- ☆39Updated 7 years ago
- fast unique variables☆10Updated 3 years ago
- Applicative lexer☆13Updated 4 years ago
- Haskell space profiling toolset☆14Updated 6 years ago
- Parse bytes fast☆24Updated 6 months ago
- QuasiQuoter for GHCJS JavaScript FFI☆20Updated 8 years ago
- ☆24Updated 4 years ago
- ☆33Updated 2 months ago
- A faster date and time library based on time☆46Updated last year
- Simple helper functions to work with optparse-applicative☆29Updated 3 years ago
- ☆20Updated last year
- Codo notation for programming with comonads in Haskell☆26Updated 3 years ago