2016/11/29 by Prabhakar Ragde
Computer Science · #cs.PL #cs.LO
paper · pdf · doi:10.4204/eptcs.230.5
published as EPTCS 230, 2016, pp. 63-75 · In Proceedings TFPIE 2015/6, arXiv:1611.08651
arxiv created 2016/11/29 · arxiv updated 2016/11/30
Proust is a small Racket program offering rudimentary interactive assistance in the development of verified proofs for propositional and predicate logic. It is constructed in stages, some of which are done by students before using it to complete proof exercises, and in parallel with the study of its theoretical underpinnings, including elements of Martin-Lof type theory. The goal is twofold: to demystify some of the machinery behind full-featured proof assistants such as Coq and Agda, and to better integrate the study of formal logic with other core elements of an undergraduate computer science curriculum.