--- a/Nominal/users.html	Fri May 19 23:34:26 2023 +0100
+++ b/Nominal/users.html	Fri Jun 16 10:14:34 2023 +0100
@@ -68,9 +68,11 @@
 
 <ul>
 <li>
-<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>). 
+<A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A> (now professor at ITU in Copenhagen)   
+finished his PhD in 2010 with a large formalisation of the Psi-Calculus in Nominal Isabelle
+(see <a href="https://www.isa-afp.org/entries/Psi_Calculi.html">here</a>).
+The Psi-calculus is a parametric framework for reasoning about process calculi.
+He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>) using Nominal Isabelle. 
 </li>
 </ul>
 
@@ -167,96 +169,46 @@
 </P>
 
 
-<B>References</B><BR><BR>
-<CENTER>
-<TABLE>
-<TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>
-    <TD ALIGN=Left>
-    <B>Nominal Reasoning Techniques in Isabelle/HOL.</B>  In
-      Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008.
-      [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-tech.pdf" target="_top">pdf</A>].
-      The predecessor paper, which appeaerd at CADE in 2005, received the
-      <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>.
-    </TD>
-</TR>
-<TR><TD VALIGN=Top>[2]</TD>
-    <TD ALIGN=Left>
-    <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B> 
-    (Christian Urban and Michael Norrish) 
-    Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
-    Binding and Names (MERLIN 2005), Pages 25-32, 2005. &copy ACM, Inc.
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.ps" target="_top">ps</A>]
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.pdf" target="_top">pdf</A>]
-    </TD>
-</TR>
-<TR><TD VALIGN=Top>[3]</TD>
-    <TD ALIGN=Left>
-    <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B> 
-    (Christian Urban and Stefan Berghofer) 
-    Proceedings of the 3rd 
-    International Joint Conference on Automated Deduction (IJCAR 2006). In volume 4130 of 
-    Lecture Notes in Artificial Intelligence, Pages 498-512, 2006.
-    &copy <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/ijcar-06.ps" target="_top">ps</A>]
-    </TD>
-</TR>
+<H3>Entries in the Archive of Formal Proofs (AFP) using Nominal Isabelle</H3>
 
-<TR><TD VALIGN=Top>[4]</TD>
-    <TD ALIGN=Left>
-    <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> 
-    (Stefan Berghofer and Christian Urban) 
-    Proceedings of the International Workshop on Logical Frameworks and 
-    Meta-Languages: Theory and Practice (LFMTP 2006), ENTCS, Pages 53-67, 2006.
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lfmtp-06.ps" target="_top">ps</A>]
-    </TD>
-</TR>
+<ul>
+<li>
+<A HREF="https://www.cl.cam.ac.uk/~mpew2/">Mark Wassell</A>, Alasdair
+Armstrong, Neel Krishnaswami and Peter Sewell mechanised the
+Metatheory for the MiniSail ISA Specification Language using Nominal
+Isabelle. They needed Nominal Isabelle for handling binding.  The AFP
+entry
+is <a href="https://www.isa-afp.org/entries/MiniSail.html">here</a>.
+This work appeared in the Proceedings of the 48th International
+Symposium on Microarchitecture MICRO-48 (2015) and at the Automated
+Reasoning Workshop (ARW 2018).
 
-<TR><TD VALIGN=Top>[5]</TD>
-    <TD ALIGN=Left>
-    <B>Barendregt's Variable Convention in Rule Inductions.</B> (Christian
-    Urban, Stefan Berghofer and Michael Norrish) Proceedings of the 21th
-    Conference on Automated Deduction (CADE 2007). In volume 4603 of Lecture
-    Notes in Artificial Intelligence, Pages 35-50, 2007.
-    &copy <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm" 
-    target="_top">Springer Verlag</A> 
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/cade07.ps" target="_top">ps</A>]
-    </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[6]</TD>
-    <TD ALIGN=Left>
-    <B>Mechanising the Metatheory of LF.</B> 
-    (Christian Urban, James Cheney and Stefan Berghofer) 
-    In Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
-    Pages 45-56, 2008.
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lics-08.pdf">pdf</A>] More
-      information <A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/LF/index.html">elsewhere</A>.
-    </TD>
-</TR>
+<li>
+  <A HREF="https://www.andreipopescu.uk">Andrei Popescu</A> and
+  <A HREF="https://traytel.bitbucket.io/">Dmitriy Traytel</A>
+  gave a Formally Verified Abstract Account of Gödel's Incompleteness Theorems using Nominal Isabelle.
+  The AFP entries are
+  <a href="https://www.isa-afp.org/entries/Goedel_Incompleteness.html">here</a>,
+  <a href="https://www.isa-afp.org/entries/Goedel_HFSet_Semantic.html">here</a> and
+  <a href="https://www.isa-afp.org/entries/Goedel_HFSet_Semanticless.html">here</a>.
+  This work appeared in the Proceedings of the International Conference on Automated Deduction (CADE 2019).  
 
-<TR><TD VALIGN=Top>[7]</TD>
-    <TD ALIGN=Left>
-    <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> 
-    (Brian Huffman and Christian Urban) 
-    In Proc. of the 1st Conference on Interactive Theorem Proving (ITP 2010). In volume 6172 in 
-    Lecture Notes in Computer Science, Pages 35-50, 2010.
-    [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nominal-atoms.pdf">pdf</A>] 
-    </TD>
-</TR>
+<li>
+  <A HREF="https://www.isa-afp.org/authors/brun">Matthias Brun</A> and
+  <A HREF="https://traytel.bitbucket.io/">Dmitriy Traytel</A> formalised
+  Generic Authenticated Data Structures using Nominal Isabelle.
+  The AFP entry is <a href="https://www.isa-afp.org/entries/LambdaAuth.html">here</a>.
+  This work appeared in the Proceedings of International Conference on Interactive Theorem Proving (ITP 2019).
 
-<TR><TD VALIGN=Top>[8]</TD>
-    <TD ALIGN=Left>
-    <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 
-      (Christian Urban and Cezary Kaliszyk) 
-      In Proc. of the 20th European Symposium on Programming (ESOP 2011).
-      In Volume 6602 of Lecture Notes in Computer Science, Pages 480-500, 2011.
-      [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/esop-11.pdf">pdf</A>] (and a
-      longer version appeared in the Journal of Logical Methods in Computer 
-      Science, Volume 8 (2:14), 2012 
-      [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lmcs.pdf">pdf</A>])
-    </TD>
+<li>
+  <A HREF="https://www.isa-afp.org/authors/brun">Matthias Brun</A> and
+  <A HREF="https://traytel.bitbucket.io/">Dmitriy Traytel</A> formalised
+  Generic Authenticated Data Structures using Nominal Isabelle.
+  The AFP entry is <a href="https://www.isa-afp.org/entries/Modal_Logics_for_NTS.html">here</a>.
+  This work appeared in the Proceedings of the International Conference on Concurrency Theory (CONCUR 2015).  
+</ul>
+</P>
 
-</TR>
 
 
 

Binary file Publications/posix-jar.pdf has changed