diff -r eb530e39145d -r bc23b95d3b2d Nominal/users.html
--- a/Nominal/users.html Sun Jul 09 08:56:24 2023 +0100
+++ b/Nominal/users.html Mon Jul 24 09:46:42 2023 +0100
@@ -165,23 +165,20 @@
proved the correctness of a GHC compiler transformation using Nominal2.
This work appeared at the
Haskell Symposium 2015.
-
-
-
-Entries in the Archive of Formal Proofs (AFP) using Nominal Isabelle
-
-
-
-Mark Wassell, 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 here.
-This work appeared in the Proceedings of the 48th International
-Symposium on Microarchitecture MICRO-48 (2015) and at the Automated
-Reasoning Workshop (ARW 2018).
+ Matthias Brun and
+ Dmitriy Traytel formalised
+ Generic Authenticated Data Structures using Nominal Isabelle.
+ The AFP entry is here.
+ This work appeared in the Proceedings of the International Conference on Concurrency Theory (CONCUR 2015).
+
+
-
+ Tjark Weber et al formalise a uniform
+ semantic substrate for a wide variety of process calculi where states and action labels can be from
+ arbitrary nominal sets. This includes a Hennessy-Milner logic for these systems.
+ The AFP entry is here.
+ This work appeared in the Proceedings of the International Conference on Concurrency Theory (CONCUR 2015).
-
Andrei Popescu and
@@ -200,17 +197,67 @@
The AFP entry is here.
This work appeared in the Proceedings of International Conference on Interactive Theorem Proving (ITP 2019).
+
-
- Matthias Brun and
- Dmitriy Traytel formalised
- Generic Authenticated Data Structures using Nominal Isabelle.
- The AFP entry is here.
- This work appeared in the Proceedings of the International Conference on Concurrency Theory (CONCUR 2015).
+ Andrei Popescu and
+ Dmitriy Traytel
+ formalise Robinson Arithmetic. This includes unary term-for-var substitution for two syntactic
+ categories (terms and formulas) and proves 15 delicate theorems: compositionality of substitution
+ w.r.t. itself, freshness, constructors. The AFP entry is
+ here.
+ This work appeared in the Proceedings of the International Conference on Automated Deduction (CADE 2019).
+
+Entries in the Archive of Formal Proofs (AFP) using Nominal Isabelle
+
+-
+Joachim Breitner
+proved the correctness of a GHC compiler transformation using Nominal2.
+The AFP
+entry
+is here.
+This work appeared at the
+Haskell Symposium 2015.
+
+
+
-
+Mark Wassell, 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 here.
+This work appeared in the Proceedings of the 48th International
+Symposium on Microarchitecture MICRO-48 (2015) and at the Automated
+Reasoning Workshop (ARW 2018).
+
+
+
-
+ Bertram Felgenhauer et al formalise the
+ Z property introduced by Dehornoy and van Oostrom using Nominal 2.
+ The AFP entry is here.
+
+
+
+
+
+
+
+Entries in the Archive of Formal that had to work around the current limitations of Nominal
+
+
+-
+Bertram Felgenhauer
+formalised a higher-order term algebra, generalizing the notions of free variables, matching, and substitution.
+The Nominal framework provides support for reasoning over fresh names, but unfortunately,
+its definitions are not executable. The AFP entry
+is here.
+
+