Research indexJournal article
Lambda, the ultimate TA
Pierce
ACM SIGPLAN Notices31 Aug 2009
NobleIDark:/48914/w1/20260524/A1628A49DOI10.1145/1631687.1596552
Lambda, the ultimate TA
Pierce · ACM SIGPLAN Notices · 2009 · Subscription
NobleIDark:/48914/w1/20260524/A1628A49DOI10.1145/1631687.1596552
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
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 sites: a one-semester graduate course in the theory of programming languages presented entirely - every lecture, every homework assignment - in Coq. 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 in developing it, and explain why I now believe such machine-assisted courses are the way of the future.