Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Functional Data Structures and Algorithms: A Proof...
Beispielbild für diese ISBN
Functional Data Structures and Algorithms: A Proof Assistant Approach
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9798400731594
Beispielbild für diese ISBN
UNKNOWN
ISBN 13: 9798400731594
Neu
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 51354272-n
Neu kaufen
EUR 50,93
Versand:
EUR 2,29
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Functional Data Structures and Algorithms - A Proof Assistant Approach
Print-on-DemandAnbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9798400731594
Neu kaufen
EUR 53,32
Versand:
Gratis
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
UNKNOWN
ISBN 13: 9798400731594
Gebraucht
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 51354272
Gebraucht kaufen
EUR 51,57
Versand:
EUR 2,29
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Functional Data Structures and Algorithms - A Proof Assistant Approach
Print-on-DemandAnbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9798400731594
Neu kaufen
EUR 48,20
Versand:
EUR 5,71
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Functional Data Structures and Algorithms (Paperback)
Verlag:
Association of Computing Machinery,U.S., New York, 2025
ISBN 13: 9798400731594
Neu
Paperback
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: new. Paperback. 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 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9798400731594
Beispielbild für diese ISBN
UNKNOWN
ISBN 13: 9798400731594
Neu
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 51354272-n
Neu kaufen
EUR 48,19
Versand:
EUR 17,06
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Functional Data Structures and Algorithms
Anbieter: Rarewaves USA, OSWEGO, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9798400731594
Neu kaufen
EUR 69,11
Versand:
Gratis
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
UNKNOWN
ISBN 13: 9798400731594
Gebraucht
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 51354272
Gebraucht kaufen
EUR 52,86
Versand:
EUR 17,06
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Functional Data Structures and Algorithms
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9798400731594
Neu kaufen
EUR 79,49
Versand:
Gratis
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar