Published by ACM Books (edition ), 2016
ISBN 10: 1970001240 ISBN 13: 9781970001242
Language: English
Seller: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condition: Fair. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.
Condition: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.
Condition: New.
Seller: Textbooks_Source, Columbia, MO, U.S.A.
First Edition
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).
Condition: As New. Unread book in perfect condition.
US$ 85.37
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 88.25
Convert currencyQuantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Condition: New.
Published by Morgan & Claypool Publishers, San Rafael, 2016
ISBN 10: 1970001240 ISBN 13: 9781970001242
Language: English
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
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.
Published by Morgan & Claypool Publishers, 2016
ISBN 10: 1970001240 ISBN 13: 9781970001242
Language: English
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
US$ 93.72
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 88.23
Convert currencyQuantity: 2 available
Add to basketCondition: New.
US$ 107.21
Convert currencyQuantity: 15 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
US$ 103.33
Convert currencyQuantity: 3 available
Add to basketCondition: New. pp. 284.
US$ 94.52
Convert currencyQuantity: 2 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 102.12
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
US$ 111.36
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Condition: New. pp. 284.
Published by Morgan & Claypool Publishers, 2016
ISBN 10: 1970001240 ISBN 13: 9781970001242
Language: English
Seller: Kennys Bookstore, Olney, MD, U.S.A.
US$ 108.18
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 116.86
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Morgan & Claypool Publishers, 2016
ISBN 10: 1970001240 ISBN 13: 9781970001242
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 111.01
Convert currencyQuantity: Over 20 available
Add to basketPaperback / softback. Condition: New. New copy - Usually dispatched within 4 working days. 540.
Published by Morgan & Claypool Publishers, 2016
ISBN 10: 1970001275 ISBN 13: 9781970001273
Language: English
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
US$ 114.96
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. 2016. hardcover. . . . . .
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 124.45
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
US$ 127.80
Convert currencyQuantity: 3 available
Add to basketCondition: New. pp. 284.
US$ 121.84
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Revaluation Books, Exeter, United Kingdom
US$ 131.11
Convert currencyQuantity: 2 available
Add to basketPaperback. Condition: Brand New. 283 pages. 9.25x7.50x0.90 inches. In Stock.
Condition: New. pp. 284.
Published by Morgan & Claypool Publishers, 2016
ISBN 10: 1970001275 ISBN 13: 9781970001273
Language: English
Seller: Kennys Bookstore, Olney, MD, U.S.A.
US$ 134.53
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. 2016. hardcover. . . . . . Books ship from the US and Ireland.
Published by Morgan & Claypool Publishers, 2016
ISBN 10: 1970001275 ISBN 13: 9781970001273
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 135.15
Convert currencyQuantity: Over 20 available
Add to basketHardback. Condition: New. New copy - Usually dispatched within 4 working days. 633.
Published by Morgan and Claypool Publishers, US, 2016
ISBN 10: 1970001240 ISBN 13: 9781970001242
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
US$ 147.50
Convert currencyQuantity: Over 20 available
Add to basketPaperback. Condition: New. 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.
US$ 180.68
Convert currencyQuantity: 2 available
Add to basketHardcover. Condition: Brand New. 283 pages. 9.25x7.50x0.90 inches. In Stock.