--- a/index.html	Mon Oct 31 00:56:41 2011 +0000
+++ b/index.html	Tue Nov 01 11:00:07 2011 +0000
@@ -54,8 +54,20 @@
 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A>
 <BR><BR>
 
+<table border="0">
+<tr>
+<td>
 <A HREF="http://isabelle.in.tum.de/nominal/">
 <IMG SRC="nominal-logo.gif" ALT="" style="border-width: 0px;" align="left"></A>
+</td>
+</tr>
+<tr>
+<td>
+<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Cookbook/">
+<IMG SRC="Cookbook/logo-documentation.gif" ALT="" style="border-width: 0px;" align="left"></A>
+</td>
+</tr>
+</table>
 </TD>
 
 
@@ -184,7 +196,7 @@
 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that
 formalisations of automata theory are a huge 
 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> 
-in theorem provers, especially in those that are HOL-based. 
+in theorem provers, especially in those that are based on HOL. 
 We therefore went against the 
 <A HREF="http://books.google.com/books?id=8lKyxS8_CNoC&amp;pg=PA14&amp;source=gbs_toc_r&amp;cad=4#v=onepage&amp;q&amp;f=false">mainstream</A> 
 and used in our formalisation regular expressions exclusively,
@@ -278,7 +290,7 @@
 </TABLE>
 <P><!-- Created: Tue Mar  4 00:23:25 GMT 1997 -->
 <!-- hhmts start -->
-Last modified: Mon Oct 31 00:56:27 GMT 2011
+Last modified: Tue Nov  1 10:59:41 GMT 2011
 <!-- hhmts end -->
 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>