Automated proof checking in introductory discrete mathematics classes

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.