|
2
|
1 |
<?xml version="1.0" encoding="utf-8"?>
|
|
|
2 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
3 |
<HEAD>
|
|
|
4 |
<TITLE> 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="17">
|
|
|
28 |
|
|
|
29 |
<B>Links</B><BR>
|
|
3
|
30 |
<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/">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">
|
|
2
|
46 |
</A>
|
|
|
47 |
</TD>
|
|
|
48 |
|
|
|
49 |
|
|
|
50 |
<!-- right column -->
|
|
|
51 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
52 |
<h2>Publications</h2>
|
|
|
53 |
<FONT COLOR="#800000"><B>Warning:</B></FONT>
|
|
|
54 |
Currently not all papers are available from this page.
|
|
|
55 |
Please email me for copies of the papers you cannot find.
|
|
|
56 |
</TD>
|
|
|
57 |
</TR>
|
|
|
58 |
|
|
|
59 |
<TR>
|
|
|
60 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
61 |
<H3>Pending</H3>
|
|
|
62 |
|
|
|
63 |
<p><B>Mechanizing the Metatheory of Mini-XQuery.</B>
|
|
|
64 |
(with Cheney) To appear at CPP 2011.
|
|
3
|
65 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/cpp-11.pdf">pdf</A>]
|
|
2
|
66 |
|
|
|
67 |
<p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions.</B>
|
|
|
68 |
(with Wu and Zhang) Journal version. Submitted.
|
|
3
|
69 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">pdf</A>]
|
|
2
|
70 |
|
|
|
71 |
<p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
|
|
|
72 |
(with Kaliszyk) Journal version. Submitted.
|
|
3
|
73 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]
|
|
2
|
74 |
|
|
|
75 |
<p><B>How to Prove False using the Variable Convention.</B>
|
|
|
76 |
Appears as a poster at TTVSI, 1 page.
|
|
3
|
77 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
|
|
|
78 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/mike-poster-08.pdf">poster</A>]
|
|
2
|
79 |
|
|
|
80 |
<p><B>Strong Induction Principles in the Locally Nameless
|
|
|
81 |
Representation of Binders (Preliminary Notes).</B> (with Pollack) A shorter version
|
|
|
82 |
of this paper was accepted at WMM'07.
|
|
3
|
83 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/ln.pdf">pdf</A>]
|
|
2
|
84 |
</TD>
|
|
|
85 |
</TR>
|
|
15
|
86 |
|
|
2
|
87 |
<TR>
|
|
|
88 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
89 |
<H3>2011</H3>
|
|
|
90 |
<p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
|
|
|
91 |
(with Kaliszyk)
|
|
|
92 |
In Proceedings of the 20th European Symposium on Programming (ESOP 2011).
|
|
|
93 |
In Volume 6602 of Lecture Notes in Computer Science. Pages 480-500.
|
|
|
94 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6602.htm">Springer Verlag</A>
|
|
3
|
95 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>]
|
|
2
|
96 |
|
|
|
97 |
<p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof
|
|
|
98 |
Pearl).</B>
|
|
|
99 |
(with Wu and Zhang)
|
|
|
100 |
In Proceedings of the 2nd Conference on Interactive Theorem Proving (ITP 2011).
|
|
|
101 |
In Volume 6898 of Lecture Notes in Computer Science. Pages 341-356.
|
|
|
102 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6898.htm">Springer Verlag</A>
|
|
3
|
103 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/itp-11.pdf">pdf</A>]
|
|
2
|
104 |
|
|
|
105 |
<p><B>Quotients Revisited for Isabelle/HOL.</B>
|
|
|
106 |
(with Kaliszyk) In Proceedings of the ACM Symposium on Applied
|
|
|
107 |
Computing (SAC 2011), Software Verification and Testing track,
|
|
|
108 |
Pages 1639-1644.
|
|
3
|
109 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/sac-11.pdf">pdf</A>]
|
|
2
|
110 |
</TD>
|
|
|
111 |
</TR>
|
|
|
112 |
|
|
15
|
113 |
<TR>
|
|
2
|
114 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
115 |
<H3>2010</H3>
|
|
|
116 |
<p><B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> (with Huffman)
|
|
|
117 |
In Proceedings of the 1st Conference on Interactive Theorem Proving (ITP 2010).
|
|
|
118 |
In Volume 6172 of Lecture Notes in Computer Science. Pages 35-50.
|
|
|
119 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6172.htm">Springer Verlag</A>
|
|
3
|
120 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
|
|
2
|
121 |
|
|
|
122 |
<p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer)
|
|
|
123 |
In <A HREF="http://doi.acm.org/10.1145/1877714.1877721">
|
|
|
124 |
ACM Transactions on Computational Logic</A>, Vol 12(2), Pages 15:1 - 15:42, 2011.
|
|
|
125 |
[<A HREF="http://isabelle.in.tum.de/nominal/LF/">technical report</A>]
|
|
|
126 |
|
|
|
127 |
<p><B>Nominal Unification Revisited.</B>
|
|
|
128 |
(invited paper) In Proceedings of the 24th Workshop on Unification (UNIF 2010).
|
|
|
129 |
In Volume 42 of Electronic Proceedings in Theoretical Computer Science. Pages 1-11, 2010.
|
|
3
|
130 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/univ-10.pdf">pdf</A>]
|
|
2
|
131 |
|
|
|
132 |
</TD>
|
|
|
133 |
</TR>
|
|
|
134 |
|
|
15
|
135 |
<TR>
|
|
2
|
136 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
137 |
<H3>2009</H3>
|
|
|
138 |
<p><B>Nominal Formalisations of Typical SOS Proofs.</B>
|
|
|
139 |
(with Narboux) In Proceedings of the 3rd Workshop on Logical and Semantic
|
|
|
140 |
Frameworks with Applications (LFSA'08). Electronic
|
|
|
141 |
Notes in Theoretical Computer Science, 247, Pages 139-155, 2009.
|
|
|
142 |
[<A HREF="http://isabelle.in.tum.de/nominal/manual/SOS.pdf">pdf</A>].
|
|
|
143 |
|
|
|
144 |
<p><B>Proceedings of Theorem Proving in Higher Order Logics (TPHOLs'09).</B>
|
|
|
145 |
(with Berghofer, Nipkow and Wenzel) Volume 5674 of Lecture Notes in
|
|
|
146 |
Computer Science, 2009.
|
|
|
147 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5674.htm">Springer Verlag</A>
|
|
|
148 |
|
|
|
149 |
<p><B>Nominal Verification of W.</B> (with Nipkow)
|
|
|
150 |
From Semantics to Computer Science, Essays in Honour of Gilles Kahn,
|
|
|
151 |
edited by Bertot, Huet, Levy and Plotkin. Cambridge
|
|
|
152 |
University Press, 2009. Pages 363-382.
|
|
3
|
153 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/w-07.pdf">pdf</A>]
|
|
2
|
154 |
</TD>
|
|
|
155 |
</TR>
|
|
|
156 |
|
|
|
157 |
<TR>
|
|
|
158 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
159 |
<H3>2008</H3>
|
|
|
160 |
<p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer) In Proceedings of the
|
|
|
161 |
23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
|
|
|
162 |
June 2008. Pages 45-56.
|
|
3
|
163 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
|
|
2
|
164 |
information is <A HREF="http://isabelle.in.tum.de/nominal/LF/index.html">elsewhere</A>.
|
|
|
165 |
|
|
|
166 |
<p><B>Nominal Inversion Principles.</B> (with Berghofer)
|
|
|
167 |
In Proceedings of 21st International Conference on Theorem Proving in
|
|
|
168 |
Higher Order Logics (TPHOLs'08). In Volume 5170 of Lecture Notes in
|
|
|
169 |
Computer Science. Pages 71-85.
|
|
|
170 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5170.htm">Springer Verlag</A>
|
|
3
|
171 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tphols-08.pdf">pdf</A>]<BR><BR>
|
|
2
|
172 |
|
|
|
173 |
(Note that the proof in figure 3 is chosen as an illustrative example to
|
|
|
174 |
show how to use inversion principles (the main topic of the paper). If one
|
|
|
175 |
does the induction on the beta-reduction relation, instead of the typing
|
|
|
176 |
relation, then the proof is almost trivial and can be found automatically
|
|
|
177 |
by Isabelle only using some very standard inversion principles for the
|
|
|
178 |
typing relation.)
|
|
|
179 |
|
|
|
180 |
<p><B>Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in
|
|
|
181 |
Nominal Isabelle.</B> (with Chapman and McKinna)
|
|
|
182 |
In Proceedings of 9th International Conference on Artificial Intelligence
|
|
|
183 |
and Symbolic Computation (AISC'08). In Volume 5144 of Lecture Notes in
|
|
|
184 |
Artificial Intelligene. Pages 38-52.
|
|
|
185 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5144.htm">Springer Verlag</A>
|
|
|
186 |
|
|
|
187 |
|
|
|
188 |
|
|
|
189 |
<p><B>Revisiting Cut-Elimination: One Difficult Proof is Really a Proof.</B> (with Zhu)
|
|
|
190 |
In Proceedings of the 19th International Conference on Rewriting Techniques
|
|
|
191 |
and Applications (RTA 2008). In Volume 5117 of Lecture Notes in Computer Science.
|
|
|
192 |
Pages 409-424.
|
|
|
193 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5117.htm">Springer Verlag</A>
|
|
3
|
194 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR>
|
|
2
|
195 |
|
|
|
196 |
(This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising
|
|
|
197 |
the proof in Nominal Isabelle.)
|
|
|
198 |
</TD>
|
|
|
199 |
</TR>
|
|
|
200 |
|
|
|
201 |
<TR>
|
|
|
202 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
203 |
<H3>2007</H3>
|
|
|
204 |
<p><B>Barendregt's Variable Convention in Rule Inductions.</B>
|
|
|
205 |
(with Berghofer and Norrish) In Proceedings of the 21th
|
|
|
206 |
Conference on Automated Deduction (CADE 2007). In volume 4603
|
|
|
207 |
of Lecture Notes in Artificial Intelligence. Bremen, Germany.
|
|
|
208 |
July 2007. Pages 35-50.
|
|
|
209 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm">Springer Verlag</A>
|
|
3
|
210 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/cade07.ps">ps</A>]
|
|
2
|
211 |
|
|
|
212 |
<BR><BR>This paper supersedes the MERLIN-paper from 2005.
|
|
|
213 |
|
|
|
214 |
<p><B>Nominal Techniques in Isabelle/HOL.</B> In
|
|
|
215 |
Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356.
|
|
3
|
216 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps">ps</A>]
|
|
|
217 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf">pdf</A>]
|
|
2
|
218 |
|
|
|
219 |
<p><B>Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.</B>
|
|
|
220 |
(with Narboux) In Proceedings of the International Workshop on Logical Frameworks and
|
|
|
221 |
Meta-Languages: Theory and Practice (LFMTP 2007). Electronic Notes in
|
|
|
222 |
Theoretical Computer Science. Vol. 196. Pages 3-18.
|
|
3
|
223 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
|
|
2
|
224 |
|
|
|
225 |
(There is a minor problem in the statement on page 4 where we write that alpha-renamings
|
|
|
226 |
are required in order to show the equivalence of Q-Beta and Q-Beta': While the equivalence
|
|
|
227 |
can be proved using alpha-renamings, it can also be proved by a careful analysis of the
|
|
|
228 |
available freshness-constraints.)
|
|
|
229 |
|
|
|
230 |
<p><B>Nominal Logic Programming.</B> (with Cheney)
|
|
|
231 |
In <A HREF="http://dl.acm.org/citation.cfm?id=1387675">
|
|
|
232 |
ACM Transactions on Programming Languages and Systems</A>,
|
|
|
233 |
2008, Vol. 30(5), Article 26, pages 1-47.
|
|
|
234 |
</TD>
|
|
|
235 |
</TR>
|
|
|
236 |
|
|
|
237 |
<TR>
|
|
|
238 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
239 |
<H3>2006</H3>
|
|
|
240 |
<p><B>Proof Theory of Classical Propositional Calculus.</B>
|
|
|
241 |
(with Hyland, Bellin and Robinson) In Theoretical Computer
|
|
|
242 |
Science 2006. Vol. 364(2). Pages 143-170.
|
|
3
|
243 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/class-tcs.ps">ps</A>]
|
|
2
|
244 |
|
|
|
245 |
<p><B>A Recursion Combinator for Nominal Datatypes
|
|
|
246 |
Implemented in Isabelle/HOL.</B> (with Berghofer) In Proceedings of the 3rd
|
|
|
247 |
International Joint Conference on Automated Deduction (IJCAR 2006).
|
|
|
248 |
Seattle, USA. In volume 4130 of Lecture Notes in Artificial Intelligence.
|
|
|
249 |
Pages 498-512.
|
|
|
250 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4130.htm">Springer Verlag</A>
|
|
3
|
251 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps">ps</A>]
|
|
2
|
252 |
|
|
|
253 |
<p><B>Classical Logic is better than Intuitionistic Logic:
|
|
|
254 |
A Conjecture about Double-Negation Translations.</B> (with Ratiu) In Proceedings
|
|
|
255 |
of the 1st International Workshop on Classical Logic and Computation (CL & C 2006).
|
|
|
256 |
Venice, Italy. 20pp.
|
|
3
|
257 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/clc-06.ps">ps</A>]
|
|
2
|
258 |
|
|
|
259 |
<p><B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B> (with Berghofer)
|
|
|
260 |
In Proceedings of the International Workshop on Logical Frameworks and
|
|
|
261 |
Meta-Languages: Theory and Practice (LFMTP 2006). Electronic Notes in
|
|
|
262 |
Theoretical Computer Science. Vol. 174(5). Pages 53-67.
|
|
3
|
263 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps">ps</A>]
|
|
2
|
264 |
</TD>
|
|
|
265 |
</TR>
|
|
|
266 |
|
|
|
267 |
<TR>
|
|
|
268 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
269 |
<H3>2005</H3>
|
|
|
270 |
<p><B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions.</B> (with Norrish)
|
|
|
271 |
In Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
|
|
|
272 |
Binding and Names (MERLIN 2005). Tallinn, Estonia. September 2005. Pages 25-32. © ACM, Inc.
|
|
3
|
273 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps">ps</A>]
|
|
|
274 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf">pdf</A>]
|
|
2
|
275 |
<p>
|
|
|
276 |
(There was a small typo in the definition of permutation equality, which has been corrected
|
|
|
277 |
in the versions above. This paper received favourable comments on the
|
|
|
278 |
<A HREF="http://cs.nyu.edu/pipermail/fom/2005-December/009495.html">FOM</A> mailing-list.)
|
|
|
279 |
|
|
|
280 |
<p><B>Nominal Techniques in Isabelle/HOL.</B> (with Tasson) In Proceedings of the 20th
|
|
|
281 |
Conference on Automated Deduction (CADE 2005). In volume 3632 of Lecture Notes in Artificial
|
|
|
282 |
Intelligence. Tallinn, Estonia. July 2005. Pages 38-53.
|
|
|
283 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3632.htm">Springer Verlag</A>
|
|
3
|
284 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">ps</A>]
|
|
2
|
285 |
|
|
|
286 |
<p><B>Avoiding Equivariance in Alpha-Prolog.</B> (with Cheney) In Proceedings of the 7th
|
|
|
287 |
International Conference on Typed Lambda Calculi and Applications (TLCA 2005).
|
|
|
288 |
In Volume 3461 of Lecture Notes in Computer Science. Nara, Japan. April 2005. Pages 401-416.
|
|
|
289 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3461.htm">Springer Verlag</A>
|
|
3
|
290 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/alpha-tlca.ps">ps</A>]
|
|
2
|
291 |
</TD>
|
|
|
292 |
</TR>
|
|
|
293 |
|
|
|
294 |
|
|
|
295 |
<TR>
|
|
|
296 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
297 |
<H3>2004</H3>
|
|
|
298 |
<p><B>Nominal Unification.</B> (with Pitts and Gabbay) In Theoretical Computer Science
|
|
|
299 |
2004. Vol. 323(1-3). Pages 473-497.
|
|
3
|
300 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.ps">ps</A>]
|
|
|
301 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nomu-tcs.pdf">pdf</A>]
|
|
2
|
302 |
|
|
|
303 |
<p><B>Nominal Techniques for Reasoning about Formal Languages.</B> Reader for an advanced
|
|
|
304 |
course at the ESSLLI summer school. 26 Pages. Appeared as LORIA technical report.
|
|
|
305 |
|
|
|
306 |
<p><B>Alpha-Prolog: A Logic Programming Language with Names, Binding and Alpha-Equivalence.</B>
|
|
|
307 |
(with Cheney) In Proceedings of the International Conference on Logic Programming
|
|
|
308 |
(ICLP 2004). In Volume 3132 of Lecture Notes in Computer Science. St-Malo, France.
|
|
|
309 |
September 2004. Pages 269-283.
|
|
|
310 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3132.htm">Springer Verlag</A>
|
|
3
|
311 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/alpha-iclp.ps">ps</A>]
|
|
2
|
312 |
</TD>
|
|
|
313 |
</TR>
|
|
|
314 |
|
|
|
315 |
<TR>
|
|
|
316 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
317 |
<H3>2003</H3>
|
|
|
318 |
<p><B>Nominal Unification.</B> (with Pitts and Gabbay)
|
|
|
319 |
In Proceedings of the Computer Science Logic and 8th Kurt Gödel Colloquium
|
|
|
320 |
(CSL & KGC 2003). In Volume 2803 of Lecture Notes in Computer Science. Vienna, Austria.
|
|
|
321 |
August 2003. Pages 513-527.
|
|
|
322 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t2803.htm">Springer Verlag</A>
|
|
3
|
323 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/nomu.ps">ps</A>]
|
|
2
|
324 |
|
|
|
325 |
<p><B>System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo
|
|
|
326 |
Alpha-Equivalence.</B> (with Cheney) In Proceedings of the 17th International Workshop on
|
|
|
327 |
Unification, UNIF'03. Valencia, Spain. June 2003. Technical Report
|
|
|
328 |
DSIC-II/12/03, Departamento de Sistemas Informaticos y Computacion,
|
|
|
329 |
Universidad Politecnica de Valencia, 2003. Pages 15-19.
|
|
3
|
330 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/aprolog.ps">ps</A>]
|
|
2
|
331 |
|
|
|
332 |
<p><B>Work in Progress: Logic Programming with Names and Binding.</B> (with Cheney)
|
|
|
333 |
CoLogNet Newsletter No. 4, 2003. Pages 25-28.
|
|
3
|
334 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/aprolog-colognet.ps">ps</A>]
|
|
2
|
335 |
</TD>
|
|
|
336 |
</TR>
|
|
|
337 |
|
|
|
338 |
<TR>
|
|
|
339 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
340 |
<H3>2002</H3>
|
|
|
341 |
<p><B>Strong Normalisation of Herbelin's Explicit Substitution Calculus with
|
|
|
342 |
Substitution Propagation.</B>
|
|
|
343 |
(with Dyckhoff) Journal of Logic and Computation, Volume 13, No 5, Pages 689-706.
|
|
3
|
344 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/jlc-03.pdf">pdf</A>]
|
|
2
|
345 |
|
|
|
346 |
<!--
|
|
|
347 |
<p><B>Revisiting Zucker's Work on the Correspondence Between Cut-Elimination and
|
|
|
348 |
Normalisation.</B> Accepted for publication in the proceedings of the natural deduction meeting in
|
|
|
349 |
Rio de Janeiro (will appear in the Advances in Natural Deduction volume published by Kluwer).-->
|
|
|
350 |
</TD>
|
|
|
351 |
</TR>
|
|
|
352 |
|
|
|
353 |
<TR>
|
|
|
354 |
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
|
|
|
355 |
<H3>2001</H3>
|
|
|
356 |
<p><B>Strong Normalisation of Cut-Elimination in Classical Logic.</B> (with Bierman)
|
|
|
357 |
Fundamenta Informaticae, 45(1-2), January 2001, Pages 123-155.
|
|
3
|
358 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/fi-01.ps.gz">ps.gz</A>]
|
|
|
359 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/fi-01.pdf">pdf</A>]
|
|
2
|
360 |
|
|
|
361 |
<p><B>Strong Normalisation of Herbelin's Explicit Substitution Calculus with
|
|
|
362 |
Substitution Propagation.</B> (with Dyckhoff) In Proceedings of the 4th
|
|
|
363 |
Workshop on Explicit Substitutions Theory and Applications (WESTAPP'01).
|
|
|
364 |
Logic Group Preprint series No 210. Utrecht, the Netherlands. May 2001. Pages 26-45.
|
|
3
|
365 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/westapp-01.pdf">pdf</A>]
|
|
2
|
366 |
|
|
|
367 |
<p><B>Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.</B>
|
|
|
368 |
In Proceedings of the 5th International Conference on Typed Lambda Calculi and
|
|
|
369 |
Applications (TLCA 2001). In Volume 2044 of Lecture Notes in
|
|
|
370 |
Computer Science. Krakow, Poland. May 2001. Pages 415-429.
|
|
|
371 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t2044.htm">Springer Verlag</A>
|
|
3
|
372 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.ps.gz">ps.gz</A>]
|
|
|
373 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.pdf">pdf</A>]
|
|
2
|
374 |
</TD>
|
|
|
375 |
</TR>
|
|
|
376 |
|
|
|
377 |
<TR>
|
|
|
378 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
379 |
<H3>2000</H3>
|
|
|
380 |
<p><B>Classical Logic and Computation.</B>
|
|
|
381 |
Ph.D. Thesis, University of Cambridge. Supervised by Dr Gavin Bierman. October 2000.
|
|
3
|
382 |
Some details are <A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/PhD/">elsewhere</A>.
|
|
|
383 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/Phd-Urban.ps.gz">ps.gz</A>]
|
|
2
|
384 |
</TD>
|
|
|
385 |
</TR>
|
|
|
386 |
|
|
|
387 |
<TR>
|
|
|
388 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
389 |
<H3>1999</H3>
|
|
|
390 |
<p><B> Strong Normalisation of Cut-Elimination in Classical Logic.</B>
|
|
|
391 |
(with Bierman) In Proceedings of the 5th International Conference on Typed
|
|
|
392 |
Lambda Calculi and Applications (TLCA 1999). In Volume 1581 of Lecture Notes in
|
|
|
393 |
Computer Science. L'Aquila, Italy. April 1999. Pages 365-380.
|
|
|
394 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t1581.htm">Springer Verlag</A>
|
|
3
|
395 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tlca-99.ps.gz">ps.gz</A>]
|
|
|
396 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tlca-99.pdf">pdf</A>]
|
|
2
|
397 |
</TD>
|
|
|
398 |
</TR>
|
|
|
399 |
|
|
|
400 |
<TR>
|
|
|
401 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
402 |
<H3>1998</H3>
|
|
|
403 |
<p><B> Implementation of Proof Search in the Imperative Programming Language Pizza.</B>
|
|
|
404 |
In Proceedings of the 7th International Conference on Automated Reasoning with
|
|
|
405 |
Analytic Tableaux and Related Methods (TABELAUX 1998). In Volume 1397 of Lecture Notes in
|
|
|
406 |
Artificial Intelligence. Oisterwijk, the Netherlands. May 1998. Pages 313-319.
|
|
|
407 |
© <A HREF="http://link.springer.de/link/service/series/0558/tocs/t1397.htm">Springer Verlag</A>
|
|
3
|
408 |
[<A HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/Publications/tableaux-98.ps.gz">ps.gz</A>]
|
|
2
|
409 |
</TD>
|
|
|
410 |
</TR>
|
|
|
411 |
|
|
|
412 |
<TR>
|
|
|
413 |
<TD BGCOLOR="FFFFFF" WIDTH="75%">
|
|
|
414 |
<H3>1996</H3>
|
|
|
415 |
<p><B> Forum and Its Implementation.</B>
|
|
|
416 |
M.Phil. Thesis, University of St Andrews. Supervised by Dr Roy Dyckhoff. April 1996.
|
|
|
417 |
</TD>
|
|
|
418 |
</TR>
|
|
|
419 |
|
|
|
420 |
|
|
|
421 |
</TABLE>
|
|
|
422 |
<P><!-- Created: Tue Mar 4 00:23:25 GMT 1997 -->
|
|
|
423 |
<!-- hhmts start -->
|
|
15
|
424 |
Last modified: Sat Oct 22 12:22:32 BST 2011
|
|
2
|
425 |
<!-- hhmts end -->
|
|
|
426 |
<a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
|
|
|
427 |
</BODY>
|
|
|
428 |
</HTML>
|