Verwandte Artikel zu Verified Functional Programming in Agda (ACM Books)
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 64,72
EUR 3,40 für den Versand innerhalb von/der USA
Versandziele, Kosten & Dauer
Suchergebnisse für Verified Functional Programming in Agda (ACM Books)
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Fair. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way. Bestandsnummer des Verkäufers 1970001240-7-1-10
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Bestandsnummer des Verkäufers 1970001240-8-1
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Bestandsnummer des Verkäufers 00071840707
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: Textbooks_Source, Columbia, MO, USA
Verkäuferbewertung 5 von 5 Sternen
paperback. Zustand: New. 1st Edition. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Bestandsnummer des Verkäufers 002072261N
Anzahl: 8 verfügbar
Foto des Verkäufers
Verified Functional Programming in Agda
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 26386773-n
Anzahl: 2 verfügbar
Foto des Verkäufers
Verified Functional Programming in Agda
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 26386773
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: Best Price, Torrance, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. SUPER FAST SHIPPING. Bestandsnummer des Verkäufers 9781970001242
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3012140096466
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (ACM Books)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9781970001242
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Verified Functional Programming in Agda (Paperback)
Verlag:
Morgan & Claypool Publishers, San Rafael, 2016
ISBN 10: 1970001240
ISBN 13: 9781970001242
Neu
Paperback
Anbieter: Grand Eagle Retail, Mason, OH, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9781970001242
Anzahl: 1 verfügbar