Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:lecture26 [2008/05/28 03:23] vkuncak |
sav08:lecture26 [2008/05/28 04:03] vkuncak |
||
---|---|---|---|
Line 27: | Line 27: | ||
* Peter B. Andrews: An Introduction to Mathematical Logic and Type theory: To Truth through Proof, Springer 2002 (Chapter 5: Type Theory) | * Peter B. Andrews: An Introduction to Mathematical Logic and Type theory: To Truth through Proof, Springer 2002 (Chapter 5: Type Theory) | ||
* [[http://imps.mcmaster.ca/doc/seven-virtues.pdf|The Seven Virtues of Simple Type Theory]] | * [[http://imps.mcmaster.ca/doc/seven-virtues.pdf|The Seven Virtues of Simple Type Theory]] | ||
+ | |||
===== LCF Theorem Proving Approach ===== | ===== LCF Theorem Proving Approach ===== | ||
+ | |||
+ | [[Approaches to Reliable Complex Proofs]] | ||
[[Immutable Abstract Data Types]] | [[Immutable Abstract Data Types]] | ||
Line 45: | Line 48: | ||
===== Interactive Prover Overview ===== | ===== Interactive Prover Overview ===== | ||
- | HOL | + | HOL, Isabelle |
- | + | ||
- | PVS | + | |
- | + | ||
- | Isabelle | + | |
- | Coq | + | PVS - decision procedures |
- | ACL2 | + | Coq, NuPRL - more complex type theory, constructive mathematics |
- | NuPRL | + | ACL2 - emphasis on executable functions, quantifier-free statements, automated induction, pioneering industrial-scale case studies |