index.html
changeset 466 60e2efad126c
parent 463 2ecb60672b0c
child 469 95ea2ffaa094
equal deleted inserted replaced
465:4dac76eb27d9 466:60e2efad126c
    83 <B>E-mail</B> 
    83 <B>E-mail</B> 
    84 christian.urban <I>at</I> kcl ac uk<BR>
    84 christian.urban <I>at</I> kcl ac uk<BR>
    85 <BR>
    85 <BR>
    86 
    86 
    87 <B>Address</B> 
    87 <B>Address</B> 
    88 <A HREF="http://www.inf.kcl.ac.uk">Department of Informatics</A>,
    88 <A HREF="http://www.kcl.ac.uk/nms/depts/informatics/">Department of Informatics</A>,
    89 <A HREF="http://www.kcl.ac.uk">King's College London</A>,
    89 <A HREF="http://www.kcl.ac.uk">King's College London</A>,
    90 Strand, London WC2R 2LS, UK. My office is S1.27 on the 1st floor of the Strand Building. 
    90 Strand, London WC2R 2LS, UK. My office is S1.27 on the 1st floor of the Strand Building. 
    91 <BR>
    91 <BR>
    92 
    92 
    93 </TD>
    93 </TD>
   127 Service (<A HREF="http://www.daad.de/index.html">DAAD</A>).
   127 Service (<A HREF="http://www.daad.de/index.html">DAAD</A>).
   128 <P>
   128 <P>
   129 
   129 
   130 <B>Skolem Award 2015</B> Together with
   130 <B>Skolem Award 2015</B> Together with
   131 <A HREF="http://www.pps.univ-paris-diderot.fr/~tasson/">Christine Tasson</A>, I was awarded a
   131 <A HREF="http://www.pps.univ-paris-diderot.fr/~tasson/">Christine Tasson</A>, I was awarded a
   132 <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>, a ten-year
   132 <A HREF="http://cadeinc.org/Skolem-Award">Thoralf Skolem Award</A>, a ten-year
   133   test-of-time award from CADE, for our
   133   test-of-time award from CADE, for our
   134   <A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-cade-05.ps">paper</A>
   134   <A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-cade-05.ps">paper</A>
   135   on Nominal Techniques in Isabelle/HOL from 2005. This award was given also to Nicolaas de Bruijn and
   135   on Nominal Techniques in Isabelle/HOL from 2005. This award was given also to Nicolaas de Bruijn and
   136   Nachum Derschowitz, amongst others.
   136   Nachum Derschowitz, amongst others.
   137 <P>
   137 <P>
   189 <TD BGCOLOR="#FFFFFF" WIDTH="75%">
   189 <TD BGCOLOR="#FFFFFF" WIDTH="75%">
   190 <B>Nominal Isabelle</B> 
   190 <B>Nominal Isabelle</B> 
   191 I currently work on Nominal 
   191 I currently work on Nominal 
   192 <A HREF="http://isabelle.in.tum.de">Isabelle</A> 2. This is joint work with 
   192 <A HREF="http://isabelle.in.tum.de">Isabelle</A> 2. This is joint work with 
   193 <A HREF="http://wwwbroy.in.tum.de/~berghofe/">Dr Stefan Berghofer</A>,
   193 <A HREF="http://wwwbroy.in.tum.de/~berghofe/">Dr Stefan Berghofer</A>,
   194 <A HREF="http://www.lri.fr/~wenzel/">Dr Markus Wenzel</A>,
   194 <A HREF="http://sketis.net/">Dr Markus Wenzel</A>,
   195 <A HREF="http://cl-informatik.uibk.ac.at/users/cek/">Dr Cezary Kaliszyk</A>,
   195 <A HREF="http://cl-informatik.uibk.ac.at/users/cek/">Dr Cezary Kaliszyk</A>,
   196 <A HREF="http://user.it.uu.se/~tjawe125/">Dr Tjark Weber</A> and 
   196 <A HREF="http://user.it.uu.se/~tjawe125/">Dr Tjark Weber</A> and 
   197 the Isabelle-team in Munich.
   197 the Isabelle-team in Munich.
   198 Many of the theoretical ideas originate from the nominal logic project - a wonderful project headed 
   198 Many of the theoretical ideas originate from the nominal logic project - a wonderful project headed 
   199 by <A HREF="http://www.cl.cam.ac.uk/~amp12/">Prof. Andrew Pitts</A>.  
   199 by <A HREF="http://www.cl.cam.ac.uk/~amp12/">Prof. Andrew Pitts</A>.  
   292 <A HREF="http://homepages.inf.ed.ac.uk/jcheney/programs/aprolog/">here</A>.
   292 <A HREF="http://homepages.inf.ed.ac.uk/jcheney/programs/aprolog/">here</A>.
   293 The nominal unification algorithm has been 
   293 The nominal unification algorithm has been 
   294 <A HREF="http://nms.kcl.ac.uk/christian.urban/Unification">formally verified</A> in Isabelle. This 
   294 <A HREF="http://nms.kcl.ac.uk/christian.urban/Unification">formally verified</A> in Isabelle. This 
   295 was possible  since this unification algorithm is formulated in a simple first-order language 
   295 was possible  since this unification algorithm is formulated in a simple first-order language 
   296 (unlike other algorithms for higher-order unification). 
   296 (unlike other algorithms for higher-order unification). 
   297 <A HREF="http://www.inf.kcl.ac.uk/staff/maribel/">Prof. Maribel Fernandez</A> and her student
   297 <A HREF="https://nms.kcl.ac.uk/maribel.fernandez/">Prof. Maribel Fernandez</A> and her student
   298 improved the nominal unification algorithm to be quadratic. 
   298 improved the nominal unification algorithm to be quadratic. 
   299   <A HREF="http://www.cs.indiana.edu/~dfried/">Prof. Daniel Friedman</A> and his group use nominal 
   299   <A HREF="http://www.cs.indiana.edu/~dfried/">Prof. Daniel Friedman</A> and his group use nominal 
   300 unification in their alpha-Kanren system implemented in Scheme. This work has also found its
   300 unification in their alpha-Kanren system implemented in Scheme. This work has also found its
   301   way into <A HREF="http://clojure.org">Clojure</A> as the <A HREF="https://github.com/clojure/core.logic/wiki/core.logic.nominal">core.logic.nominal</A> package.
   301   way into <A HREF="http://clojure.org">Clojure</A> as the <A HREF="https://github.com/clojure/core.logic/wiki/core.logic.nominal">core.logic.nominal</A> package.
   302 My funding for this work was provided through a research fellowship from 
   302 My funding for this work was provided through a research fellowship from