Items related to Verified Functional Programming in Agda (ACM Books)
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
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.
"About this title" may belong to another edition of this title.
- PublisherACM Books
- Publication date2016
- ISBN 10 1970001240
- ISBN 13 9781970001242
- BindingPaperback
- LanguageEnglish
- Edition number1
- Number of pages284
Search results for Verified Functional Programming in Agda (ACM Books)
Stock Image
Verified Functional Programming in Agda (ACM Books)
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Fair. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 1970001240-7-1-10
Quantity: 1 available
Seller Image
Verified Functional Programming in Agda
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Seller Inventory # 26386773-5
Quantity: 1 available
Stock Image
Verified Functional Programming in Agda (ACM Books)
Published by
ACM Books, 2016
ISBN 10: 1970001240
ISBN 13: 9781970001242
Used
paperback
First Edition
Seller: Textbooks_Source, Columbia, MO, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 002072261U
Quantity: 1 available
Stock Image
Verified Functional Programming in Agda (ACM Books)
Seller: Textbooks_Source, Columbia, MO, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: New. 1st Edition. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 002072261N
Quantity: 8 available
Seller Image
Verified Functional Programming in Agda
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 26386773-n
Quantity: 2 available
Seller Image
Verified Functional Programming in Agda
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 26386773
Quantity: 2 available
Stock Image
Verified Functional Programming in Agda (ACM Books)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3012140096466
Quantity: Over 20 available
Stock Image
Verified Functional Programming in Agda
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9781970001242
Quantity: 15 available
Stock Image
Verified Functional Programming in Agda (ACM Books)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9781970001242
Quantity: Over 20 available
Stock Image
Verified Functional Programming in Agda (Paperback)
Published by
Morgan & Claypool Publishers, San Rafael, 2016
ISBN 10: 1970001240
ISBN 13: 9781970001242
New
Paperback
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781970001242
Quantity: 1 available