Bibliography for my presentation, Working with Functional Data Structures, Practical F# Application, February 4 at San Francisco F# User Group.

Purely Functional Data Structures (1996)

Purely Functional Data Structures (1998)

Purely Functional Stepchildren

F# Data Structure Libraries in FSharpx

A Unified Collection of Purely Functional List-like Data Structures

Comparing F# Queues

Semantics and List-like Data Structures

FSharpx.Collections

FSharpx.Collections.Experimental

Double-ended Queues for F#

DS_Benchmark

Benchmarking F# Data Structures — Introduction

Benchmarking F# Data Structures — Loading Data

Eric Lippert’s Comma Quibbling

Nick Palladinos Comma Quibbling

GC Performance Counters

LazyList

Are functional languages inherently slow?

The benefits of purely functional data structures

Functional Pearls Red-Black Trees in a Functional Setting

F# vs Mathematica: red-black trees

Red-Black Tree Remove

Implimenting IComparable in F#

Catamorphism

Pingback: F# Weekly #6, 2013 « Sergey Tihon's Blog