data structures are suitable for implementation in functional languages, such as Standard ML or Haskell. This thesis addresses this imbalance by specifically considering the design and …

In computer science, a purely functional data structure is a data structure that can be directly implemented in a purely functional language. The main difference between an arbitrary data …

Several people have used theorem provers to verify the correctness of purely functional data structures. Coq can extract these verifications to working code in Haskell, OCaml, and …

New purely functional data structures published since 1998: 2001: Ideal Hash Trees, and its 2000 predecessor, Fast And Space Efficient Trie Searches, by Phil Bagwell: Apparently used as a …

This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data …

Apr 13, 1998 · This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own …

In "Purely Functional Data Structures," Chris Okasaki transforms a traditionally complex and imperative domain into an elegantly clean and functional one, opening new doors for both …

To rectify this imbalance, this book describes data structures from a functional point of view. We use Standard ML for all our examples, but the programs are easily translated into other …

Jan 1, 1998 · Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time …