Abstract
Ambitious experiments using proof assistants for programming language research and teaching are all the rage. In this talk, I’ll report on one now underway at the University of Pennsylvania and several other places: a one-semester graduate course in the theory of programming languages presented entirely—every lecture, every homework assignment—in Coq. This course is now in its third iteration, the course materials are becoming fairly mature, and we’ve got quite a bit of experience with what works and what doesn’t. I’ll try to give a sense of what the course is like for both instructors and students, describe some of the most interesting challenges, and explain why I now believe such machine-assisted courses are the way of the future.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pierce, B.C. (2010). Proof Assistants as Teaching Assistants: A View from the Trenches. In: Kaufmann, M., Paulson, L.C. (eds) Interactive Theorem Proving. ITP 2010. Lecture Notes in Computer Science, vol 6172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14052-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-14052-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14051-8
Online ISBN: 978-3-642-14052-5
eBook Packages: Computer ScienceComputer Science (R0)