I'm going over the course notes at CIS 500: Software Foundations and the exercises are a lot of fun. I'm only at the third exercise set but I would like to know more about what's happening when I use tactics to prove things like forall (n m : nat), n + n = m + m -> n = m.
$\begingroup$
$\endgroup$
Add a comment
|
4 Answers
$\begingroup$
$\endgroup$
3
One place to start is the Coq reference manual (pdf). Chapter 4 describes the underlying logic of Coq, and ultimately everything is based on this. It's called the calculus of (co)inductive constructions, and many papers describe. Getting your hands on the Coq'Art book Interactive Theorem Proving and Program Development provides a more leisurely but not cheap introduction to Coq.
To learn about how tactics work, have a look at this earlier question: How do 'tactics' work in proof assistants?
To build up the required theory, you need to learn about Type Theory. Most closely related to the theory underlying a proof assistant is probably Per Martin-Löf's Intutionistic Type Theory notes (or book) or the book Programming in Martin-Löf Type Theory, which is really about writing and proving theorems in type theory. A programming language perspective on type theory can be obtained from Pierce's Types and Programming Languages. Girard et al's Proofs and Types, which also addresses the importance of the Curry-Howard Correspondence, is another excellent reference. Then you are probably well and truly ready to read Coquand and Huet's The Calculus of Constructions. Finally chase up some of the references in the back of the Coq manual.
There are other proof assistants, HOL, NuPRL, Mizar, Twelf, etc., and they have their theory too, so you can learn a lot too by reading in that direction.
Finally, for an overview of the history and future of proof assistants, check out the recent article by Herman Geuvers.
answered Apr 3, 2011 at 8:43
-
5$\begingroup$ Nice list. I'll add a reading order. Pierce's TAPL covers the background; most of the rest won't make sense until you get fluent with typing rules. Chapter 2 of ATTAPL introduces dependent types relatively gently. Then you can read chapter 4 of the Coq manual, which has the typing rules (you need to check the bibliography for some advanced stuff such as the exact rules for recursion). In parallel, the Coq'Art book has a more practical outlook. Bonus tip:
Show Treein coq. $\endgroup$ Apr 3, 2011 at 13:34 -
2$\begingroup$ I am someone in more or less the same position as the OP though a bit further along. After some experimenting, I finally found the order 1) Learn functional programming 2) read TAPL 3) Read about dependent types in ATTAPL to work better than other things. Glad to know I am on approximately the right path. $\endgroup$ Apr 13, 2011 at 19:08
-
1$\begingroup$ I was here too, and got the Coq'Art book. It is absolutely perfect for understanding, they go into every tactic in detail and explain when and how to use it. The book also guides you quickly through every base rule in type theory, teaching you notation and how to use it in Coq. Loving this book. $\endgroup$– LanceJul 19, 2015 at 16:39
$\begingroup$
$\endgroup$
2
As for typed lambda calculus, intuitionistic logic, various proof systems and Curry-Howard isomorphism, which are all parts of Coq mathematical background, I strongly recommend "Lectures on the Curry-Howard Isomorphism"(by P. Urzyczyn and M. Sørensen).
-
-
$\begingroup$ It seems to be the Curry-Howard day: cstheory.stackexchange.com/questions/5848/… $\endgroup$ Apr 3, 2011 at 18:29
$\begingroup$
$\endgroup$
Luo's book on the Extended Calculus of Constructions is also a good reference. ECC was quite influential in the design of Coq's type theory.
$\begingroup$
$\endgroup$
The current Software Foundations book does explain all this later on: https://softwarefoundations.cis.upenn.edu/lf-current/ProofObjects.html
So if you're following the book, just read on :)
