I have written a rather long blogpost on the performance of the Persistent Vector, along with some ways to speed the Clojure implementation a bit up. It's available on Persistent Vector Performance and I believe a good read if you're interested in these kinds of details. For people not that interested in the details, it's probably best to have a look at the summary instead.
Latest (interesting?) blogposts:
- Clojure's Transducers in Haskell
- The Simplest Collection
- Parsing TeX with Recursive Transducers
- Swearjure is Turing Complete
- Persistent Vector Performance
- Understanding Clojure's Persistent Vectors series:
part 1: basics - part 2: indexing - part 3: tail - part 4: transients - part 5: perf
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.