--- a/Nominal/main.html	Mon Mar 20 11:48:07 2023 +0000
+++ b/Nominal/main.html	Mon Mar 20 11:53:13 2023 +0000
@@ -85,87 +85,6 @@
 establishing strong normalisation of cut-elimination in classical logic. Other
 people have used Nominal Isabelle too - see our list of users and projects
 <A HREF="users.html">here</A>
-
-<ul>
-<li>
-<A HREF="http://www.it.uu.se/katalog/jesperb/" target="_top">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
-for late and early operational semantics) available 
-<a href="http://afp.sourceforge.net/entries/Pi_Calculus.shtml">here</a>.  Moreover they formalised the proof
-that all late bisimilar processes are early bisimilar. The corresponding
-papers were presented at FOSSACS'07 and SOS'07. They also used Nominal Isabelle
-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. 
-
-<li>
-<A HREF="http://homepages.inf.ed.ac.uk/ldixon/" target="_top">Lucas Dixon</A>,
-Alan Smaill and <A HREF="http://homepages.inf.ed.ac.uk/bundy/"
-target="_top">Alan Bundy</A> used Nominal Isabelle to formalise
-proof terms of ILL and studied proof planning with this formalisation
-(EDI-INF-RR-0786). 
-
-<li>
-<A HREF="http://www.cs.swan.ac.uk/~csteme/" target="_top">Temesghen Kahsai</A>
-and <A HREF="http://users.dimi.uniud.it/~marino.miculan/" target="_top">Marino Miculan</A> formalised
-the spi-calculus using our work - see 
-<A HREF="http://www.cs.swan.ac.uk/~csteme/SpiInIsabelle/SpiInIsabelle.html" target="_top">here</A>.
-
-<li>
-Ayesha Yasmeen, a student of  
-<A HREF="http://www-faculty.cs.uiuc.edu/~egunter/" target="_top">Elsa Gunter</A>,
-formalised an extension of the ambient calculus using Nominal Isabelle. This
-was presented in the Emerging Trends section of TPHOLs'08. 
-
-<li>
-<A HREF="http://www.ps.uni-saarland.de/~doczkal/" target="_top">Christian Doczkal</A>,
-a student of <A HREF="http://www.ps.uni-saarland.de/~smolka/">Gert Smolka</A>, 
-finished in 2009 his 
-<A HREF="http://www.ps.uni-saarland.de/~doczkal/master/master.php" target="_top">master thesis</A> 
-at Saarbr&uuml;cken University using 
-Nominal Isabelle. He formalised the TT-lifting technique in order to prove 
-strong normalisation of Moggi's computational metalanguage. This is part of
-the <A HREF="http://afp.sourceforge.net/entries/Lam-ml-Normalization.shtml">AFP repository</A>.
-
-<li>
-Armin Heller finished his master thesis at the TU Munich in 2010 with a simple compiler verification
-using Nominal Isabelle.
-
-<li>
-<A HREF="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">James Cheney</A> 
-formalised a number of properties of the meta-theory of mini-XQuery in Nominal Isabelle.
-The plan is to extend this work to full XQuery. The preliminary results appeared at CPP'11.
-
-<li>
-<A HREF="http://cl-informatik.uibk.ac.at/users/cek/" target="_top">Cezary Kaliszyk</A> 
-with input from Henk Barendregt formalised the second fixed point theorem
-of the lambda calculus using Nominal Isabelle 2. This work appeared at CPP'11.
-
-<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>.
-
-<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.
-
-<li>
-<A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A>
-proved the correctness of a GHC compiler transformation using Nominal2.
-This work appeared at the
-<A HREF="https://www.haskell.org/haskell-symposium/2015/">Haskell Symposium 2015</A>.
-</ul>
 </P>
 
 <P>