LEADER 02956nam 2200601 450 001 9910797359703321 005 20230125211917.0 010 $a0-262-33057-1 010 $a0-262-33056-3 035 $a(CKB)3710000000448907 035 $a(EBL)3433792 035 $a(SSID)ssj0001519541 035 $a(PQKBManifestationID)12629925 035 $a(PQKBTitleCode)TC0001519541 035 $a(PQKBWorkID)11521505 035 $a(PQKB)10474939 035 $a(MiAaPQ)EBC3433792 035 $a(CaBNVSL)mat07176537 035 $a(IDAMS)0b0000648494ca79 035 $a(IEEE)7176537 035 $a(Au-PeEL)EBL3433792 035 $a(CaPaEBR)ebr11080237 035 $a(OCoLC)914255579 035 $a(EXLCZ)993710000000448907 100 $a20151224d2015 uy 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe little prover /$fDaniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More 210 1$aCambridge, Massachusetts :$cMIT Press,$d[2015] 210 2$a[Piscataqay, New Jersey] :$cIEEE Xplore,$d[2015] 215 $a1 online resource (244 p.) 300 $aDescription based upon print version of record. 311 $a0-262-52795-2 320 $aIncludes bibliographical references and index. 327 $aIntro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index 330 $a 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. 606 $aAutomatic theorem proving 606 $aLISP (Computer program language) 615 0$aAutomatic theorem proving. 615 0$aLISP (Computer program language) 676 $a511.3/6028563 700 $aFriedman$b Daniel P.$025878 701 $aEastlund$b Carl$01499455 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910797359703321 996 $aThe little prover$93725493 997 $aUNINA