code

• Linking Smaller Haskell Binaries

• GHC LLVM LTO Experiments Scratch Notes

• A little tool for visualizing ghc verbose timing

• Initial hacking of GHC for GCC link-time optimization

• Hacking around on an FV-1 based guitar pedal

• Choosing a binary-to-text encoding

• Almost inline ASM in haskell with foreign import prim

• Announcing: unagi-bloomfilter

• Announcing: Hashabler 1.0. Now even more hashy with SipHash

• Translating some stateful bit-twiddling to haskell

• Announcing hashabler: like hashable only more so

• Benchmarking very fast things with criterion

• Announcing unagi-chan

• Thoughts on FIFO-ness

• Announcing shapely-data v0.1

• Writing a streaming twitter waterflow solution

• A TypeFamilies Primer

• Thinking about an economy of bit flips

• Using GHC's RebindableSyntax for a dynamic state "Fauxnad"

• dilly.js: a library for loops with delays in JavaScript

• Making your zipper disappear with Zippo

• simple-actors 0.4.0: a few interesting design bits

• zippo: a lightweight lens-based, type-checked, heterogenous zipper

• A Simulation of a Biological MIS Algorithm

• Converting HTML5 canvas elements to images

• Announcing yet another lens library

• the Monoid instance for Ordering

• Optimization fun: Minimum Edit Distance

• shapely-data: a library for structuralizing Haskell data types

• Categories that want to be Arrows

• How the Haskell Prelude avoids overlapping instances in Show

• Haskell state of the Lens, etc.

• pez v0.1.0 released

• Working with Template Haskell in GHCi

• Why I love Hoogle

• When is it okay to 'fail'?

• The Total Recall combinator

• The State Monad: a tutorial for the confused?

• The move-to-front (MTF) Transform

• The Gift of Inconsistency

• The Definition of Data.List.group

• Synchronized Concurrent IO Actions

• Some initial tests of Tries

• Some Haskell Boilerplate For Google CodeJam

• simple-actors: a simple Actor Model concurrency library

• simple-actors 0.1.0 released

• Run-length Encoding

• Repairing NetbookInstaller's Chameleon Bootloader

• Proposed modification to 'array' function in Data.Array

• Polishing a Functional Pearl: The Burrows-Wheeler Transform

• PEZ: the Potentially-Excellent Zipper library release

• Partial Application and a simple Mastermind game

• Parallel List Comprehensions with a Monte Carlo example

• New version of directory-tree on hackage

• New version of 'thrist' package released

• Module 'chan-split' released

• Magic Haskell code completions in Vim!

• List Grouping module released

• Lazy Arithmetic in Haskell

• Initial tests of Tries: Follow Up

• Huffman Coding

• Gnome Sort

• Fun with Lazy Arrays: the LZ77 Algorithm

• Find a permutation given its Inversion Table

• Enumerating all n-integer Sets Which Sum to an Integer x

• Do Applicative Functors generalize the S & K Combinators?

• directory-tree module released

• Designing a Module for Combinatory Logic in Haskell

• DeBruijn Sequences pt.3 - The "Prefer Opposite" algorithm

• Data.Map Conversion Functionality

• Cycle Detection

• Cracking a Lock in Haskell with the De Bruijn sequence, pt. 2

• Cracking a Lock in Haskell with the De Bruijn sequence, pt. 1

• Code Jam 2010: Incrementing a Binary Counter

• Building a Tree from an Ordered List

• Befunge-93 Interpreter on Hackage

• An alternative definition for Data.List.groupBy

• An "Adaptive" Move-to-Front Algorithm

• A State Monad with dynamically-typed state

• a DirectoryTree module and some examples

• A brief tutorial-introduction to 'fclabels' 1.0

• A Befunge-93 Interpreter

• 17x17: Symmetric Single-Colorings and some Graph Theory

• 17x17: Some Thoughts on the Problem

• 17x17: some Simulated Annealing updates

• 17x17: Some Attempts at Doubly-Symmetrical Rotations

• 17x17: More about symmetry and a new rotation

• 17x17: Further Thoughts & Some Pretty Pictures

• 17x17: Deterministic algorithm for single-coloring a grid

• 17x17: Brute Force Algorithm for an Optimal Rectangle-Free Subset

• 17x17: A Simulated Annealing approach using thresholds