Discover data structures and algorithm design in functional programming through rigorous, machine-checked Isabelle proofs. Topics span sorting, searching, priority queues, dynamic programming, splay trees, graph and string algorithms, Huffman coding, and alpha-beta game tree pruning techniques.
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.
We value your privacy
We use cookies to measure traffic, improve Boekstra and let Google tailor ads to your interests. You can keep using the site either way — even if you decline. More info
