The little prover / Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More.
By: Friedman, Daniel P [author.].
Contributor(s): Eastlund, Carl | IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type:
BookPublisher: Cambridge, Massachusetts : MIT Press, [2015]Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2015]Description: 1 PDF (xiii, 229 pages).Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262330565.Subject(s): Automatic theorem proving | LISP (Computer program language)Genre/Form: Electronic books.DDC classification: 511.3/6028563 Online resources: Abstract with links to resource Also available in print.Summary: The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example.
Includes bibliographical references (p. 217-218) and index.
Restricted to subscribers or individual electronic text purchasers.
The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example.
Also available in print.
Mode of access: World Wide Web
Description based on PDF viewed 12/24/2015.
There are no comments for this item.