# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1370339792 -3600
# Node ID 2a65056de0cbb72eebda0a821040b40862e9b8ca
# Parent  41d293f7ff0521b99e472047bd338771e9a0d228
updated

diff -r 41d293f7ff05 -r 2a65056de0cb publications.html
--- a/publications.html	Thu May 30 23:18:35 2013 +0100
+++ b/publications.html	Tue Jun 04 10:56:32 2013 +0100
@@ -37,7 +37,7 @@
 <TD BGCOLOR="#FFFFFF" 
     WIDTH="24%" 
     VALIGN="TOP" 
-    ROWSPAN="18">
+    ROWSPAN="19">
 
 <B>Links</B><BR>
 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">Home</A><BR>
@@ -93,11 +93,6 @@
       (with Zhang and Wu) Journal version. Submitted.
       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/pip.pdf">pdf</A>]
 
-<p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> 
-      (with Xu and Zhang) Accepted at ITP 2013.
-      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>]
-
-
 <p><B>How to Prove False using the Variable Convention.</B> 
      Appears as a poster at TTVSI, 1 page. 
      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
@@ -112,6 +107,18 @@
 
 <TR>
 <TD BGCOLOR="FFFFFF" WIDTH="75%">
+<H3>2013</H3>
+<p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> 
+      (with Xu and Zhang) In Proceedings of the 4th Conference on Interactive
+      Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in 
+      Computer Science. Pages 147-162.
+      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>]
+</TD>
+</TR>
+
+
+<TR>
+<TD BGCOLOR="FFFFFF" WIDTH="75%">
 <H3>2012</H3>
 <p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 
       (with Kaliszyk) Journal of Logical
diff -r 41d293f7ff05 -r 2a65056de0cb teaching.html
--- a/teaching.html	Thu May 30 23:18:35 2013 +0100
+++ b/teaching.html	Tue Jun 04 10:56:32 2013 +0100
@@ -89,10 +89,14 @@
 (the paper coming out of this work was presented at CADE)</li>
 <li><A HREF="http://www.lsv.ens-cachan.fr/~arnaud">Mathilde Arnaud</A> 
 (2007, ENS Cachan, France) Formalization of Generative Unbinding</li>
-<li>Akhil Junghare (2011-2012, King's) Lexing and Parsing using Derivatives</li>
-<li>Darius Hodaei (2011-2012, King's) A Compiler for System F</li>
-<li>Jian Jiang (2011-2012, King's) Suffix Array Sorting, 
+<li>Akhil Junghare (MSc 2011-2012, King's) Lexing and Parsing using Derivatives</li>
+<li>Darius Hodaei (MSc 2011-2012, King's) A Compiler for System F</li>
+<li>Jian Jiang (MSc 2011-2012, King's) Suffix Array Sorting, 
 received the prize of the best MSc thesis in 2012</li>
+<li>Mateusz Bieniek (BSc 2012-2013) X86 Code Generator for a small Compiler</li>
+<li>Daniel Zurawski (BSc 2012-2013) Lisp to JavaScript Translator in Clojure</li>
+<li>Biljana Naumova (BSc 2012-2013) Regular Expression Equivalence Checking using Asperti's Algorithm</li>
+<li>SpencerJevon (BSc 2012-2013) Automata Minimisation using Brzozowski's Algorithm</li>
 </ul>
 
 <p>Examiner of PhD-theses: