Automated proof checking in introductory discrete mathematics classes

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2013

Author dc:creator

• Haven, Andrew J

Advisor dc:contributor.advisor

• Adam Chlipala.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/85424

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/85424