Blog Posts:

An Algebraic Data Type's Monad

I watched Dr. Emily Reihl’s Compose Conf talk1 last night and a new intuition emerged. The purpose of the talk was to explicate the categorical notion of a monad, and while watching it, I was struck with the realization of how a monad arises from an algebraic data type.

Homotopy Type Theory Desiderata

This is a thing I do. I like to learn things by finding the thing I want to learn, and then work my way down as I encounter unknowns, exposing layers like an epistemological onion — a truth vegetable.

On Descartes and Microservices

And other annoying shit I’ve just made up.

CRDTs, Bounds, SyncFree, and Invariants

I finally got around to watching the SyncFree consortium’s talk about their work on CRDTs at RICON 2014. Or at least half of it, rather, and I was really struck by their Bounded CRDT1s idea. The idea of a bounded CRDT is this: using a predefined invariant, you allow a certain count of “interactions” per replica. They are likened to leases or reservations in the talk. I like reservations better:

Some Readings on Mixins

To me, Mixins were always a simple, stateless collection of loosely related methods that could be included in a class. I mean stateless in that they hold no state of their own, but rather that they assume a given state.

blog archive