Articles liés à Functional Data Structures and Algorithms: A Proof...
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Functional Data Structures and Algorithms: A Proof...
Image d'archives
Functional Data Structures and Algorithms - A Proof Assistant Approach (eng)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 5 sur 5 étoiles
Etat : new. N° de réf. du vendeur EKUIM1UL7B
Acheter neuf
EUR 62,18
Expédition à EUR 8
Expédition depuis Italie vers Etats-Unis
Expédition depuis Italie vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Functional Data Structures and Algorithms
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9798400731570
Acheter neuf
EUR 66,47
Expédition à EUR 5,86
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
UNKNOWN
ISBN 13 : 9798400731570
Neuf
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 51423801-n
Acheter neuf
EUR 71,85
Expédition à EUR 2,28
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Functional Data Structures and Algorithms (Hardcover)
Edité par
Association of Computing Machinery,U.S., New York, 2025
ISBN 13 : 9798400731570
Neuf
Couverture rigide
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. 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 multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9798400731570
Acheter neuf
EUR 74,24
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Functional Data Structures and Algorithms: A Proof Assistant Approach (ACM Books)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9798400731570
Acheter neuf
EUR 77,29
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
UNKNOWN
ISBN 13 : 9798400731570
Ancien ou d'occasion
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 51423801
Acheter D'occasion
EUR 77,85
Expédition à EUR 2,28
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Functional Data Structures and Algorithms
Edité par
Association of Computing Machinery,U.S., US, 2025
ISBN 13 : 9798400731570
Neuf
Couverture rigide
Vendeur : Rarewaves USA, HEBRON, KY, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardback. Etat : 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. N° de réf. du vendeur LU-9798400731570
Acheter neuf
EUR 84,36
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
UNKNOWN
ISBN 13 : 9798400731570
Ancien ou d'occasion
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 51423801
Acheter D'occasion
EUR 84,84
Expédition à EUR 17,50
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
UNKNOWN
ISBN 13 : 9798400731570
Neuf
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 51423801-n
Acheter neuf
EUR 86,47
Expédition à EUR 17,50
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Functional Data Structures and Algorithms
Edité par
Association of Computing Machinery,U.S., US, 2025
ISBN 13 : 9798400731570
Neuf
Couverture rigide
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardback. Etat : 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. N° de réf. du vendeur LU-9798400731570
Acheter neuf
EUR 110,93
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles