Discover data structures and algorithms for functional programming with rigorously verified proofs using Isabelle. Covering sorting, priority queues, dynamic programming, advanced heap structures, and graph algorithms, it unifies program correctness with runtime analysis through inductively proven methods for both learners and practitioners.
I have a question about the book:
‘Functional Data Structures and Algorithms - Nipkow, Tobias’.
Fill in the form below.
We will respond as fast as possible.
