--- a/Nominal/users.html	Mon Mar 20 12:01:08 2023 +0000
+++ b/Nominal/users.html	Tue Apr 18 15:39:24 2023 +0100
@@ -64,9 +64,22 @@
 establishing strong normalisation of cut-elimination in classical logic. Other
 people have used Nominal Isabelle too:
 
+<H3>PhD Theses using Nominal Isabelle</H3>
+
 <ul>
 <li>
-<A HREF="http://www.it.uu.se/katalog/jesperb/" target="_top">Jesper Bengtson</A>
+<A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A> (now a professor at ITU in Copenhagen)   
+finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. 
+He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>). 
+</li>
+</ul>
+
+
+<H3>Journal and Conference Papers using Nominal Isabelle</H3>
+
+<ul>
+<li>
+<A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A>
 and <A HREF="http://user.it.uu.se/~joachim/" target="_top">Joachim Parrow</A>
 used Nominal Isabelle to verify the theory of the
 pi-calculus. They formalised the proof that bisimulation is a congruence (both
@@ -77,10 +90,10 @@
 to formalise their work on Psi-calculi, available 
 <a href="http://afp.sourceforge.net/entries/Psi_Calculi.shtml">here</a>. This was 
 presented at LICS 2009 and LICS 2010.
-Jesper finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. 
-He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>). 
+
 All formalisations are part of the <A HREF="http://afp.sourceforge.net/">AFP</A>.
 <li>
+  
 <A HREF="http://www.ccs.neu.edu/home/samth/" target="_top">Sam Tobin-Hochstadt</A>, a student
 of <A HREF="http://www.ccs.neu.edu/home/matthias/" target="_top">Matthias Felleisen</A>, used 
 Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08. 
@@ -131,12 +144,19 @@
 <li>
 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> 
 used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part
-of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>. (Archive of Formal Proofs)
+of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>. 
 
 <li>
 <A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> 
 formalised G&ouml;del's Incompletness Theorems using Nominal2. This work
-appeared in the Journal of Automated Reasoning in 2015.
+appeared in the Journal of Automated Reasoning in 2015 and is part of the
+<A HREF="https://www.isa-afp.org/browser_info/current/AFP/Incompleteness/SyntaxN.html">AFP</A>.
+
+<li>
+<A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> 
+formalised a second Part of G&ouml;del's Incompletness Theorems using Nominal2. This is part of the
+<A HREF="https://www.isa-afp.org/browser_info/current/AFP/Goedel_HFSet_Semanticless/SyntaxN.html">AFP</A>.
+
 
 <li>
 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A>

Binary file Publications/bitcoded-itp.pdf has changed

--- a/publications.html	Mon Mar 20 12:01:08 2023 +0000
+++ b/publications.html	Tue Apr 18 15:39:24 2023 +0100
@@ -72,7 +72,8 @@
 <TD BGCOLOR="#FFFFFF" WIDTH="75%">
 <H3>Pending</H3>
 <p><B>POSIX Lexing with Bitcoded Derivatives.</B>
-      (with Tan) 
+  (with Tan) Accepted at ITP'23.
+  [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/bitcoded-itp.pdf">pdf</A>]
 <p><B>POSIX Lexing with Derivatives of Regular Expressions.</B>
   Accepted in Journal of Automated Reasoning.
   [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/posix-jar.pdf">pdf</A>]