Purely Functional Data Structures

Livro digital

Título:
Purely Functional Data Structures

Autor:
Chris Okasaki

Categoria:
Tecnologia > Backend

Doador:
Raffaello D. N.

Sinopse:
Purely Functional Data Structures opens with the core tension in its table of contents: first comes lazy evaluation, then amortization and persistence, and then concrete chapters on eliminating amortization and rebuilding structures lazily. That sequence signals a book for readers who already know the basics of data structures, but need a deeper answer to a harder question: how do you make efficient structures work when updates create many usable versions at once? The thesis moves from queues and deques to heaps, random-access lists, and numeric representations, showing several ways to design and analyze structures for purely functional languages. Its chapters do not just list familiar implementations, they connect them to lazy evaluation, scheduling, and the banker’s and physicist’s methods, with later sections on real-time queues, batched and global rebuilding, and segmented binary techniques that broaden the toolkit beyond standard textbook treatments. The result is a rigorous, advanced treatment of functional data structures that is as much about analysis as implementation. Readers come away with practical patterns for persistence-friendly efficiency, plus a model for reasoning about time costs in lazy programs. It is a strong fit for anyone studying programming languages, algorithm design, or the interaction between theory and real performance in functional systems.