Embracing Flexibility in Haskell Libraries: The Power of Records of Functions
Improve the robustness and flexibility of your Haskell apps by changing how you design your libraries.
All of my long-form thoughts deemed fit for the internet.
Improve the robustness and flexibility of your Haskell apps by changing how you design your libraries.
We often need to make and manipulate derived types that are similar to each other, but not quite the same. Higher-kinded records provide a way to do this in a generic way, but are clunky. We'll learn how to use the barbies library to make this easier.
An argument for using really exhaustive pattern matching.
In the last post, we figured out an interface for the RPC caller to invoke remote Haskell functions. In this post, we'll see how to handle the server side.
In "One Serialization Class to Rule Them All", I described a way to use a single typeclass to optimally serialize and deserialize multiple data formats in Haskell. In this post, we'll see how to turn Haskell functions into RPC calls.
A lot of the Rust <-> Haskell interop examples out there are for small, synchronous libraries. They also tend to omit how to actually package the Rust library. We'll take a look at challenges and solutions for how to integrate a Tokio-based Rust library with Haskell.
Typical serialization libraries in the Haskell ecosystem target a single format. We explore how to provide composite serialization for data types that chooses the best format for each data type.
We struggled for several months with a mysterious tracing issue in our production environment. Unrelated web requests were being linked together in the same trace, but we could never see the root trace span. This is the story of how we found and fixed root cause.
Adventures in streaming algorithms.
Early explorations in data-driven Haskell applications in the browser.
Sinatra-esque Haskell web apps.