Friday, 24 April 2009

Purely functional data structures: streams, queues and catenable lists

The OCaml Journal just published an article about the implementation of efficient purely functional data structures using OCaml 3.11 and its new lazy patterns:

"This article is the first in a series describing the design and implementation of some very useful purely functional data structures. Lazy streams, batched and real-time queues and lists with O(1) concatenation are described in detail. In particular, functors are used extensively to provide elegant parameterization over data structures and some of the new features in OCaml 3.11 are used to improve both performance and clarity..."

To read this article and more, subscribe to The OCaml Journal today!

No comments: