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