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>
17
+ − 83
I am a lecturer in the Department of Informatics at King's College London.
+ − 84
This is similar to a position of an assistant professorship in other places. In 2011,
+ − 85
I was also offered a lectureship
+ − 86
<A HREF="http://www.it.uu.se/" TITLE="Uppsala">here</A>, an associate professorship
+ − 87
<A HREF="http://www.itu.dk/en/" TITLE="ITU, Copenhagen">here</A>,
+ − 88
and a full professorship
+ − 89
<A HREF="http://www.ustcsz.edu.cn/kedweb/" TITLE="IAS, Suzhou">here</A> and
+ − 90
<A HREF="http://www.sei.ecnu.edu.cn/apps/portal/home.html" TITLE="Shanghai">here</A>.
+ − 91
I thank all people involved for their efforts.
2
+ − 92
<P>
+ − 93
+ − 94
<B>Past Positions</B>
17
+ − 95
In April 2006, I was awarded an <A HREF="http://en.wikipedia.org/wiki/Emmy_Noether">Emmy-Noether</A>
+ − 96
<A HREF="http://www.dfg.de/en/research_funding/programmes/individual/emmy_noether/in_brief/index.html">fellowship</A>, which I held at the <A HREF="http://www.in.tum.de/en.html">TU Munich</A> until
+ − 97
September 2011.
2
+ − 98
Between September 2008 and February 2009, I was an invited research fellow in
+ − 99
the <A HREF="http://www.cs.princeton.edu/">Department of Computer Science</A> in Princeton.
+ − 100
In 2004/05 I was an Alexander-von-Humboldt fellow in Munich and
+ − 101
from 2000 until 2004 I was awarded a Research Fellowship in Cambridge. Before that
+ − 102
I did my PhD in Cambridge.
+ − 103
<P>
+ − 104
+ − 105
<B>Research Interests</B> theorem provers, programming languages, compilers,
+ − 106
algorithms, proof theory, type systems, concurrency, lambda calculus, unification,
+ − 107
regular expressions, computability, complexity, functional and logic programming.
+ − 108
<P>
+ − 109
+ − 110
<B>Conferences</B>
+ − 111
<A HREF="http://www.iiia.csic.es/~levy/unif06/">UNIF'06</A> (member of PC),
+ − 112
<A HREF="http://www.cs.mcgill.ca/~bpientka/lfmtp07">LFMTP'07</A> (member of PC),
+ − 113
<A HREF="http://isabelle.in.tum.de/nominal/activities/lfmtp08/">LFMTP'08</A> (PC co-chair),
+ − 114
<A HREF="http://www.cis.upenn.edu/~sweirich/wmm/">WMM'08</A> (member of PC),
+ − 115
<A HREF="http://www.mat.ufmg.br/lsfa2008/">LSFA'08</A> (invited speaker),
+ − 116
<A HREF="http://www.dcs.kcl.ac.uk/staff/maribel/TAASN.html">TAASN'09</A> (member of PC),
+ − 117
<A HREF="http://lsfa09.cic.unb.br/">LSFA'09</A> (member of PC),
+ − 118
<A HREF="http://isabelle.in.tum.de/nominal/activities/tphols09/idw.html">IDW'09</A> (organiser),
+ − 119
<A HREF="http://www.seas.upenn.edu/~sweirich/wmm/wmm09.html">WMM'09</A> (PC chair),
+ − 120
<A HREF="http://tphols.in.tum.de/">TPHOLs'09</A> (PC co-chair),
+ − 121
<A HREF="http://dream.inf.ed.ac.uk/events/automatheo-2010/">Automatheo'10</A> (member of PC),
+ − 122
<A HREF="http://www.floc-conference.org/">ITP'10</A> (member of PC),
+ − 123
<A HREF="http://www.dcs.kcl.ac.uk/staff/maribel/UNIF.html">UNIF'10</A> (invited speaker),
+ − 124
<A HREF="http://www.cis.upenn.edu/~bcpierce/wmm/">WMM'10</A> (invited speaker),
+ − 125
<A HREF="http://isabelle.in.tum.de/nominal/activities/idw10/idw.html">IDW'10</A> (co-organiser),
+ − 126
<A HREF="http://formes.asia/cpp">CPP'11</A> (member of PC),
+ − 127
<A HREF="http://www.rdp2011.uns.ac.rs/rta/">RTA'11</A> (member of PC),
+ − 128
<A HREF="http://lfmtp11.cs.umn.edu">LFMTP'11</A> (member of PC)
+ − 129
<BR>
+ − 130
+ − 131
</TD>
+ − 132
</TR>
+ − 133
+ − 134
<TR>
+ − 135
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+ − 136
<B>Nominal Isabelle</B>
+ − 137
I currently work on Nominal
+ − 138
<A HREF="http://isabelle.in.tum.de">Isabelle</A>. This is joint work with
+ − 139
<A HREF="http://wwwbroy.in.tum.de/~berghofe/">Dr Stefan Berghofer</A>,
+ − 140
<A HREF="http://www4.in.tum.de/~wenzelm/">Dr Markus Wenzel</A>,
+ − 141
<A HREF="http://www4.in.tum.de/~kaliszyk/">Dr Cezary Kaliszyk</A> and
+ − 142
the Isabelle-team in Munich.
+ − 143
Many of the theoretical ideas originate from the nominal logic project - a wonderful project headed
+ − 144
by <A HREF="http://www.cl.cam.ac.uk/~amp12/">Prof. Andrew Pitts</A>.
+ − 145
The aim of my work is to make formal reasoning involving binders as simple as
+ − 146
on paper and the hope is to lure
+ − 147
<A HREF="http://alliance.seas.upenn.edu/~plclub/cgi-bin/poplmark/index.php?title=The_POPLmark_Challenge#Vision">masses</A> to automated
+ − 148
theorem proving. My funding for this work was provided in 2004 and 2005 by a research
+ − 149
fellowship from the
+ − 150
<A HREF="http://en.wikipedia.org/wiki/Alexander_von_Humboldt">Alexander-von-Humboldt</A>
+ − 151
<A HREF="http://www.humboldt-foundation.de/web/home.html">foundation</A>. During this time I was a visitor in the group of
+ − 152
<A HREF="http://www.mathematik.uni-muenchen.de/~schwicht/">Prof. Helmut Schwichtenberg</A>.
+ − 153
Since 2006 this work is supported by an
+ − 154
<A HREF="http://en.wikipedia.org/wiki/Emmy_Noether">Emmy-Noether</A>
+ − 155
<A HREF="http://www.dfg.de/en/research_funding/programmes/individual/emmy_noether/in_brief/index.html">fellowship</A>.
+ − 156
There is a <A HREF="http://isabelle.in.tum.de/nominal/">webpage</A> and a
+ − 157
<A HREF="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle">mailing list</A>
+ − 158
about Nominal Isabelle. It also includes a list of projects that use Nominal Isabelle.
+ − 159
Users of Nominal Isabelle had their papers appearing at LICS, POPL, FOSSACS, SOS, TPHOLs and CPP.
+ − 160
</TD>
+ − 161
</TR>
+ − 162
+ − 163
<TR>
+ − 164
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+ − 165
<B>Myhill-Nerode and Regular Expressions</B>
+ − 166
Out of frustration of having to teach inductions in theorem provers using worn-out examples like
+ − 167
fib and even/odd, we implemented a large part of regular language theory in Isabelle/HOL.
+ − 168
This <A HREF="http://afp.sourceforge.net/devel-entries/Myhill-Nerode.shtml">implementation</A>
+ − 169
gives rise to much more interesting examples, as shown
+ − 170
<A HREF="http://www.cs.cmu.edu/~rwh/papers/regexp/jfp.ps">here</A> and
+ − 171
<A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that
+ − 172
formalisations of automata theory are a huge
+ − 173
<A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A>
+ − 174
in theorem provers, especially in those that are HOL-based.
+ − 175
We therefore went against the
+ − 176
<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>
+ − 177
and used in our formalisation regular expressions exclusively,
+ − 178
because they are much more convenient for formal reasoning. The results we
+ − 179
formalised include: the Myhill-Nerode theorem, the closure of regular languages
+ − 180
under complementation, finiteness of derivatives of regular expressions and a surprising
+ − 181
result about Subseq, which according to
+ − 182
this
+ − 183
<A HREF="http://blog.computationalcomplexity.org/2006/01/theorem-that-should-be-better-known.html">blog</A>
+ − 184
should be better known. This is joint work with Prof. Xingyuan
+ − 185
Zhang and his student Chunhan Wu from the
+ − 186
<A HREF="http://www.ust.com.cn/">PLA University of Science and Technology</A> in Nanjing.
+ − 187
My funding for this work came from the
+ − 188
<A HREF="http://www.sinogermanscience.org.cn/">Chinese-German Research Centre</A>.
+ − 189
</TD>
+ − 190
</TR>
+ − 191
+ − 192
<TR>
+ − 193
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+ − 194
<B>Nominal Unification and Alpha-Prolog</B>
3
+ − 195
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Unification">Nominal unification</A> is one outcome of
2
+ − 196
my involvement in the nominal logic project in Cambridge. Another is the logic programming language
+ − 197
alpha-Prolog (joint work with <A HREF="http://homepages.inf.ed.ac.uk/jcheney/">Dr James Cheney</A>),
+ − 198
which uses nominal unification - click for details
+ − 199
<A HREF="http://homepages.inf.ed.ac.uk/jcheney/programs/aprolog/">here</A>.
+ − 200
The nominal unification algorithm has been
3
+ − 201
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Unification">formally verified</A> in Isabelle. This
2
+ − 202
was possible since this unification algorithm is formulated in a simple first-order language
+ − 203
(unlike other algorithms for higher-order unification).
+ − 204
<A HREF="http://www.cs.indiana.edu/~dfried/">Prof. Daniel Friedman</A> and his group use nominal
+ − 205
unification in their alpha-Kanren system implemented in Scheme.
+ − 206
<A HREF="http://www.dcs.kcl.ac.uk/staff/maribel/">Prof. Maribel Fernandez</A> and her student
+ − 207
improved the nominal unification algorithm to be quadratic.
+ − 208
My funding for this work was provided through a research fellowship from
+ − 209
<A HREF="http://www.corpus.cam.ac.uk">Corpus Christi College</A>, Cambridge.
+ − 210
</TD>
+ − 211
</TR>
+ − 212
+ − 213
<TR>
+ − 214
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+ − 215
<B>Classical Logic</B>
+ − 216
I was Ph.D. student in the University of Cambridge
+ − 217
<A HREF="http://www.cl.cam.ac.uk">Computer Laboratory</A>
+ − 218
and for three years
+ − 219
called Gonville and Caius College my home. I was very lucky to have
+ − 220
<A HREF="http://research.microsoft.com/~gmb/">Dr Gavin Bierman</A>
+ − 221
as supervisor. My research in Cambridge was also very much influenced by
+ − 222
<A HREF="http://www.dpmms.cam.ac.uk/~martin/">Prof. Martin Hyland</A>.
+ − 223
Some details on my thesis "Classical Logic and Computation" are
3
+ − 224
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/PhD/index.html">elsewhere</A>, including
+ − 225
a <A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Cut/cutapplet.html">Java Applet</A> that
2
+ − 226
'visualises' some of the results from the thesis. I completed the writing of
+ − 227
the thesis in <A HREF="http://iml.univ-mrs.fr/ldp/">Marseille</A> in the group of
+ − 228
<A HREF="http://iml.univ-mrs.fr/~girard/">Prof. Jean-Yves Girard</A>. My study in
+ − 229
Cambridge was funded by two <A HREF="http://www.daad.de/index.html">scholarships</a>
+ − 230
from the German government; my year in Marseille by a TMR-fellowship from the EU.
+ − 231
My PhD was also one starting point for the EPSRC Project on the Semantics of Classical
+ − 232
Proofs. The strong normalisation result in the PhD has recently been used by
+ − 233
<A HREF="http://www.loria.fr/~ckirchne/hot.html">Prof. Claude Kirchner</A> and his
+ − 234
students to prove consistency for their superdeduction system lemuridae.
+ − 235
</TD>
+ − 236
</TR>
+ − 237
+ − 238
+ − 239
+ − 240
<TR>
+ − 241
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+ − 242
<B>Forum</B>
+ − 243
I implemented Forum, a programming language based on classical linear logic,
+ − 244
as my M.Phil. thesis. This was joint work with
+ − 245
<A HREF="http://www.dcs.st-and.ac.uk/~rd/">Dr Roy Dyckhoff</A>.
+ − 246
Details can be found
+ − 247
<A HREF="http://www.dcs.st-and.ac.uk/~rd/logic/nonmac/">here</A> and
+ − 248
<A HREF="http://www.lix.polytechnique.fr/Labo/Dale.Miller/forum/">here</A>. During my
+ − 249
M.Phil study I spent one month in Philadelphia invited by
+ − 250
<A HREF="http://www.lix.polytechnique.fr/~dale/">Prof. Dale Miller</A>.
+ − 251
</TD>
+ − 252
</TR>
+ − 253
+ − 254
<TR>
+ − 255
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+ − 256
<B>G4ip</B> An implementation of G4ip using the imperative language Pizza can be found
3
+ − 257
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Prover/index.html">here</A>.
2
+ − 258
<A HREF="http://pizzacompiler.sourceforge.net">Pizza</A> is a conservative
+ − 259
extension of Java and a precursor of Scala. The implementation illustrates the technique of success
+ − 260
continuations.
+ − 261
</TD>
+ − 262
</TR>
+ − 263
+ − 264
+ − 265
</TABLE>
+ − 266
<P><!-- Created: Tue Mar 4 00:23:25 GMT 1997 -->
+ − 267
<!-- hhmts start -->
17
+ − 268
Last modified: Sun Oct 23 01:34:29 BST 2011
2
+ − 269
<!-- hhmts end -->
+ − 270
<a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
+ − 271
+ − 272
<!-- script type="text/javascript">
+ − 273
var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
+ − 274
document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
+ − 275
</script>
+ − 276
<script type="text/javascript">
+ − 277
try {
+ − 278
var pageTracker = _gat._getTracker("UA-4143458-2");
+ − 279
pageTracker._trackPageview();
+ − 280
} catch(err) {}
+ − 281
</script -->
+ − 282
</BODY>
+ − 283
</HTML>