132 algorithms, proof theory, type systems, concurrency, lambda calculus, unification, |
132 algorithms, proof theory, type systems, concurrency, lambda calculus, unification, |
133 regular expressions, computability, complexity, functional and logic programming. |
133 regular expressions, computability, complexity, functional and logic programming. |
134 <P> |
134 <P> |
135 |
135 |
136 <B>Conferences</B> |
136 <B>Conferences</B> |
137 <A HREF="http://www.iiia.csic.es/~levy/unif06/">UNIF'06</A> (member of PC), |
137 UNIF'06 (member of PC), |
138 <A HREF="http://www.cs.mcgill.ca/~bpientka/lfmtp07">LFMTP'07</A> (member of PC), |
138 <A HREF="http://www.cs.mcgill.ca/~bpientka/lfmtp07">LFMTP'07</A> (member of PC), |
139 <A HREF="http://isabelle.in.tum.de/nominal/activities/lfmtp08/">LFMTP'08</A> (PC co-chair), |
139 <A HREF="http://isabelle.in.tum.de/nominal/activities/lfmtp08/">LFMTP'08</A> (PC co-chair), |
140 <A HREF="http://www.cis.upenn.edu/~sweirich/wmm/">WMM'08</A> (member of PC), |
140 <A HREF="http://www.cis.upenn.edu/~sweirich/wmm/">WMM'08</A> (member of PC), |
141 <A HREF="http://www.mat.ufmg.br/lsfa2008/">LSFA'08</A> (invited speaker), |
141 <A HREF="http://www.mat.ufmg.br/lsfa2008/">LSFA'08</A> (invited speaker), |
142 <A HREF="http://www.inf.kcl.ac.uk/staff/maribel/TAASN.html">TAASN'09</A> (member of PC), |
142 <A HREF="http://www.inf.kcl.ac.uk/staff/maribel/TAASN.html">TAASN'09</A> (member of PC), |
147 <A HREF="http://dream.inf.ed.ac.uk/events/automatheo-2010/">Automatheo'10</A> (member of PC), |
147 <A HREF="http://dream.inf.ed.ac.uk/events/automatheo-2010/">Automatheo'10</A> (member of PC), |
148 <A HREF="http://www.floc-conference.org/">ITP'10</A> (member of PC), |
148 <A HREF="http://www.floc-conference.org/">ITP'10</A> (member of PC), |
149 <A HREF="http://www.inf.kcl.ac.uk/staff/maribel/UNIF/UNIF.html">UNIF'10</A> (invited speaker), |
149 <A HREF="http://www.inf.kcl.ac.uk/staff/maribel/UNIF/UNIF.html">UNIF'10</A> (invited speaker), |
150 <A HREF="http://www.cis.upenn.edu/~bcpierce/wmm/">WMM'10</A> (invited speaker), |
150 <A HREF="http://www.cis.upenn.edu/~bcpierce/wmm/">WMM'10</A> (invited speaker), |
151 <A HREF="http://isabelle.in.tum.de/nominal/activities/idw10/idw.html">IDW'10</A> (co-organiser), |
151 <A HREF="http://isabelle.in.tum.de/nominal/activities/idw10/idw.html">IDW'10</A> (co-organiser), |
152 <A HREF="http://formes.asia/cpp">CPP'11</A> (member of PC), |
152 CPP'11 (member of PC), |
153 <A HREF="http://www.rdp2011.uns.ac.rs/rta/">RTA'11</A> (member of PC), |
153 <A HREF="http://www.rdp2011.uns.ac.rs/rta/">RTA'11</A> (member of PC), |
154 <A HREF="http://lfmtp11.cs.umn.edu">LFMTP'11</A> (member of PC), |
154 <A HREF="http://lfmtp11.cs.umn.edu">LFMTP'11</A> (member of PC), |
155 <A HREF="http://www.cs.uwyo.edu/~ruben/itp-2014">ITP'14</A> (member of PC) |
155 <A HREF="http://www.cs.uwyo.edu/~ruben/itp-2014">ITP'14</A> (member of PC) |
156 <P> |
156 <P> |
157 |
157 |
165 <TD BGCOLOR="#FFFFFF" WIDTH="75%"> |
165 <TD BGCOLOR="#FFFFFF" WIDTH="75%"> |
166 <B>Nominal Isabelle</B> |
166 <B>Nominal Isabelle</B> |
167 I currently work on Nominal |
167 I currently work on Nominal |
168 <A HREF="http://isabelle.in.tum.de">Isabelle</A> 2. This is joint work with |
168 <A HREF="http://isabelle.in.tum.de">Isabelle</A> 2. This is joint work with |
169 <A HREF="http://wwwbroy.in.tum.de/~berghofe/">Dr Stefan Berghofer</A>, |
169 <A HREF="http://wwwbroy.in.tum.de/~berghofe/">Dr Stefan Berghofer</A>, |
170 <A HREF="https://www.lri.fr/~wenzel/">Dr Markus Wenzel</A>, |
170 <A HREF="http://www.lri.fr/~wenzel/">Dr Markus Wenzel</A>, |
171 <A HREF="http://cl-informatik.uibk.ac.at/users/cek/">Dr Cezary Kaliszyk</A>, |
171 <A HREF="http://cl-informatik.uibk.ac.at/users/cek/">Dr Cezary Kaliszyk</A>, |
172 <A HREF="http://user.it.uu.se/~tjawe125/">Dr Tjark Weber</A> and |
172 <A HREF="http://user.it.uu.se/~tjawe125/">Dr Tjark Weber</A> and |
173 the Isabelle-team in Munich. |
173 the Isabelle-team in Munich. |
174 Many of the theoretical ideas originate from the nominal logic project - a wonderful project headed |
174 Many of the theoretical ideas originate from the nominal logic project - a wonderful project headed |
175 by <A HREF="http://www.cl.cam.ac.uk/~amp12/">Prof. Andrew Pitts</A>. |
175 by <A HREF="http://www.cl.cam.ac.uk/~amp12/">Prof. Andrew Pitts</A>. |
202 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that |
202 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that |
203 formalisations of automata theory are a huge |
203 formalisations of automata theory are a huge |
204 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> |
204 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> |
205 in theorem provers, especially in those that are based on HOL. |
205 in theorem provers, especially in those that are based on HOL. |
206 We therefore went against the |
206 We therefore went against the |
207 <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> |
207 <A HREF="http://www.cs.cornell.edu/~kozen/papers/papers_by_year.htm#K97a">mainstream</A> |
208 and used in our formalisation regular expressions exclusively, |
208 and used in our formalisation regular expressions exclusively, |
209 because they are much more convenient for formal reasoning. The results we |
209 because they are much more convenient for formal reasoning. The results we |
210 formalised include: the Myhill-Nerode theorem, the closure of regular languages |
210 formalised include: the Myhill-Nerode theorem, the closure of regular languages |
211 under complementation, finiteness of derivatives of regular expressions and a surprising |
211 under complementation, finiteness of derivatives of regular expressions and a surprising |
212 result about Subseq, which according to |
212 result about Subseq, which according to |