Clojure Conj Reading List

This past weekend, the first (hopefully annual) Clojure Conj took place in Durham, NC.

In my opinion, the conference was a great success, and was greatly inspirational, as well as enjoyable in many regards. I left the conference recharged with energy to better learn about and help improve the Clojure ecosystem, and just get more involved. But, that’s not all I left with of course. I left with great information and even more pointers to new thoughts, opinions and ideas.

I’ve compiled a small reading list of things that were mentioned in talks. I also got a chance to (briefly) meet Michael Fogus, whose talk discussed the influences of Clojure and asked him if it would be possible for him to make a reading list. I certainly hope he does. Anyway, here’s my list:

MonetDB, a novel spatial column-store DBMS–Maarten Vermeij, Wilko Quak, Martin Kersten, Niels Nes

 _Abstract_: Column-store database engines are a promising track in

database research to handle data warehouses. In this paper we describe our experiences in extending the open-source database management system MonetDB with geo-spatial functionality. The approach taken is to leverage the existing geo-spatial software library GEOS through the extensibility features of this DBMS. The result is a high-performance solution using a software stack that enables future research and development improvements in many directions. In our paper we first give an overview of the MonetDB architecture then we describe how this architecture is beneficial for the handling of spatial data.

The Zipper–Gerard Huet

 _Capsule Review_: Almost every programmer has faced the problem of

representing a tree together with a subtree that is the focus of attention, where that focus may move left, right, up or down the tree. The Zipper is Huet’s nifty name for a nifty data structure which fulfills this need. I wish I had known of it when I faced this task, because the solution I came up with was not quite so efficient or elegant as the Zipper.

Finding Flow: The Psychology of Engagement with Everyday Life–Mihaly Csikszentmihalyi

Computer Power and Human Reason–Joseph Weizenbaum

Finger Trees: A Simple General-purpose Data Structure–Ralf Hinze, Ross Paterson

_Abstract_:We present 2-3 finger trees, a functional representation of

persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in time logarithmic in the size of the smaller piece. Representations achieving these bounds have appeared previously, but 2-3 finger trees are much simpler, as are the operations on them. Further, by defining the split operation in a general form, we obtain a general purpose data structure that can serve as a sequence, priority queue, search tree, priority search queue and more.

How to Solve It: A New Aspect of Mathematical Method–G. Polya

Updates and other suggestions

Infinity: Beyond the Beyond the Beyond–Lillian R. Lieber

The Education of T.C. Mits: What modern mathematics means to you–Lillian R. Lieber

The Einstein Theory of Relativity: A Trip to the Fourth Dimension–Lillian R. Lieber








— 2010-10-24