Andere Kunden interessierten sich auch für
![The Secret Life of Programs]( "The Secret Life of Programs")
The Secret Life of Programs29,99 €![The Missing README]( "The Missing README")
The Missing README16,99 €![Introduction to Algorithms]( "Introduction to Algorithms")
Introduction to Algorithms123,99 €![Algorithmic Thinking]( "Algorithmic Thinking")
Algorithmic Thinking30,99 €![The Elements of Computing Systems]( "The Elements of Computing Systems")
The Elements of Computing Systems46,80 €![Python One-Liners]( "Python One-Liners")
Python One-Liners25,99 €![Fundamentals of Machine Learning for Predictive Data Analytics]( "Fundamentals of Machine Learning for Predictive Data Analytics")
Fundamentals of Machine Learning for Predictive Data Analytics84,99 €
An introduction to writing proofs about computer programs, written in an accessible question-and-answer style, complete with step-by-step examples and a simple proof assistant.
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.
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.