Agda is an advanced programming language based on Type Theory. Agda's type system is expressive enough to support full functional verification of programs, in two styles. In external verification, we write pure functional programs and then write proofs of properties about them. The proofs are separate external artifacts, typically using structural induction. In internal verification, we specify properties of programs through rich types for the programs themselves. This often necessitates including proofs inside code, to show the type checker that the specified properties hold. The power to prove properties of programs in these two styles is a profound addition to the practice of programming, giving programmers the power to guarantee the absence of bugs, and thus improve the quality of software more than previously possible. Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. No familiarity with functional programming or computer-checked proofs is presupposed. The book begins with an introduction to functional programming through familiar examples like booleans, natural numbers, and lists, and techniques for external verification. Internal verification is considered through the examples of vectors, binary search trees, and Braun trees. More advanced material on type-level computation, explicit reasoning about termination, and normalization by evaluation is also included. The book also includes a medium-sized case study on Huffman encoding and decoding.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Aaron Stump is a professor of Computer Science at The University of Iowa. His research interests are in Computational Logic and Programming Languages, especially Type Theory. He received a Bachelor's degree in Computer Science and Philosophy from Cornell University in 1997, and a PhD in Computer Science from Stanford University in 2002.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 65,17 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 5,69 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9781970001273
Quantité disponible : 15 disponible(s)
Vendeur : suffolkbooks, Center moriches, NY, Etats-Unis
hardcover. Etat : Very Good. Fast Shipping - Safe and Secure 7 days a week! N° de réf. du vendeur 3TWOWA001MP8
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Provides a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. The book begins with an introduction to functional programming. More advanced material on type-level computation, explic. N° de réf. du vendeur 481537108
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 283 pages. 9.25x7.50x0.90 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __1970001275
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 27145572-n
Quantité disponible : Plus de 20 disponibles
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. New copy - Usually dispatched within 4 working days. 633. N° de réf. du vendeur B9781970001273
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Agda is an advanced programming language based on Type Theory. Agda's type system is expressive enough to support full functional verification of programs, in two styles. In external verification, we write pure functional programs and then write proofs of properties about them. The proofs are separate external artifacts, typically using structural induction. In internal verification, we specify properties of programs through rich types for the programs themselves. This often necessitates including proofs inside code, to show the type checker that the specified properties hold. The power to prove properties of programs in these two styles is a profound addition to the practice of programming, giving programmers the power to guarantee the absence of bugs, and thus improve the quality of software more than previously possible.Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. No familiarity with functional programming or computer-checked proofs is presupposed.The book begins with an introduction to functional programming through familiar examples like booleans, natural numbers, and lists, and techniques for external verification. Internal verification is considered through the examples of vectors, binary search trees, and Braun trees. More advanced material on type-level computation, explicit reasoning about termination, and normalization by evaluation is also included. The book also includes a medium-sized case study on Huffman encoding and decoding. N° de réf. du vendeur 9781970001273
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. N° de réf. du vendeur e8dfa94674e879f9e84c555eb39b9fad
Quantité disponible : Plus de 20 disponibles
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 284. N° de réf. du vendeur 378122641
Quantité disponible : 3 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 27145572-n
Quantité disponible : Plus de 20 disponibles