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 @@ -
-
-We are working on a major overhaul of Nominal Isabelle. The
-latest bundles of Nominal2 are
-here.
-
-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 -conveniently about programming languages (for example the lambda -calculus) 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 Andrew -Pitts. Our theoretical results about nominal theories enabled us to -implement Nominal Isabelle on top of Isabelle/HOL. -
If you want to see a simple example illustrating our results on Nominal Isabelle click @@ -152,7 +131,7 @@
-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) - -mailing list to hear about our progress and to give -us feedback.
- --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]. -