Friedman, Daniel P., <br/><br/>
The little prover / 
Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More. 
 - 1 PDF (xiii, 229 pages). 
<br/><br/>Includes bibliographical references (p. 217-218) and index. 
<br/><br/> Restricted to subscribers or individual electronic text purchasers. 
<br/><br/>  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. 
<br/><br/>
<br/><br/><br/>Mode of access: World Wide Web 
<br/><br/><label>ISBN: </label>9780262330565 
<br/><br/><label>LCCN: </label>
<br/><br/><label>Subjects--Topical Terms: </label><br/>Automatic theorem proving.<br/>LISP (Computer program language)
<br/><br/><label>Index Terms--Genre/Form: </label><br/>Electronic books.
<br/><br/><label>LC Class. No.: </label>QA76.9.A96  / F745 2015eb 
<br/><br/><label>Dewey Class. No.: </label>511.3/6028563