LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
sav08:lecture26 [2008/05/28 06:07]
vkuncak
sav08:lecture26 [2008/11/14 20:39]
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 =====
Line 40: Line 37:
  
 [[Proof and Code Generation in LCF Systems]] [[Proof and Code Generation in LCF Systems]]
 +
 +[[http://​afp.sourceforge.net/​entries/​BinarySearchTree.shtml|Binary Search Trees Example]]
  
 Further reading: Further reading:
Line 63: Line 62:
 [[http://​www.cs.utexas.edu/​~moore/​acl2/​|ACL2]] - emphasis on executable functions, quantifier-free statements, automated induction, pioneering industrial-scale case studies [[http://​www.cs.utexas.edu/​~moore/​acl2/​|ACL2]] - emphasis on executable functions, quantifier-free statements, automated induction, pioneering industrial-scale case studies
  
 +===== Example Results in Isabell =====
 +
 +<​code>​NipkowETAL06FlyspeckI,​
 +Paulson03ConsistencyAxiomChoiceIsabelle,​
 +PaulsonGrabczewski96MechanizingSetTheory,​
 +Berghofer07FirstOrderLogicAccordingtoFitting
 +</​code>​