Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Agda is a proof assistant, i.e. a computer program that can check mathematical proofs. More specifically, it is an interactive system for developing constructive proofs in a variant of Per Martin-Lof's Type Theory. It can also be seen as a functional programming language with dependent types and was developed by Ulf Norell, a post-doc at Chalmers University of Technology. Agda is based on the idea of direct manipulation of proof-term and not on tactics. The proof is a term, not a script. The language has ordinary programming constructs such as data-types and case-expressions, signatures and records, let-expressions and modules. The system has an Emacs interface and a graphical interface, Alfa.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.