diff -r 5b12ae98430c -r d09365eee0e3 Nominal/users.html
--- 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:
+PhD Theses using Nominal Isabelle
+
-
-Jesper Bengtson
+Jesper Bengtson (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 (here).
+
+
+
+
+Journal and Conference Papers using Nominal Isabelle
+
+
+-
+Jesper Bengtson
and Joachim Parrow
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
here. 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 (here).
+
All formalisations are part of the AFP.
-
+
Sam Tobin-Hochstadt, a student
of Matthias Felleisen, used
Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08.
@@ -131,12 +144,19 @@
-
Joachim Breitner
used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part
-of the AFP. (Archive of Formal Proofs)
+of the AFP.
-
Larry Paulson
formalised Gö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
+AFP.
+
+
-
+Larry Paulson
+formalised a second Part of Gödel's Incompletness Theorems using Nominal2. This is part of the
+AFP.
+
-
Joachim Breitner