This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
references [2011/05/12 23:26] 131.246.229.97 |
references [2011/05/18 23:44] 78.51.52.3 |
||
---|---|---|---|
Line 10: | Line 10: | ||
* Presentation of Sheet 2 can be found [[https://docs.google.com/present/view?id=dhqv6v76_94dghtz9ct&interval=60|here]]. | * Presentation of Sheet 2 can be found [[https://docs.google.com/present/view?id=dhqv6v76_94dghtz9ct&interval=60|here]]. | ||
+ | * Presentation of Sheet 4 can be found [[https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B8eH3X88xuy4N2NiMzY0ODktZjg1MS00YzEyLWExYzgtYmZjNjM3YmYyNmY3&hl=de&authkey=CJjn1YoM|here]] | ||
+ | * [[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.5.3152&rep=rep1&type=pdf|"Executing Higher Order Logics"]] is a paper making an overview of how to write functions on Isabelle/HOL and some performance issues. Good about it is that it has some code and goes over some concepts that we've seen in the lectures/tutorials | ||
+ | * [[http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-09.pdf|Defining a non-concrete recursive type in HOL which includes sets]] is a report that at the beginning has some complementary information about type definition in HOL. Then it's just a bunch of theorems I didn't went through. |