|
2
|
1 |
<?xml version="1.0" encoding="utf-8"?>
|
|
|
2 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
3 |
<HEAD>
|
|
|
4 |
<TITLE>Homepage of Christian Urban</TITLE>
|
|
3
|
5 |
<BASE HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/">
|
|
2
|
6 |
</HEAD>
|
|
|
7 |
|
|
|
8 |
<BODY TEXT="#000000"
|
|
|
9 |
BGCOLOR="#4169E1"
|
|
|
10 |
LINK="#0000EF"
|
|
|
11 |
VLINK="#51188E"
|
|
|
12 |
ALINK="#FF0000">
|
|
|
13 |
|
|
|
14 |
<TABLE WIDTH="100%"
|
|
|
15 |
BGCOLOR="#4169E1"
|
|
|
16 |
BORDER="0"
|
|
|
17 |
FRAME="border"
|
|
|
18 |
CELLPADDING="10"
|
|
|
19 |
CELLSPACING="2"
|
|
|
20 |
RULES="all">
|
|
|
21 |
|
|
|
22 |
<!-- left column -->
|
|
|
23 |
<TR>
|
|
|
24 |
<TD BGCOLOR="#FFFFFF"
|
|
|
25 |
WIDTH="24%"
|
|
|
26 |
VALIGN="TOP"
|
|
|
27 |
ROWSPAN="8">
|
|
|
28 |
|
|
|
29 |
<B>Links</B><BR>
|
|
3
|
30 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/index.html">Home</A><BR>
|
|
|
31 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/publications.html">Publications</A><BR>
|
|
|
32 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/teaching.html">Teaching</A><BR>
|
|
|
33 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/travelling.html">Recent Talks</A><BR>
|
|
2
|
34 |
<A HREF="http://isabelle.in.tum.de/nominal/">My Research Group</A>
|
|
|
35 |
<BR>
|
|
|
36 |
<BR>
|
|
|
37 |
|
|
|
38 |
<B>Handy Information</B><BR>
|
|
3
|
39 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/logic.html">People in Logic</A><BR>
|
|
|
40 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/programming.html">Programming Languages</A><BR>
|
|
|
41 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A>
|
|
2
|
42 |
<BR><BR>
|
|
|
43 |
|
|
|
44 |
<A HREF="http://isabelle.in.tum.de/nominal/">
|
|
5
|
45 |
<IMG SRC="nominal-logo.gif" ALT="" style="border-width: 0px;" align="left"></A>
|
|
2
|
46 |
</TD>
|
|
|
47 |
|
|
|
48 |
|
|
|
49 |
|
|
|
50 |
<!-- right column -->
|
|
|
51 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
52 |
<A NAME="Home"></A>
|
|
|
53 |
<TABLE>
|
|
|
54 |
<TR>
|
|
|
55 |
<TD WIDTH="75%">
|
|
16
|
56 |
<H1>Christian Urban</H1>
|
|
2
|
57 |
|
|
|
58 |
<B>E-mail</B>
|
|
16
|
59 |
urbanc <I>at</I> dcs kcl ac uk<BR>
|
|
2
|
60 |
<BR>
|
|
|
61 |
|
|
|
62 |
<B>Address</B>
|
|
16
|
63 |
<A HREF="http://www.dcs.kcl.ac.uk">Department of Informatics</A>,
|
|
|
64 |
<A HREF="http://www.kcl.ac.uk">King's College London</A>,
|
|
|
65 |
Strand, London WC2R 2LS, UK. My office is S6.30 on the 6th floor of the Strand Building.
|
|
2
|
66 |
<BR><BR>
|
|
|
67 |
|
|
16
|
68 |
<B>Fax</B> +44 20 7848 2851
|
|
2
|
69 |
</TD>
|
|
|
70 |
<TD align="right" valign="top">
|
|
3
|
71 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/picture-small.jpg"><IMG ALT="" SRC="picture-small.jpg" align="top"></A>
|
|
2
|
72 |
</TD>
|
|
|
73 |
</TR>
|
|
|
74 |
</TABLE>
|
|
|
75 |
<p>
|
|
|
76 |
<IMG SRC="new.gif" ALT="" style="" align="left"><A HREF="http://isabelle.in.tum.de/nominal/activities/idp" target="_top">Isabelle Documentation Project</A> (contains now a draft of a 200-page tutorial on Isabelle programming)<BR>
|
|
|
77 |
</TD>
|
|
|
78 |
</TR>
|
|
|
79 |
|
|
|
80 |
<TR>
|
|
|
81 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
82 |
<B>Current Position</B>
|
|
|
83 |
I have been awarded an
|
|
|
84 |
<A HREF="http://en.wikipedia.org/wiki/Emmy_Noether">Emmy-Noether</A>
|
|
|
85 |
<A HREF="http://www.dfg.de/en/research_funding/programmes/individual/emmy_noether/in_brief/index.html">fellowship</A>
|
|
|
86 |
to head an independent <A HREF="http://isabelle.in.tum.de/nominal/">research group</A> in
|
|
|
87 |
the Computer Science Department at the
|
|
|
88 |
<A HREF="http://www.in.tum.de/en.html">TU Munich</A>. This group co-operates
|
|
|
89 |
with the <A HREF="http://www4.in.tum.de/proj/theoremprov/group.html">Theorem Proving Group</A>
|
|
|
90 |
chaired by <A HREF="http://www4.informatik.tu-muenchen.de/~nipkow/">Prof. Tobias Nipkow</A> and
|
|
|
91 |
is accommodated by the institute of
|
|
|
92 |
<A HREF="http://www4.informatik.tu-muenchen.de/~broy/">Prof. Manfred Broy</A>.
|
|
|
93 |
<P>
|
|
|
94 |
|
|
|
95 |
<B>Past Positions</B>
|
|
|
96 |
Between September 2008 and February 2009, I was an invited research fellow in
|
|
|
97 |
the <A HREF="http://www.cs.princeton.edu/">Department of Computer Science</A> in Princeton.
|
|
|
98 |
In 2004/05 I was an Alexander-von-Humboldt fellow in Munich and
|
|
|
99 |
from 2000 until 2004 I was awarded a Research Fellowship in Cambridge. Before that
|
|
|
100 |
I did my PhD in Cambridge.
|
|
|
101 |
<P>
|
|
|
102 |
|
|
|
103 |
<B>Research Interests</B> theorem provers, programming languages, compilers,
|
|
|
104 |
algorithms, proof theory, type systems, concurrency, lambda calculus, unification,
|
|
|
105 |
regular expressions, computability, complexity, functional and logic programming.
|
|
|
106 |
<P>
|
|
|
107 |
|
|
|
108 |
<B>Conferences</B>
|
|
|
109 |
<A HREF="http://www.iiia.csic.es/~levy/unif06/">UNIF'06</A> (member of PC),
|
|
|
110 |
<A HREF="http://www.cs.mcgill.ca/~bpientka/lfmtp07">LFMTP'07</A> (member of PC),
|
|
|
111 |
<A HREF="http://isabelle.in.tum.de/nominal/activities/lfmtp08/">LFMTP'08</A> (PC co-chair),
|
|
|
112 |
<A HREF="http://www.cis.upenn.edu/~sweirich/wmm/">WMM'08</A> (member of PC),
|
|
|
113 |
<A HREF="http://www.mat.ufmg.br/lsfa2008/">LSFA'08</A> (invited speaker),
|
|
|
114 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/maribel/TAASN.html">TAASN'09</A> (member of PC),
|
|
|
115 |
<A HREF="http://lsfa09.cic.unb.br/">LSFA'09</A> (member of PC),
|
|
|
116 |
<A HREF="http://isabelle.in.tum.de/nominal/activities/tphols09/idw.html">IDW'09</A> (organiser),
|
|
|
117 |
<A HREF="http://www.seas.upenn.edu/~sweirich/wmm/wmm09.html">WMM'09</A> (PC chair),
|
|
|
118 |
<A HREF="http://tphols.in.tum.de/">TPHOLs'09</A> (PC co-chair),
|
|
|
119 |
<A HREF="http://dream.inf.ed.ac.uk/events/automatheo-2010/">Automatheo'10</A> (member of PC),
|
|
|
120 |
<A HREF="http://www.floc-conference.org/">ITP'10</A> (member of PC),
|
|
|
121 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html">UNIF'10</A> (invited speaker),
|
|
|
122 |
<A HREF="http://www.cis.upenn.edu/~bcpierce/wmm/">WMM'10</A> (invited speaker),
|
|
|
123 |
<A HREF="http://isabelle.in.tum.de/nominal/activities/idw10/idw.html">IDW'10</A> (co-organiser),
|
|
|
124 |
<A HREF="http://formes.asia/cpp">CPP'11</A> (member of PC),
|
|
|
125 |
<A HREF="http://www.rdp2011.uns.ac.rs/rta/">RTA'11</A> (member of PC),
|
|
|
126 |
<A HREF="http://lfmtp11.cs.umn.edu">LFMTP'11</A> (member of PC)
|
|
|
127 |
<BR>
|
|
|
128 |
|
|
|
129 |
</TD>
|
|
|
130 |
</TR>
|
|
|
131 |
|
|
|
132 |
<TR>
|
|
|
133 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
134 |
<B>Nominal Isabelle</B>
|
|
|
135 |
I currently work on Nominal
|
|
|
136 |
<A HREF="http://isabelle.in.tum.de">Isabelle</A>. This is joint work with
|
|
|
137 |
<A HREF="http://wwwbroy.in.tum.de/~berghofe/">Dr Stefan Berghofer</A>,
|
|
|
138 |
<A HREF="http://www4.in.tum.de/~wenzelm/">Dr Markus Wenzel</A>,
|
|
|
139 |
<A HREF="http://www4.in.tum.de/~kaliszyk/">Dr Cezary Kaliszyk</A> and
|
|
|
140 |
the Isabelle-team in Munich.
|
|
|
141 |
Many of the theoretical ideas originate from the nominal logic project - a wonderful project headed
|
|
|
142 |
by <A HREF="http://www.cl.cam.ac.uk/~amp12/">Prof. Andrew Pitts</A>.
|
|
|
143 |
The aim of my work is to make formal reasoning involving binders as simple as
|
|
|
144 |
on paper and the hope is to lure
|
|
|
145 |
<A HREF="http://alliance.seas.upenn.edu/~plclub/cgi-bin/poplmark/index.php?title=The_POPLmark_Challenge#Vision">masses</A> to automated
|
|
|
146 |
theorem proving. My funding for this work was provided in 2004 and 2005 by a research
|
|
|
147 |
fellowship from the
|
|
|
148 |
<A HREF="http://en.wikipedia.org/wiki/Alexander_von_Humboldt">Alexander-von-Humboldt</A>
|
|
|
149 |
<A HREF="http://www.humboldt-foundation.de/web/home.html">foundation</A>. During this time I was a visitor in the group of
|
|
|
150 |
<A HREF="http://www.mathematik.uni-muenchen.de/~schwicht/">Prof. Helmut Schwichtenberg</A>.
|
|
|
151 |
Since 2006 this work is supported by an
|
|
|
152 |
<A HREF="http://en.wikipedia.org/wiki/Emmy_Noether">Emmy-Noether</A>
|
|
|
153 |
<A HREF="http://www.dfg.de/en/research_funding/programmes/individual/emmy_noether/in_brief/index.html">fellowship</A>.
|
|
|
154 |
There is a <A HREF="http://isabelle.in.tum.de/nominal/">webpage</A> and a
|
|
|
155 |
<A HREF="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle">mailing list</A>
|
|
|
156 |
about Nominal Isabelle. It also includes a list of projects that use Nominal Isabelle.
|
|
|
157 |
Users of Nominal Isabelle had their papers appearing at LICS, POPL, FOSSACS, SOS, TPHOLs and CPP.
|
|
|
158 |
</TD>
|
|
|
159 |
</TR>
|
|
|
160 |
|
|
|
161 |
<TR>
|
|
|
162 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
163 |
<B>Myhill-Nerode and Regular Expressions</B>
|
|
|
164 |
Out of frustration of having to teach inductions in theorem provers using worn-out examples like
|
|
|
165 |
fib and even/odd, we implemented a large part of regular language theory in Isabelle/HOL.
|
|
|
166 |
This <A HREF="http://afp.sourceforge.net/devel-entries/Myhill-Nerode.shtml">implementation</A>
|
|
|
167 |
gives rise to much more interesting examples, as shown
|
|
|
168 |
<A HREF="http://www.cs.cmu.edu/~rwh/papers/regexp/jfp.ps">here</A> and
|
|
|
169 |
<A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that
|
|
|
170 |
formalisations of automata theory are a huge
|
|
|
171 |
<A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A>
|
|
|
172 |
in theorem provers, especially in those that are HOL-based.
|
|
|
173 |
We therefore went against the
|
|
|
174 |
<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>
|
|
|
175 |
and used in our formalisation regular expressions exclusively,
|
|
|
176 |
because they are much more convenient for formal reasoning. The results we
|
|
|
177 |
formalised include: the Myhill-Nerode theorem, the closure of regular languages
|
|
|
178 |
under complementation, finiteness of derivatives of regular expressions and a surprising
|
|
|
179 |
result about Subseq, which according to
|
|
|
180 |
this
|
|
|
181 |
<A HREF="http://blog.computationalcomplexity.org/2006/01/theorem-that-should-be-better-known.html">blog</A>
|
|
|
182 |
should be better known. This is joint work with Prof. Xingyuan
|
|
|
183 |
Zhang and his student Chunhan Wu from the
|
|
|
184 |
<A HREF="http://www.ust.com.cn/">PLA University of Science and Technology</A> in Nanjing.
|
|
|
185 |
My funding for this work came from the
|
|
|
186 |
<A HREF="http://www.sinogermanscience.org.cn/">Chinese-German Research Centre</A>.
|
|
|
187 |
</TD>
|
|
|
188 |
</TR>
|
|
|
189 |
|
|
|
190 |
<TR>
|
|
|
191 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
192 |
<B>Nominal Unification and Alpha-Prolog</B>
|
|
3
|
193 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Unification">Nominal unification</A> is one outcome of
|
|
2
|
194 |
my involvement in the nominal logic project in Cambridge. Another is the logic programming language
|
|
|
195 |
alpha-Prolog (joint work with <A HREF="http://homepages.inf.ed.ac.uk/jcheney/">Dr James Cheney</A>),
|
|
|
196 |
which uses nominal unification - click for details
|
|
|
197 |
<A HREF="http://homepages.inf.ed.ac.uk/jcheney/programs/aprolog/">here</A>.
|
|
|
198 |
The nominal unification algorithm has been
|
|
3
|
199 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Unification">formally verified</A> in Isabelle. This
|
|
2
|
200 |
was possible since this unification algorithm is formulated in a simple first-order language
|
|
|
201 |
(unlike other algorithms for higher-order unification).
|
|
|
202 |
<A HREF="http://www.cs.indiana.edu/~dfried/">Prof. Daniel Friedman</A> and his group use nominal
|
|
|
203 |
unification in their alpha-Kanren system implemented in Scheme.
|
|
|
204 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/maribel/">Prof. Maribel Fernandez</A> and her student
|
|
|
205 |
improved the nominal unification algorithm to be quadratic.
|
|
|
206 |
My funding for this work was provided through a research fellowship from
|
|
|
207 |
<A HREF="http://www.corpus.cam.ac.uk">Corpus Christi College</A>, Cambridge.
|
|
|
208 |
</TD>
|
|
|
209 |
</TR>
|
|
|
210 |
|
|
|
211 |
<TR>
|
|
|
212 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
213 |
<B>Classical Logic</B>
|
|
|
214 |
I was Ph.D. student in the University of Cambridge
|
|
|
215 |
<A HREF="http://www.cl.cam.ac.uk">Computer Laboratory</A>
|
|
|
216 |
and for three years
|
|
|
217 |
called Gonville and Caius College my home. I was very lucky to have
|
|
|
218 |
<A HREF="http://research.microsoft.com/~gmb/">Dr Gavin Bierman</A>
|
|
|
219 |
as supervisor. My research in Cambridge was also very much influenced by
|
|
|
220 |
<A HREF="http://www.dpmms.cam.ac.uk/~martin/">Prof. Martin Hyland</A>.
|
|
|
221 |
Some details on my thesis "Classical Logic and Computation" are
|
|
3
|
222 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/PhD/index.html">elsewhere</A>, including
|
|
|
223 |
a <A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Cut/cutapplet.html">Java Applet</A> that
|
|
2
|
224 |
'visualises' some of the results from the thesis. I completed the writing of
|
|
|
225 |
the thesis in <A HREF="http://iml.univ-mrs.fr/ldp/">Marseille</A> in the group of
|
|
|
226 |
<A HREF="http://iml.univ-mrs.fr/~girard/">Prof. Jean-Yves Girard</A>. My study in
|
|
|
227 |
Cambridge was funded by two <A HREF="http://www.daad.de/index.html">scholarships</a>
|
|
|
228 |
from the German government; my year in Marseille by a TMR-fellowship from the EU.
|
|
|
229 |
My PhD was also one starting point for the EPSRC Project on the Semantics of Classical
|
|
|
230 |
Proofs. The strong normalisation result in the PhD has recently been used by
|
|
|
231 |
<A HREF="http://www.loria.fr/~ckirchne/hot.html">Prof. Claude Kirchner</A> and his
|
|
|
232 |
students to prove consistency for their superdeduction system lemuridae.
|
|
|
233 |
</TD>
|
|
|
234 |
</TR>
|
|
|
235 |
|
|
|
236 |
|
|
|
237 |
|
|
|
238 |
<TR>
|
|
|
239 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
240 |
<B>Forum</B>
|
|
|
241 |
I implemented Forum, a programming language based on classical linear logic,
|
|
|
242 |
as my M.Phil. thesis. This was joint work with
|
|
|
243 |
<A HREF="http://www.dcs.st-and.ac.uk/~rd/">Dr Roy Dyckhoff</A>.
|
|
|
244 |
Details can be found
|
|
|
245 |
<A HREF="http://www.dcs.st-and.ac.uk/~rd/logic/nonmac/">here</A> and
|
|
|
246 |
<A HREF="http://www.lix.polytechnique.fr/Labo/Dale.Miller/forum/">here</A>. During my
|
|
|
247 |
M.Phil study I spent one month in Philadelphia invited by
|
|
|
248 |
<A HREF="http://www.lix.polytechnique.fr/~dale/">Prof. Dale Miller</A>.
|
|
|
249 |
</TD>
|
|
|
250 |
</TR>
|
|
|
251 |
|
|
|
252 |
<TR>
|
|
|
253 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
254 |
<B>G4ip</B> An implementation of G4ip using the imperative language Pizza can be found
|
|
3
|
255 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Prover/index.html">here</A>.
|
|
2
|
256 |
<A HREF="http://pizzacompiler.sourceforge.net">Pizza</A> is a conservative
|
|
|
257 |
extension of Java and a precursor of Scala. The implementation illustrates the technique of success
|
|
|
258 |
continuations.
|
|
|
259 |
</TD>
|
|
|
260 |
</TR>
|
|
|
261 |
|
|
|
262 |
|
|
|
263 |
</TABLE>
|
|
|
264 |
<P><!-- Created: Tue Mar 4 00:23:25 GMT 1997 -->
|
|
|
265 |
<!-- hhmts start -->
|
|
16
|
266 |
Last modified: Sat Oct 22 13:37:43 BST 2011
|
|
2
|
267 |
<!-- hhmts end -->
|
|
|
268 |
<a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
|
|
|
269 |
|
|
|
270 |
<!-- script type="text/javascript">
|
|
|
271 |
var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
|
|
|
272 |
document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
|
|
|
273 |
</script>
|
|
|
274 |
<script type="text/javascript">
|
|
|
275 |
try {
|
|
|
276 |
var pageTracker = _gat._getTracker("UA-4143458-2");
|
|
|
277 |
pageTracker._trackPageview();
|
|
|
278 |
} catch(err) {}
|
|
|
279 |
</script -->
|
|
|
280 |
</BODY>
|
|
|
281 |
</HTML>
|