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