2026-09-19T11:18:21Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/854242026-06-06T00:49:31Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Adam Chlipala.
Haven, Andrew J
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2014-03-06T15:41:02Z
2014-03-06T15:41:02Z
2013
2013
http://hdl.handle.net/1721.1/85424
870532303
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).
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.
by Andrew J. Haven.
M.Eng.
61 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Automated proof checking in introductory discrete mathematics classes
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4d77aadb-564d-4455-bfe1-c171fb9943f8">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Automated proof checking in introductory discrete mathematics classes</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2013</PublicationDate>
<Authors>
<Author>
<DisplayName>Haven, Andrew J</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>