- All purely functional data structures are automatically lock-less, since they are immutable
- This is also called persistent data structure, as the old version would be maintained
- Chris Okasaki’s seminal book: Purely Functional Data Structures
- Examples of purely functional data structures
- FC++ – functional programming in C++
- Making Data Structure Persistent
- Real-time deques, multi-head Turing machines, and purely functional programming
- VList – a persistent data structure that adds an array-index on top of list
- Fully-persistent list with concatenation (append)
