Nominal/main.html
changeset 465 4dac76eb27d9
parent 420 6600eb5b11cb
child 625 a831d431425c
equal deleted inserted replaced
464:ae516c20c5f1 465:4dac76eb27d9
    47 
    47 
    48 <P>
    48 <P>
    49 <IMG SRC="new.gif" ALT="" style="" align="left">
    49 <IMG SRC="new.gif" ALT="" style="" align="left">
    50 <I>We are working on a major overhaul of Nominal Isabelle. The 
    50 <I>We are working on a major overhaul of Nominal Isabelle. The 
    51 latest bundles of Nominal2 are 
    51 latest bundles of Nominal2 are 
    52 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/download.html">here</A>. 
    52 <A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/download.html">here</A>. 
    53 </I></P>
    53 </I></P>
    54 
    54 
    55 
    55 
    56 <P>
    56 <P>
    57 To root out bugs, every programming language should be designed with the help
    57 To root out bugs, every programming language should be designed with the help
   185 <TABLE>
   185 <TABLE>
   186 <TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>
   186 <TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>
   187     <TD ALIGN=Left>
   187     <TD ALIGN=Left>
   188     <B>Nominal Reasoning Techniques in Isabelle/HOL.</B>  In
   188     <B>Nominal Reasoning Techniques in Isabelle/HOL.</B>  In
   189       Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008.
   189       Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008.
   190       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf" target="_top">pdf</A>].
   190       [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-tech.pdf" target="_top">pdf</A>].
   191       The predecessor paper, which appeaerd at CADE in 2005, received the
   191       The predecessor paper, which appeaerd at CADE in 2005, received the
   192       <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>.
   192       <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>.
   193     </TD>
   193     </TD>
   194 </TR>
   194 </TR>
   195 <TR><TD VALIGN=Top>[2]</TD>
   195 <TR><TD VALIGN=Top>[2]</TD>
   196     <TD ALIGN=Left>
   196     <TD ALIGN=Left>
   197     <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B> 
   197     <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B> 
   198     (Christian Urban and Michael Norrish) 
   198     (Christian Urban and Michael Norrish) 
   199     Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
   199     Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
   200     Binding and Names (MERLIN 2005), Pages 25-32, 2005. &copy ACM, Inc.
   200     Binding and Names (MERLIN 2005), Pages 25-32, 2005. &copy ACM, Inc.
   201     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps" target="_top">ps</A>]
   201     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.ps" target="_top">ps</A>]
   202     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf" target="_top">pdf</A>]
   202     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.pdf" target="_top">pdf</A>]
   203     </TD>
   203     </TD>
   204 </TR>
   204 </TR>
   205 <TR><TD VALIGN=Top>[3]</TD>
   205 <TR><TD VALIGN=Top>[3]</TD>
   206     <TD ALIGN=Left>
   206     <TD ALIGN=Left>
   207     <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B> 
   207     <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B> 
   208     (Christian Urban and Stefan Berghofer) 
   208     (Christian Urban and Stefan Berghofer) 
   209     Proceedings of the 3rd 
   209     Proceedings of the 3rd 
   210     International Joint Conference on Automated Deduction (IJCAR 2006). In volume 4130 of 
   210     International Joint Conference on Automated Deduction (IJCAR 2006). In volume 4130 of 
   211     Lecture Notes in Artificial Intelligence, Pages 498-512, 2006.
   211     Lecture Notes in Artificial Intelligence, Pages 498-512, 2006.
   212     &copy <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>
   212     &copy <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>
   213     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps" target="_top">ps</A>]
   213     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/ijcar-06.ps" target="_top">ps</A>]
   214     </TD>
   214     </TD>
   215 </TR>
   215 </TR>
   216 
   216 
   217 <TR><TD VALIGN=Top>[4]</TD>
   217 <TR><TD VALIGN=Top>[4]</TD>
   218     <TD ALIGN=Left>
   218     <TD ALIGN=Left>
   219     <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> 
   219     <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> 
   220     (Stefan Berghofer and Christian Urban) 
   220     (Stefan Berghofer and Christian Urban) 
   221     Proceedings of the International Workshop on Logical Frameworks and 
   221     Proceedings of the International Workshop on Logical Frameworks and 
   222     Meta-Languages: Theory and Practice (LFMTP 2006), ENTCS, Pages 53-67, 2006.
   222     Meta-Languages: Theory and Practice (LFMTP 2006), ENTCS, Pages 53-67, 2006.
   223     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps" target="_top">ps</A>]
   223     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lfmtp-06.ps" target="_top">ps</A>]
   224     </TD>
   224     </TD>
   225 </TR>
   225 </TR>
   226 
   226 
   227 <TR><TD VALIGN=Top>[5]</TD>
   227 <TR><TD VALIGN=Top>[5]</TD>
   228     <TD ALIGN=Left>
   228     <TD ALIGN=Left>
   230     Urban, Stefan Berghofer and Michael Norrish) Proceedings of the 21th
   230     Urban, Stefan Berghofer and Michael Norrish) Proceedings of the 21th
   231     Conference on Automated Deduction (CADE 2007). In volume 4603 of Lecture
   231     Conference on Automated Deduction (CADE 2007). In volume 4603 of Lecture
   232     Notes in Artificial Intelligence, Pages 35-50, 2007.
   232     Notes in Artificial Intelligence, Pages 35-50, 2007.
   233     &copy <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm" 
   233     &copy <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm" 
   234     target="_top">Springer Verlag</A> 
   234     target="_top">Springer Verlag</A> 
   235     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps" target="_top">ps</A>]
   235     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/cade07.ps" target="_top">ps</A>]
   236     </TD>
   236     </TD>
   237 </TR>
   237 </TR>
   238 
   238 
   239 <TR><TD VALIGN=Top>[6]</TD>
   239 <TR><TD VALIGN=Top>[6]</TD>
   240     <TD ALIGN=Left>
   240     <TD ALIGN=Left>
   241     <B>Mechanising the Metatheory of LF.</B> 
   241     <B>Mechanising the Metatheory of LF.</B> 
   242     (Christian Urban, James Cheney and Stefan Berghofer) 
   242     (Christian Urban, James Cheney and Stefan Berghofer) 
   243     In Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
   243     In Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
   244     Pages 45-56, 2008.
   244     Pages 45-56, 2008.
   245     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
   245     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lics-08.pdf">pdf</A>] More
   246       information <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/LF/index.html">elsewhere</A>.
   246       information <A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/LF/index.html">elsewhere</A>.
   247     </TD>
   247     </TD>
   248 </TR>
   248 </TR>
   249 
   249 
   250 <TR><TD VALIGN=Top>[7]</TD>
   250 <TR><TD VALIGN=Top>[7]</TD>
   251     <TD ALIGN=Left>
   251     <TD ALIGN=Left>
   252     <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> 
   252     <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> 
   253     (Brian Huffman and Christian Urban) 
   253     (Brian Huffman and Christian Urban) 
   254     In Proc. of the 1st Conference on Interactive Theorem Proving (ITP 2010). In volume 6172 in 
   254     In Proc. of the 1st Conference on Interactive Theorem Proving (ITP 2010). In volume 6172 in 
   255     Lecture Notes in Computer Science, Pages 35-50, 2010.
   255     Lecture Notes in Computer Science, Pages 35-50, 2010.
   256     [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>] 
   256     [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nominal-atoms.pdf">pdf</A>] 
   257     </TD>
   257     </TD>
   258 </TR>
   258 </TR>
   259 
   259 
   260 <TR><TD VALIGN=Top>[8]</TD>
   260 <TR><TD VALIGN=Top>[8]</TD>
   261     <TD ALIGN=Left>
   261     <TD ALIGN=Left>
   262     <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 
   262     <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 
   263       (Christian Urban and Cezary Kaliszyk) 
   263       (Christian Urban and Cezary Kaliszyk) 
   264       In Proc. of the 20th European Symposium on Programming (ESOP 2011).
   264       In Proc. of the 20th European Symposium on Programming (ESOP 2011).
   265       In Volume 6602 of Lecture Notes in Computer Science, Pages 480-500, 2011.
   265       In Volume 6602 of Lecture Notes in Computer Science, Pages 480-500, 2011.
   266       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>] (and a
   266       [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/esop-11.pdf">pdf</A>] (and a
   267       longer version appeared in the Journal of Logical Methods in Computer 
   267       longer version appeared in the Journal of Logical Methods in Computer 
   268       Science, Volume 8 (2:14), 2012 
   268       Science, Volume 8 (2:14), 2012 
   269       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>])
   269       [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lmcs.pdf">pdf</A>])
   270     </TD>
   270     </TD>
   271 
   271 
   272 </TR>
   272 </TR>
   273 
   273 
   274 
   274