Functional Data Structures and Algorithms (Hardcover)

Lingua: inglese

Editore: Association of Computing Machinery,U.S., New York, 2025

9798400731570

Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Venditore con 5 stelle

Venditore AbeBooks dal 22 giugno 2007

Visualizza gli articoli di questo venditore
Rilegato

Condizione: Nuovo

EUR 141,59

EUR 31,92 spedizione 
Spedito da Australia a U.S.A.

Quantità: 1 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

Hardcover. This book is an introduction to data structures and algorithms for functional programming languages, with a focus on proofs. Starting with sorting and searching, it moves on to priority queues and advanced design and analysis techniques: dynamic programming, amortized analysis, splay trees, skew heaps and pairing heaps. The final part of the book covers a number of selected fun topics: graph algorithms, string search, Huffman's algorithm for generating optimal codes and alpha-beta pruning of game trees. The book covers both correctness (does the algorithm do what it is supposed to do?) and running time analysis (does the algorithm terminate within a specified number of steps?). It does so in a unified manner with inductive proofs about functional programs and their running time functions. What sets this book apart from existing books on algorithms is that all proofs have been machine-checked, by the proof assistant Isabelle. That is, in addition to the text in the book, which requires no knowledge of proof assistants!, the Isabelle definitions and proofs are available online. The structured nature of Isabelle proofs permits even novices to follow the high-level arguments. This book is aimed at teachers and students (it has been classroom-tested for a number of years) but is also a reference work for programmers and researchers who are interested in the (verified!) details of some algorithm or proof. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Codice articolo 9798400731570

Titolo
Functional Data Structures and Algorithms (Hardcover)
Autore
Tobias Nipkow
Editore
Association of Computing Machinery,U.S., New York
Anno di pubblicazione
2025
Condizione
new
Rilegatura
Hardcover
Lingua
inglese
ISBN 13
9798400731570

AussieBookSeller

Truganina, VIC, Australia

Venditore con 5 stelle

Venditore AbeBooks dal 22 giugno 2007

Tariffe di spedizione da Australia a U.S.A.

ArticoloDa 25 a 45 giorni lavorativiDa 8 a 14 giorni lavorativi
Primo articoloEUR 31,92EUR 37,95
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Informazioni sull’azienda del venditore

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029