Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav08:lecture26 [2008/05/28 04:03] vkuncak |
sav08:lecture26 [2008/05/28 05:11] vkuncak |
||
|---|---|---|---|
| Line 34: | Line 34: | ||
| [[Immutable Abstract Data Types]] | [[Immutable Abstract Data Types]] | ||
| - | |||
| - | [[Consequence of Type Safety and Abstraction]] | ||
| [[Theorems as Abstract Data Types]] | [[Theorems as Abstract Data Types]] | ||
| [[Concrete Example in Scala]] | [[Concrete Example in Scala]] | ||
| + | |||
| + | [[Proof Generation and Proving Provers within LCF]] | ||
| Further reading: | Further reading: | ||
| - | * [[http://doi.acm.org/10.1145/512760.512773|A Metalanguage for interactive proof in LCF]] | + | * [[http://doi.acm.org/10.1145/512760.512773|A Metalanguage for interactive proof in LCF]] - ML stands for meta-Language, because it was a language for writing theorem provers that prove theorems (in object-language i.e. logic of computable functions) |
| * [[http://www.cl.cam.ac.uk/~jrh13/hol-light/index.html|HOL Light]] | * [[http://www.cl.cam.ac.uk/~jrh13/hol-light/index.html|HOL Light]] | ||
| * Upcoming book "Introduction to Logic and Automated Theorem Proving" by John Harrison | * Upcoming book "Introduction to Logic and Automated Theorem Proving" by John Harrison | ||
| + | * Logic and Computation: Interactive Proof with Cambridge LCF | ||
| - | ===== Interactive Prover Overview ===== | + | ===== Overview of Interactive Provers ===== |
| HOL, Isabelle | HOL, Isabelle | ||