# HG changeset patch
# User Christian Urban <christian.urban@kcl.ac.uk>
# Date 1679313668 0
# Node ID 5b12ae98430ccc946efe3e5cf1d749c3a56ef19a
# Parent  1ef1771f30d7b11a387b3f7ecb464ec3bd686420
updated

diff -r 1ef1771f30d7 -r 5b12ae98430c Nominal/users.html
--- a/Nominal/users.html	Mon Mar 20 11:53:13 2023 +0000
+++ b/Nominal/users.html	Mon Mar 20 12:01:08 2023 +0000
@@ -43,29 +43,8 @@
 </div>
 
 
-<H1>Our Vision</H1>
-
-<P>
-<IMG SRC="new.gif" ALT="" style="" align="left">
-<I>We are working on a major overhaul of Nominal Isabelle. The 
-latest bundles of Nominal2 are 
-<A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/download.html">here</A>. 
-</I></P>
-
+<H1>Users of Nominal Isabelle</H1>
 
-<P>
-To root out bugs, every programming language should be designed with the help
-of a theorem prover, and every compiler should be verified. With our work we
-aim to provide all proving technologies necessary for reasoning
-<B>conveniently</B> about programming languages (for example the <A
-HREF="http://en.wikipedia.org/wiki/Lambda_calculus" target="_top">lambda
-calculus</A>) and compilers. For us, formal proofs should be as easy to perform as informal
-"pencil-and-paper" proofs - at least the overhead of formal proofs should not
-prevent any formalisation.  Many ideas for our work come from the nominal
-logic work by <A HREF="http://www.cl.cam.ac.uk/~amp12/" target="_top">Andrew
-Pitts</A>.  Our theoretical results about nominal theories enabled us to
-implement Nominal Isabelle on top of Isabelle/HOL.
-</P>
 
 <P>
 If you want to see a simple example illustrating our results on Nominal Isabelle click
@@ -152,7 +131,7 @@
 <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>.
+of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>. (Archive of Formal Proofs)
 
 <li>
 <A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> 
@@ -167,18 +146,6 @@
 </ul>
 </P>
 
-<P>
-Note, however, that Nominal Isabelle is still an ongoing research
-project, which needs both theoretical and implementation work. You are
-encouraged to subscribe to the (moderated)
-<a href="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle" target="_top">
-mailing list</a> to hear about our progress and to give
-us feedback.</P> 
-
-<P>
-We have recently re-implemented the underlying nominal theory [7] and also have
-a good proposal for how to deal with general binding structures in Nominal Isabelle [8]. 
-</P><BR>
 
 <B>References</B><BR><BR>
 <CENTER>