E-raamat: Verified Functional Programming in Agda

(University of Iowa)
  • Formaat: 283 pages, colour illustrations
  • Sari: ACM Books
  • Ilmumisaeg: 01-Feb-2016
  • Kirjastus: Morgan & Claypool Publishers
  • ISBN-13: 9781970001259
  • Formaat: 283 pages, colour illustrations
  • Sari: ACM Books
  • Ilmumisaeg: 01-Feb-2016
  • Kirjastus: Morgan & Claypool Publishers
  • ISBN-13: 9781970001259

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    E-raamatu lugemiseks on vaja luua Adobe ID ning laadida arvutisse Adobe Digital Editions. Lähemalt siit. E-raamatut saab lugeda ning alla laadida kuni 6'de seadmesse.
    E-raamatut ei saa lugeda Amazon Kindle's. Ülejäänud meie e-poes pakutavad e-lugerid võimaldavad lugeda Adobe ID-ga kaitstud e-raamatuid.

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. Exercises are provided at the end of each chapter.
Aaron Stump is a professor of Computer Science at The University of Iowa, USA. 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. Aaron is co-director with Cesare Tinelli of the University of Iowa Computational Logic Center, and he leads StarExec, a cross-community logic solving web service. He is the author of the textbook Programming Language Foundations (2013). Aaron was the best paper award winner in 2011 at the The 22nd International Conference on Term Rewriting and Applications (RTA), and winner also of the Haifa Verification Conference Award, 2010, with co-awardees Clark Barrett, Leonardo da Moura, Silvio Ranise, and Cesare Tinelli, Aaron was winner of a National Science Foundation Young Investigator award.