Vai al contenuto principale della pagina
Autore: | Friedman Daniel P. |
Titolo: | The little prover / / Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More |
Pubblicazione: | Cambridge, Massachusetts : , : MIT Press, , [2015] |
[Piscataqay, New Jersey] : , : IEEE Xplore, , [2015] | |
Descrizione fisica: | 1 online resource (244 p.) |
Disciplina: | 511.3/6028563 |
Soggetto topico: | Automatic theorem proving |
LISP (Computer program language) | |
Altri autori: | EastlundCarl |
Note generali: | Description based upon print version of record. |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Intro; 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 |
Sommario/riassunto: | 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. |
Titolo autorizzato: | The little prover |
ISBN: | 0-262-33057-1 |
0-262-33056-3 | |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910797359703321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |