The PhD dissertation of Chris Okasaki describing efficient persistent data structures. He outlines a model of time, a framework for measuring the efficiency of such data structures, and algorithms using them. Candy for the brain!
It looks like Clojure is primed to run on yet another runtime. I am not certain, but it looks like it is following in Clojurescript’s footsteps and implementing defprotocol as soon as possible.
Clojure-Py also has an ambitious roadmap:
version 1.0 – Fault-tolerant, distributed programming via Erlang style concurrency. This will allow us to “code around the GIL” and at the same time have distributed capabilities not seen in any other Clojure dialect.
I have to admit I love online conference videos. I watch them while I work, cook, clean the dishes, everything! Lang.NEXT is a conference about programming languages, and it just started releasing videos from their recent event. Check them out.
The inimitable Christophe Grand discusses how to deal with divergent logical branches. Some logical operators, like OR and AND, in the pure sense, do not depend on order (they are commutative). But in computation, they do! Christophe tackles this problem in a new branch of the core.logic github repo.
If you are into programming languages, you probably already know this blog with a very active community. I must admit, most discussion are way over my head. But there is always something interesting going on.
We have all had to work on software that was just a big ball of mud. Over the years, each developer add just a little more code to a massive system. No one knows how it works any more, and every day you feel more and more like chucking it all out and starting from scratch. Sound like your day job? Well, fear not! This veritable tome of wisdom casts a truth-seeking eye over the realities of dealing with mudball systems of all types.