I just wrote about how Clojure's transients work internally. Good reading if you want to implement persistent data structures yourself, and want to squeeze out even more performance out of them.
Latest (interesting?) blogposts:
- Suboptimal Optimisations
- Understanding Clojure's Persistent Vectors — pt. 1, pt. 2, pt. 3, transients
- Read RFS Documents in HTML Form
- Introduction to Open Source Workflows
- Hello World in Swearjure
- How to Cancel a Blocking Read in Java
- A Language Without Conditionals
I designed a quicksort implementation in Swearjure. It's completely useless, but is a proof of concept that Clojure is "usable" even if you remove alphanumerics.