Gig Book News

Verified Functional Programming in Agda



PDF, ebook, epub (ePub, fb2, mobi)

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.


Programming Language Foundations in Agda by Wen Kokke and Phil Wadler. Verified Functional Programming in Agda English Edition eBook Stump Aaron Amazon.es Tienda Kindle. The Verified Functional Programming in Agda book is published. What I like about working in Agda is proofs are verified by the compiler.


Agda

Download Citation Verified Functional Programming in Agda Agda is an advanced programming language based on Type Theory. Verified Functional Programming in Agda is the best Agda resource available but studying Idris via Typedriven Development with Idris will net you very transferable insights. For more on writing termination proofs I recommend a book Verified Functional Programming in Agda by Aaron Stump and in particular its chapter 9 on formalising deductive systems. Verified Functional Programming in Agda. OPTIONSwithoutKexactsplitsafe module Naturals where. Agda and Idris are both dependentlytyped programming languages with very similar semantics but quite different syntaxes. Verified Functional Programming in Agda by covers related ground but focuses more on programming with dependent types than on the theory of programming languages. Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda suitable for undergraduate . 14.9k members in the functionalprogramming community. Agda is an advanced programming language based on Type Theory. Best Sellers Gift Ideas Prime New Releases. Account Lists Account Returns Orders. Verified Functional Programming in Agda by Aaron Stump and Publisher ACM Books.


Darmowe książki audio Verified Functional Programming in Agda PDF. E-booki publikują twoją książkę .



Gig Book News Links


Contact Email