Automated proof checking in introductory discrete mathematics classes
Name
870532303-MIT.pdf
Description
Full printable version
Size
2.12 MB
Format
Adobe PDF
Checksum (MD5)
23a4382adce1d88aed385f00a0946fb6
Author(s)
Haven, Andrew J
Advisor(s)
Adam Chlipala.
Date Issued
2013
Publisher
Massachusetts Institute of Technology
Abstract
Mathematical rigor is an essential concept to learn in the study of computer science. In the process of learning to write math proofs, instructors are heavily involved in giving feedback about correct and incorrect proofs. Computerized feedback in this area can ease the burden on instructors and help students learn more efficiently. Several software packages exist that can verify proofs written in specific programming languages; these tools have support for some basic topics that undergraduates learn, but not all. In this thesis, we develop libraries and proof automation for introductory combinatorics and probability concepts using Coq, an interactive theorem proving language.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (page 61).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
