Brandon Simmons' website

It didn’t look like anyone had ever tried to answer the question, so I thought I would have a go.

Haskell binaries can get quite large (think ~100MB), especially for projects with many transitive dependencies.

*This is a followup to this previous post where I play with GCC’s link-time optimization in GHC-compiled programs.

I wrote a little tool to graph the fine-grained timing logs produced by ghc when the -v (verbose) flag is given.

I spent some time hacking GHC to use GCC’s link-time optimization, and wanted to share the results.

This is a diary-style post where I chronicle what I learn digging into a digital guitar effects pedal for the first time.

I had an occasion to think about text-friendly binary encoding schemes for the first time at work.

With help from Reid Barton in questions here and here I discovered it’s pretty easy to call assembly from GHC haskell with minimal overhead, so I cleaned up an example of this technique and posted it here: https://github.com/jberryman/almost-inline-asm-ha…

I just released a new Haskell library called unagi-bloomfilter that is up now on hackage.

I’ve just released version 1.0 of a haskell library for principled, cross-platform & extensible hashing of types.

I just started implementing SipHash in hashabler and wanted to share a nice way I found to translate stateful bit-twiddling code in C (which makes heavy use of bitwise assignment operators) to haskell.

I’ve just released the first version of a haskell library for principled, cross-platform & extensible hashing of types, which includes an implementation of the FNV-1a algorithm.

There’s a pervasive myth that Bryan O’Sullivan’s excellent haskell benchmarking library criterion is only useful for benchmarks that take some significant chunk of time (I’ve even heard some people claim on the ms scale).

…

Today I released version 0.2 of unagi-chan, a haskell library implementing fast and scalable FIFO queues with a nice and familiar API.

For CRRVA.

I’ve been doing a lot of experimenting with concurrent operations in haskell and in particular playing with and thinking about the design of concurrent FIFO queues.

This is the first real release shapely-data, a haskell library up here on hackage for working with algebraic datatypes in a simple generic form made up of haskell’s primitive product, sum and unit types: (,), Either, and ().

In this post Philip Nilsson describes an inspiring, principled approach to solving a toy problem posed in a programming interview.

TypeFamilies is a GHC extension that lets you create formerly-impossible abstractions in a very straightforward way.

After pouring 1.5 bottles of horrid caustic chemicals down the drain to no avail, I found I was able to clear a tough clogged shower drain with just the empty bottle: pour kettle full of boiling water into drain stuff overflow drain with plastic wrap (so…

Disclaimer: un-researched, under-educated, fast and loose hacking follows.

From a show of collage works entitled “Self-Abuse” by Adam Juresko.

I just learned about GHC’s RebindableSyntax extension from chrisdoner’s thread on reddit and wanted to play around with scratching a couple itches I’ve had.

A couple posters for the Classical Revolution RVA events at Balliceaux in November and December.

I’ve released a new library for writing sort of idiomatic-looking loops with delays in javascript.

My first linocut.

I’ve finally had a chance to look at how my new lens-based, power-packed, minimal zipper library zippo looks when compiled, and initial results are pleasing!

simple-actors is my library for more structured concurrent programming based on the Actor model.

I finished this new zipper library which you can get with a cabal install zippo and fork it on github.

I’ve finished a simulation-visualization of the very cool algorithm for generating a Maximal Independant Set from “A Biological Solution to a Fundamental Distributed Computing Problem” by Afek et al.

I recently needed to do some conversions/processing to a bunch of HTML files, which contained html canvas images, so I needed a way of converting all the canvas elements on the page to PNGs.

I just uploaded the first version of a lens library I’ve been working on, called yall.

I was just looking at the Monoid docs, when I found an instance that surprised me: Ordering.