71 <A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A> (now a professor at ITU in Copenhagen)   

    71 <A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A> (now professor at ITU in Copenhagen)   

    72 finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. 

    72 finished his PhD in 2010 with a large formalisation of the Psi-Calculus in Nominal Isabelle

    73 He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>). 

    73 (see <a href="https://www.isa-afp.org/entries/Psi_Calculi.html">here</a>).

    74 The Psi-calculus is a parametric framework for reasoning about process calculi.

    75 He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>) using Nominal Isabelle. 

   170 <B>References</B><BR><BR>

   172 <H3>Entries in the Archive of Formal Proofs (AFP) using Nominal Isabelle</H3>

   171 <CENTER>

   173 

   172 <TABLE>

   174 <ul>

   173 <TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>

   175 <li>

   174     <TD ALIGN=Left>

   176 <A HREF="https://www.cl.cam.ac.uk/~mpew2/">Mark Wassell</A>, Alasdair

   175     <B>Nominal Reasoning Techniques in Isabelle/HOL.</B>  In

   177 Armstrong, Neel Krishnaswami and Peter Sewell mechanised the

   176       Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008.

   178 Metatheory for the MiniSail ISA Specification Language using Nominal

   177       [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-tech.pdf" target="_top">pdf</A>].

   179 Isabelle. They needed Nominal Isabelle for handling binding.  The AFP

   178       The predecessor paper, which appeaerd at CADE in 2005, received the

   180 entry

   179       <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>.

   181 is <a href="https://www.isa-afp.org/entries/MiniSail.html">here</a>.

   180     </TD>

   182 This work appeared in the Proceedings of the 48th International

   181 </TR>

   183 Symposium on Microarchitecture MICRO-48 (2015) and at the Automated

   182 <TR><TD VALIGN=Top>[2]</TD>

   184 Reasoning Workshop (ARW 2018).

   183     <TD ALIGN=Left>

   185 

   184     <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B> 

   186 <li>

   185     (Christian Urban and Michael Norrish) 

   187   <A HREF="https://www.andreipopescu.uk">Andrei Popescu</A> and

   186     Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable

   188   <A HREF="https://traytel.bitbucket.io/">Dmitriy Traytel</A>

   187     Binding and Names (MERLIN 2005), Pages 25-32, 2005. &copy ACM, Inc.

   189   gave a Formally Verified Abstract Account of Gödel's Incompleteness Theorems using Nominal Isabelle.

   188     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.ps" target="_top">ps</A>]

   190   The AFP entries are

   189     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.pdf" target="_top">pdf</A>]

   191   <a href="https://www.isa-afp.org/entries/Goedel_Incompleteness.html">here</a>,

   190     </TD>

   192   <a href="https://www.isa-afp.org/entries/Goedel_HFSet_Semantic.html">here</a> and

   191 </TR>

   193   <a href="https://www.isa-afp.org/entries/Goedel_HFSet_Semanticless.html">here</a>.

   192 <TR><TD VALIGN=Top>[3]</TD>

   194   This work appeared in the Proceedings of the International Conference on Automated Deduction (CADE 2019).  

   193     <TD ALIGN=Left>

   195 

   194     <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B> 

   196 <li>

   195     (Christian Urban and Stefan Berghofer) 

   197   <A HREF="https://www.isa-afp.org/authors/brun">Matthias Brun</A> and

   196     Proceedings of the 3rd 

   198   <A HREF="https://traytel.bitbucket.io/">Dmitriy Traytel</A> formalised

   197     International Joint Conference on Automated Deduction (IJCAR 2006). In volume 4130 of 

   199   Generic Authenticated Data Structures using Nominal Isabelle.

   198     Lecture Notes in Artificial Intelligence, Pages 498-512, 2006.

   200   The AFP entry is <a href="https://www.isa-afp.org/entries/LambdaAuth.html">here</a>.

   199     &copy <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>

   201   This work appeared in the Proceedings of International Conference on Interactive Theorem Proving (ITP 2019).

   200     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/ijcar-06.ps" target="_top">ps</A>]

   202 

   201     </TD>

   203 <li>

   202 </TR>

   204   <A HREF="https://www.isa-afp.org/authors/brun">Matthias Brun</A> and

   203 

   205   <A HREF="https://traytel.bitbucket.io/">Dmitriy Traytel</A> formalised

   204 <TR><TD VALIGN=Top>[4]</TD>

   206   Generic Authenticated Data Structures using Nominal Isabelle.

   205     <TD ALIGN=Left>

   207   The AFP entry is <a href="https://www.isa-afp.org/entries/Modal_Logics_for_NTS.html">here</a>.

   206     <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> 

   208   This work appeared in the Proceedings of the International Conference on Concurrency Theory (CONCUR 2015).  

   207     (Stefan Berghofer and Christian Urban) 

   209 </ul>

   208     Proceedings of the International Workshop on Logical Frameworks and 

   210 </P>

   209     Meta-Languages: Theory and Practice (LFMTP 2006), ENTCS, Pages 53-67, 2006.

   211 

   210     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lfmtp-06.ps" target="_top">ps</A>]

   211     </TD>

   212 </TR>

   213 

   214 <TR><TD VALIGN=Top>[5]</TD>

   215     <TD ALIGN=Left>

   216     <B>Barendregt's Variable Convention in Rule Inductions.</B> (Christian

   217     Urban, Stefan Berghofer and Michael Norrish) Proceedings of the 21th

   218     Conference on Automated Deduction (CADE 2007). In volume 4603 of Lecture

   219     Notes in Artificial Intelligence, Pages 35-50, 2007.

   220     &copy <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm" 

   221     target="_top">Springer Verlag</A> 

   222     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/cade07.ps" target="_top">ps</A>]

   223     </TD>

   224 </TR>

   225 

   226 <TR><TD VALIGN=Top>[6]</TD>

   227     <TD ALIGN=Left>

   228     <B>Mechanising the Metatheory of LF.</B> 

   229     (Christian Urban, James Cheney and Stefan Berghofer) 

   230     In Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,

   231     Pages 45-56, 2008.

   232     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lics-08.pdf">pdf</A>] More

   233       information <A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/LF/index.html">elsewhere</A>.

   234     </TD>

   235 </TR>

   236 

   237 <TR><TD VALIGN=Top>[7]</TD>

   238     <TD ALIGN=Left>

   239     <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> 

   240     (Brian Huffman and Christian Urban) 

   241     In Proc. of the 1st Conference on Interactive Theorem Proving (ITP 2010). In volume 6172 in 

   242     Lecture Notes in Computer Science, Pages 35-50, 2010.

   243     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nominal-atoms.pdf">pdf</A>] 

   244     </TD>

   245 </TR>

   246 

   247 <TR><TD VALIGN=Top>[8]</TD>

   248     <TD ALIGN=Left>

   249     <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 

   250       (Christian Urban and Cezary Kaliszyk) 

   251       In Proc. of the 20th European Symposium on Programming (ESOP 2011).

   252       In Volume 6602 of Lecture Notes in Computer Science, Pages 480-500, 2011.

   253       [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/esop-11.pdf">pdf</A>] (and a

   254       longer version appeared in the Journal of Logical Methods in Computer 

   255       Science, Volume 8 (2:14), 2012 

   256       [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lmcs.pdf">pdf</A>])

   257     </TD>

   258 

   259 </TR>