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://www.cadeinc.org/SkolemAward.html">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://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">paper</A> |
134 <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">paper</A> |
135 on Nominal Techniques in Isabelle/HOL from 2005. |
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 <P> |
137 <P> |
137 |
138 |
138 <B>Research Interests</B> theorem provers, verification, programming languages, compilers, |
139 <B>Research Interests</B> theorem provers, verification, programming languages, compilers, |
139 algorithms, proof theory, type systems, concurrency, lambda calculus, unification, |
140 algorithms, proof theory, type systems, concurrency, lambda calculus, unification, |
140 regular expressions, computability, complexity, functional and logic programming. |
141 regular expressions, computability, complexity, functional and logic programming. |