52 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/logic.html">People in Logic</A><BR> |
52 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/logic.html">People in Logic</A><BR> |
53 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/programming.html">Programming Languages</A><BR> |
53 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/programming.html">Programming Languages</A><BR> |
54 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A> |
54 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A> |
55 <BR><BR> |
55 <BR><BR> |
56 |
56 |
|
57 <table border="0"> |
|
58 <tr> |
|
59 <td> |
57 <A HREF="http://isabelle.in.tum.de/nominal/"> |
60 <A HREF="http://isabelle.in.tum.de/nominal/"> |
58 <IMG SRC="nominal-logo.gif" ALT="" style="border-width: 0px;" align="left"></A> |
61 <IMG SRC="nominal-logo.gif" ALT="" style="border-width: 0px;" align="left"></A> |
|
62 </td> |
|
63 </tr> |
|
64 <tr> |
|
65 <td> |
|
66 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Cookbook/"> |
|
67 <IMG SRC="Cookbook/logo-documentation.gif" ALT="" style="border-width: 0px;" align="left"></A> |
|
68 </td> |
|
69 </tr> |
|
70 </table> |
59 </TD> |
71 </TD> |
60 |
72 |
61 |
73 |
62 |
74 |
63 <!-- right column --> |
75 <!-- right column --> |
182 gives rise to much more interesting examples, as shown |
194 gives rise to much more interesting examples, as shown |
183 <A HREF="http://www.cs.cmu.edu/~rwh/papers/regexp/jfp.ps">here</A> and |
195 <A HREF="http://www.cs.cmu.edu/~rwh/papers/regexp/jfp.ps">here</A> and |
184 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that |
196 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that |
185 formalisations of automata theory are a huge |
197 formalisations of automata theory are a huge |
186 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> |
198 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> |
187 in theorem provers, especially in those that are HOL-based. |
199 in theorem provers, especially in those that are based on HOL. |
188 We therefore went against the |
200 We therefore went against the |
189 <A HREF="http://books.google.com/books?id=8lKyxS8_CNoC&pg=PA14&source=gbs_toc_r&cad=4#v=onepage&q&f=false">mainstream</A> |
201 <A HREF="http://books.google.com/books?id=8lKyxS8_CNoC&pg=PA14&source=gbs_toc_r&cad=4#v=onepage&q&f=false">mainstream</A> |
190 and used in our formalisation regular expressions exclusively, |
202 and used in our formalisation regular expressions exclusively, |
191 because they are much more convenient for formal reasoning. The results we |
203 because they are much more convenient for formal reasoning. The results we |
192 formalised include: the Myhill-Nerode theorem, the closure of regular languages |
204 formalised include: the Myhill-Nerode theorem, the closure of regular languages |