ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Languages & runtimes · #haskell
Flip numeric ordering in Haskell with DerivingVia and Data.Ord.Down: a concise, zero‑overhead solution for priority types and more.
Combine configuration, error handling, and IO in one Haskell stack with ReaderT, ExceptT, and monad transformers. Includes a server example and limits to check.
Identify and eliminate space leaks caused by lazy accumulation in Haskell using profiling, Core inspection, and strictness annotations.
Replace Haskell's slow String type with Data.Text for O(n) operations, lower memory use, and faster execution. A real‑world word‑count example shows a 5× speedup and 70% memory reduction. Audit, convert, and profile to reap the benefits.
A decision guide comparing Haskell’s lazy list, unboxed vector, Data.Sequence, and IntSet for a large‑integer pipeline, with a concrete Criterion benchmark example.
Standard Haskell ADTs treat every expression node the same, so type errors hide until runtime. GADTs index constructors by return type, letting the compiler reject invalid DSL operations before you run the program.
Use Haskell sum types and pattern matching to make illegal payment states unrepresentable. A concrete PaymentMethod ADT shows how the compiler enforces exhaustive handling and self-documenting records, with trade-offs at serialization boundaries.
Haskell's default laziness stores data fields as thunks. Making data types strict by default with StrictData prevents space leaks from thunk buildup, while selective laziness preserves composability where it matters.
When performance matters, deciding between immutable and mutable vectors can change your program’s speed and memory usage. This guide explains the constraints, compares both options, and shows a concrete ST‑monad implementation that stays pure from the caller’s view.