--- a/publications.html Sat Jan 28 06:40:19 2017 +0000
+++ b/publications.html Sat Jan 28 07:17:00 2017 +0000
@@ -2,7 +2,7 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<HEAD>
<TITLE> Christian Urban </TITLE>
-<BASE HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">
+<BASE HREF="http://nms.kcl.ac.uk/christian.urban/">
<script type="text/javascript">
var _gaq = _gaq || [];
@@ -40,30 +40,30 @@
ROWSPAN="21">
<B>Links</B><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">Home</A><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/publications.html">Publications</A><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/teaching.html">Teaching</A><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/travelling.html">Recent Talks</A><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/">Nominal Isabelle</A>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/">Home</A><BR>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/publications.html">Publications</A><BR>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/teaching.html">Teaching</A><BR>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/travelling.html">Recent Talks</A><BR>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/">Nominal Isabelle</A>
<BR>
<BR>
<B>Handy Information</B><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/logic.html">People in Logic</A><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/programming.html">Programming Languages</A><BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/misc.html">Miscellaneous</A>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/logic.html">People in Logic</A><BR>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/programming.html">Programming Languages</A><BR>
+<A HREF="http://nms.kcl.ac.uk/christian.urban/misc.html">Miscellaneous</A>
<BR><BR>
<table border="0">
<tr>
<td>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/">
+<A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/">
<IMG SRC="nominal-logo.gif" ALT="" style="border-width: 0px;" align="left"></A>
</td>
</tr>
<tr>
<td>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Cookbook/">
+<A HREF="http://nms.kcl.ac.uk/christian.urban/Cookbook/">
<IMG SRC="Cookbook/logo-documentation.gif" ALT="" style="border-width: 0px;" align="left"></A>
</td>
</tr>
@@ -86,14 +86,14 @@
<p><B>Priority Inheritance Protocol Proved Correct.</B>
(with Zhang and Wu) Journal version. Submitted.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/pip.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/pip.pdf">pdf</A>]
<p><B>POSIX Lexing with Derivatives of Regular Expressions</B>
(with Ausaf and Dyckhoff)
In Proceedings of the 7th International Conference on Interactive Theorem Proving (ITP 2016).
In Volume <A HREF="https://link.springer.com/book/10.1007/978-3-319-43144-4">9807</A>
of Lecture Notes in Computer Science. Pages 69-86. Springer Verlag, 2016.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/posix.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/posix.pdf">pdf</A>]
</TD>
</TR>
@@ -112,7 +112,7 @@
<p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions.</B>
(with Wu and Zhang) In
Journal of Automatic Reasoning, 2014, Vol. 52(4), 451-480.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/rexp.pdf">pdf</A>]
<p><B>Revisiting Zucker's Work on the Correspondence Between Cut-Elimination and
Normalisation.</B> In Advances in Natural Deduction: A Celebration of Dag Prawitz's Work,
Trends in Logic Series, Volume 39, 2014, Pages 31-50.
@@ -128,7 +128,7 @@
Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in
Computer Science. Pages 147-162.
© <A HREF="http://link.springer.com/chapter/10.1007/978-3-642-39634-2_13">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tm.pdf">pdf</A>]<BR><BR>
(The phrase in the abstract is meant to say "we tie the knot ... ". This typo
is corrected in the version above.)
@@ -138,7 +138,7 @@
and Proofs (CPP 2013). In Volume 8307 of Lecture Notes in Computer Science.
Pages 292-307.
© <A HREF="http://link.springer.com/chapter/10.1007/978-3-319-03545-1_19">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rc.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/rc.pdf">pdf</A>]
</TD>
</TR>
@@ -149,14 +149,14 @@
<p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
(with Kaliszyk) Journal of Logical
Methods in Computer Science, Volume 8 (2:14), 2012. 35 pages.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lmcs.pdf">pdf</A>]
<p><b>Priority Inheritance Protocol Proved Correct.</B>
(with Zhang and Wu) In Proceedings of the 3rd Conference on Interactive
Theorem Proving (ITP 2012). In Volume 7406 of Lecture Notes in
Computer Science. Pages 217-232.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-32347-8_15">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/itp-12.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/itp-12.pdf">pdf</A>]<BR><BR>
(In the published version is a bogus sentence after the definition
of detached and also a typo in the definition of schs. Both are corrected
@@ -173,7 +173,7 @@
In Proceedings of the 20th European Symposium on Programming (ESOP 2011).
In Volume 6602 of Lecture Notes in Computer Science. Pages 480-500.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-19718-5_25">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/esop-11.pdf">pdf</A>]
<p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof
Pearl).</B>
@@ -181,13 +181,13 @@
In Proceedings of the 2nd Conference on Interactive Theorem Proving (ITP 2011).
In Volume 6898 of Lecture Notes in Computer Science. Pages 341-356.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-22863-6_25">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/itp-11.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/itp-11.pdf">pdf</A>]
<p><B>Quotients Revisited for Isabelle/HOL.</B>
(with Kaliszyk) In Proceedings of the ACM Symposium on Applied
Computing (SAC 2011), Software Verification and Testing track,
Pages 1639-1644.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/sac-11.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/sac-11.pdf">pdf</A>]<BR><BR>
(We silently assume in this paper to only lift from types that have
covariant type-constructors. Many thanks to Ondřej Kunčar,
@@ -198,7 +198,7 @@
In Proceedings of the 1st Conference on Certified Programs and Proofs (CPP 2011).
In Volume 7086 of Lecture Notes in Computer Science. Pages 280-295.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-25379-9_21">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cpp-11.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/cpp-11.pdf">pdf</A>]
</TD>
</TR>
@@ -210,17 +210,17 @@
In Proceedings of the 1st Conference on Interactive Theorem Proving (ITP 2010).
In Volume 6172 of Lecture Notes in Computer Science. Pages 35-50.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-14052-5_5">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nominal-atoms.pdf">pdf</A>]
<p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer)
In <A HREF="http://doi.acm.org/10.1145/1877714.1877721">
ACM Transactions on Computational Logic</A>, Vol 12(2), Pages 15:1 - 15:42, 2011.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/LF/">technical report</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/LF/">technical report</A>]
<p><B>Nominal Unification Revisited.</B>
(invited paper) In Proceedings of the 24th Workshop on Unification (UNIF 2010).
In Volume 42 of Electronic Proceedings in Theoretical Computer Science. Pages 1-11, 2010.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/univ-10.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/univ-10.pdf">pdf</A>]
</TD>
</TR>
@@ -232,7 +232,7 @@
(with Narboux) In Proceedings of the 3rd Workshop on Logical and Semantic
Frameworks with Applications (LFSA'08). Electronic
Notes in Theoretical Computer Science, 247, Pages 139-155, 2009.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/manual/SOS.pdf">pdf</A>].
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/manual/SOS.pdf">pdf</A>].
<p><B>Proceedings of Theorem Proving in Higher Order Logics (TPHOLs'09).</B>
(with Berghofer, Nipkow and Wenzel) Volume 5674 of Lecture Notes in
@@ -243,7 +243,7 @@
From Semantics to Computer Science, Essays in Honour of Gilles Kahn,
edited by Bertot, Huet, Levy and Plotkin. Cambridge
University Press, 2009. Pages 363-382.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/w-07.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/w-07.pdf">pdf</A>]
</TD>
</TR>
@@ -253,15 +253,15 @@
<p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer) In Proceedings of the
23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
June 2008. Pages 45-56.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
- information is <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/LF/index.html">elsewhere</A>.
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lics-08.pdf">pdf</A>] More
+ information is <A HREF="http://nms.kcl.ac.uk/christian.urban/Nominal/LF/index.html">elsewhere</A>.
<p><B>Nominal Inversion Principles.</B> (with Berghofer)
In Proceedings of 21st International Conference on Theorem Proving in
Higher Order Logics (TPHOLs'08). In Volume 5170 of Lecture Notes in
Computer Science. Pages 71-85.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-71067-7_10">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tphols-08.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tphols-08.pdf">pdf</A>]<BR><BR>
(Note that the proof in figure 3 is chosen as an illustrative example to
show how to use inversion principles (the main topic of the paper). If one
@@ -284,15 +284,15 @@
and Applications (RTA 2008). In Volume 5117 of Lecture Notes in Computer Science.
Pages 409-424.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-70590-1_28">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/rta-08.pdf">pdf</A>]<BR><BR>
(This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising
the proof in Nominal Isabelle.)
<p><B>How to Prove False using the Variable Convention.</B>
Appeared as a poster at TTVSI (Mike fest), 1 page.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-08.pdf">poster</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/mike-poster-abstract-08.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/mike-poster-08.pdf">poster</A>]
</TD>
</TR>
@@ -305,25 +305,25 @@
of Lecture Notes in Artificial Intelligence. Bremen, Germany.
July 2007. Pages 35-50.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-73595-3_4">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.pdf">pdf</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/cade07.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/cade07.ps">ps</A>]
<BR><BR>This paper supersedes the MERLIN-paper from 2005.
<p><B>Nominal Techniques in Isabelle/HOL.</B> In
Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps">ps</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-tech.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-tech.pdf">pdf</A>]
<p><B>Strong Induction Principles in the Locally Nameless
Representation of Binders (Preliminary Notes).</B> (with Pollack) A shorter version
of this paper was accepted at WMM'07.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ln.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/ln.pdf">pdf</A>]
<p><B>Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.</B>
(with Narboux) In Proceedings of the International Workshop on Logical Frameworks and
Meta-Languages: Theory and Practice (LFMTP 2007). Electronic Notes in
Theoretical Computer Science. Vol. 196. Pages 3-18.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
(There is a minor problem in the statement on page 4 where we write that alpha-renamings
are required in order to show the equivalence of Q-Beta and Q-Beta': While the equivalence
@@ -343,7 +343,7 @@
<p><B>Proof Theory of Classical Propositional Calculus.</B>
(with Hyland, Bellin and Robinson) In Theoretical Computer
Science 2006. Vol. 364(2). Pages 143-170.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/class-tcs.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/class-tcs.ps">ps</A>]
<p><B>A Recursion Combinator for Nominal Datatypes
Implemented in Isabelle/HOL.</B> (with Berghofer) In Proceedings of the 3rd
@@ -351,19 +351,19 @@
Seattle, USA. In volume 4130 of Lecture Notes in Artificial Intelligence.
Pages 498-512.
© <A HREF="http://link.springer.com/chapter/10.1007%2F11814771_41">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/ijcar-06.ps">ps</A>]
<p><B>Classical Logic is better than Intuitionistic Logic:
A Conjecture about Double-Negation Translations.</B> (with Ratiu) In Proceedings
of the 1st International Workshop on Classical Logic and Computation (CL & C 2006).
Venice, Italy. 20pp.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/clc-06.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/clc-06.ps">ps</A>]
<p><B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> (with Berghofer)
In Proceedings of the International Workshop on Logical Frameworks and
Meta-Languages: Theory and Practice (LFMTP 2006). Electronic Notes in
Theoretical Computer Science. Vol. 174(5). Pages 53-67.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/lfmtp-06.ps">ps</A>]
</TD>
</TR>
@@ -373,8 +373,8 @@
<p><B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions.</B> (with Norrish)
In Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
Binding and Names (MERLIN 2005). Tallinn, Estonia. September 2005. Pages 25-32. © ACM, Inc.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps">ps</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/merlin-05.pdf">pdf</A>]
<p>
(There was a small typo in the definition of permutation equality, which has been corrected
in the versions above. This paper received favourable comments on the
@@ -384,7 +384,7 @@
Conference on Automated Deduction (CADE 2005). In volume 3632 of Lecture Notes in Artificial
Intelligence. Tallinn, Estonia. July 2005. Pages 38-53.
© <A HREF="http://link.springer.com/chapter/10.1007%2F11532231_4">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nom-cade-05.ps">ps</A>]
<p>
(This paper is superseded by the journal version in 2007.)
@@ -392,7 +392,7 @@
International Conference on Typed Lambda Calculi and Applications (TLCA 2005).
In Volume 3461 of Lecture Notes in Computer Science. Nara, Japan. April 2005. Pages 401-416.
© <A HREF="http://link.springer.com/chapter/10.1007%2F11417170_29">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/alpha-tlca.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/alpha-tlca.ps">ps</A>]
</TD>
</TR>
@@ -403,8 +403,8 @@
<H3>2004</H3>
<p><B>Nominal Unification.</B> (with Pitts and Gabbay) In Theoretical Computer Science
2004. Vol. 323(1-3). Pages 473-497.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.ps">ps</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nomu-tcs.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nomu-tcs.pdf">pdf</A>]
<p><B>Nominal Techniques for Reasoning about Formal Languages.</B> Reader for an advanced
course at the ESSLLI summer school. 26 Pages. Appeared as LORIA technical report.
@@ -414,7 +414,7 @@
(ICLP 2004). In Volume 3132 of Lecture Notes in Computer Science. St-Malo, France.
September 2004. Pages 269-283.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-27775-0_19">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/alpha-iclp.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/alpha-iclp.ps">ps</A>]
</TD>
</TR>
@@ -426,18 +426,18 @@
(CSL & KGC 2003). In Volume 2803 of Lecture Notes in Computer Science. Vienna, Austria.
August 2003. Pages 513-527.
© <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-45220-1_41">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/nomu.ps">ps</A>]
<p><B>System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo
Alpha-Equivalence.</B> (with Cheney) In Proceedings of the 17th International Workshop on
Unification, UNIF'03. Valencia, Spain. June 2003. Technical Report
DSIC-II/12/03, Departamento de Sistemas Informaticos y Computacion,
Universidad Politecnica de Valencia, 2003. Pages 15-19.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/aprolog.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/aprolog.ps">ps</A>]
<p><B>Work in Progress: Logic Programming with Names and Binding.</B> (with Cheney)
CoLogNet Newsletter No. 4, 2003. Pages 25-28.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/aprolog-colognet.ps">ps</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/aprolog-colognet.ps">ps</A>]
</TD>
</TR>
@@ -447,7 +447,7 @@
<p><B>Strong Normalisation of Herbelin's Explicit Substitution Calculus with
Substitution Propagation.</B>
(with Dyckhoff) Journal of Logic and Computation, Volume 13, No 5, Pages 689-706.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/jlc-03.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/jlc-03.pdf">pdf</A>]
</TD>
</TR>
@@ -457,22 +457,22 @@
<H3>2001</H3>
<p><B>Strong Normalisation of Cut-Elimination in Classical Logic.</B> (with Bierman)
Fundamenta Informaticae, 45(1-2), January 2001, Pages 123-155.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/fi-01.ps.gz">ps.gz</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/fi-01.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/fi-01.ps.gz">ps.gz</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/fi-01.pdf">pdf</A>]
<p><B>Strong Normalisation of Herbelin's Explicit Substitution Calculus with
Substitution Propagation.</B> (with Dyckhoff) In Proceedings of the 4th
Workshop on Explicit Substitutions Theory and Applications (WESTAPP'01).
Logic Group Preprint series No 210. Utrecht, the Netherlands. May 2001. Pages 26-45.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/westapp-01.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/westapp-01.pdf">pdf</A>]
<p><B>Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.</B>
In Proceedings of the 5th International Conference on Typed Lambda Calculi and
Applications (TLCA 2001). In Volume 2044 of Lecture Notes in
Computer Science. Krakow, Poland. May 2001. Pages 415-429.
© <A HREF="http://link.springer.com/chapter/10.1007%2F3-540-45413-6_32">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.ps.gz">ps.gz</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.pdf">pdf</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tableaux-01.ps.gz">ps.gz</A>]
+ [<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tableaux-01.pdf">pdf</A>]
</TD>
</TR>
@@ -481,8 +481,8 @@
<H3>2000</H3>
<p><B>Classical Logic and Computation.</B>
Ph.D. Thesis, University of Cambridge. Supervised by Dr Gavin Bierman. October 2000.
-Some details are <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/PhD/">elsewhere</A>.
-[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Phd-Urban.ps.gz">ps.gz</A>]
+Some details are <A HREF="http://nms.kcl.ac.uk/christian.urban/PhD/">elsewhere</A>.
+[<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/Phd-Urban.ps.gz">ps.gz</A>]
</TD>
</TR>
@@ -494,8 +494,8 @@
Lambda Calculi and Applications (TLCA 1999). In Volume 1581 of Lecture Notes in
Computer Science. L'Aquila, Italy. April 1999. Pages 365-380.
© <A HREF="http://link.springer.com/chapter/10.1007%2F3-540-48959-2_26">Springer Verlag</A>
-[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.ps.gz">ps.gz</A>]
-[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.pdf">pdf</A>]
+[<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tlca-99.ps.gz">ps.gz</A>]
+[<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tlca-99.pdf">pdf</A>]
</TD>
</TR>
@@ -507,7 +507,7 @@
Analytic Tableaux and Related Methods (TABELAUX 1998). In Volume 1397 of Lecture Notes in
Artificial Intelligence. Oisterwijk, the Netherlands. May 1998. Pages 313-319.
© <A HREF="http://link.springer.com/chapter/10.1007%2F3-540-69778-0_31">Springer Verlag</A>
-[<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-98.ps.gz">ps.gz</A>]
+[<A HREF="http://nms.kcl.ac.uk/christian.urban/Publications/tableaux-98.ps.gz">ps.gz</A>]
</TD>
</TR>