10 Years of Purely Functional Data Structures

I'm usually a lurker here, but I thought LtU readers might be interested in a post on my blog, looking back on 10 years of my book Purely Functional Data Structures (published in 1998).

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.


It holds an honored spot on my bookcase. I consider it one of my "bibles."

Edison library

FYI, many of the data structures discussed in the book are available in the Edison library. Edison is written in (the GHC dialect of) Haskell.

I've seen it on many a bookshelf

How many other algorithm texts provide materials that by default scale to a distributed setting (modulo changing the assumptions of the analyses)? 'Nuf said

The power of laziness

This book was a revelation to me. It opened my eyes to the real power of laziness when used right. Not everywhere by default, but used exactly in the right places. Section 4.5.8 in CTM is a hommage to PFDS.

One of My Best Buys

I'm going to have to ditto Peter Van Roy here: I really underestimated the power of purely functional data structures until I bought this book. It most definitely is a classic in the field and a must-read for functional programmers, even (especially?) in impure languages.

PFDS Revisited

Finally got around to going through the book in a more methodical manner - translating the code to Oz. Of the books I've attempted translations on, this by far was the most seamless - (though that might just be a function of the similarities between Standard ML and Oz). The code in the book is well thought out and concise. The book itself is not encyclopedic in nature, though the example data structures are well chosen and explored.

Does anyone have another recommendation for an algorithm/data structures book aimed at Functional Programming? I have tried to dive into Knuth and CLRS, but both are firmly entrenched in state. I did look into Algorithms: A Purely Functional Programming Approach but it appears to out of print - and targeted more towards teaching Haskell in particular rather than FP algorithms in general.

A book I've wondered about

but never read: The Functional Approach to Data Management edited by Gray, Kershberg, King, and Poulovasssilis. A collection of papers rather than a solitary work, but it looks interesting.

Anyone read this (or the papers therein)?

a recommendation on an FP algorithms book

(I know I'm answering a comment that's nearly four years old, but for future readers' sakes...)

Pearls of Functional Algorithm Design seems in line with what you want. I haven't read it yet, but I intend to in the near-ish future.

The Fall and Rise of FP

As seen in '98: The Fall and Rise of FP, Lins, R. D.. Ten years old paper, fifty years old paradigm, time for a new paper? ;-)

Flattening Combinators: Surviving Without Parentheses

I was looking at combinator machines.

Funny, a functional pearl Flattening Combinators: Surviving Without Parentheses, Okasaki C.