Using BangPatterns to Prevent Haskell Space Leaks
Forcing accumulator evaluation with BangPatterns prevents space leaks in Haskell state transforms, keeping memory constant regardless of input size.
Loading…
ReadMeFeed / Community knowledge
Haskell
Real questions. Useful conversations. Find the people who know your stack.
Haskell
Languages & runtimes · #haskell
Choosing Haskell's STM for Safe Concurrent State Management
Learn how Haskell's Software Transactional Memory (STM) lets you manage shared state safely and composably, with a worked bank‑transfer example and practical adoption tips.
GADTs in Haskell: Typed Expression Trees Made Simple
GADTs let Haskell programmers encode per‑constructor type refinements, catching impossible patterns at compile time. This blog walks through a typed expression tree example, highlights trade‑offs, and gives actionable steps to adopt GADTs in your codebase.
Using BangPatterns to Eliminate Space Leaks in Haskell Accumulators
See how adding a strictness annotation to an accumulator turns a linear‑space sum into constant‑space code, with verification steps and trade‑offs.
Building a Concurrent Counter with Haskell's Software Transactional Memory
Learn how to use Haskell's STM primitives to safely update a shared counter from multiple threads, compile with GHC, run with threading enabled, and verify the result.
MVar vs STM: A Practical Decision Guide for Haskell Concurrency
When building concurrent Haskell programs, choosing between MVar and STM is critical. This guide weighs constraints, compares options, and shows a hands‑on counter benchmark to help you decide.
Using Haskell STM for Safe Concurrent State: An Architecture Note
An architecture note on using Haskell's STM and TVar for composable, lock-free concurrent state: requirements, minimal design, trust boundaries, operational checks, failure modes, and when to switch approaches.
Zero‑Cost Domain Semantics with DerivingVia and Newtype Wrappers
Give primitives semantic meaning with zero‑cost wrappers using Haskell’s DerivingVia. Learn the pattern, mechanics, a worked example, trade‑offs, and how to adopt it safely in your codebase.
BangPatterns: When and How to Force Strict Evaluation in Haskell
BangPatterns let you force eager evaluation of arguments in Haskell. This guide shows why, how, and when to use them, with a concrete sum example, performance checks, and common pitfalls.