110 <H3>2013</H3> |
110 <H3>2013</H3> |
111 <p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> |
111 <p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> |
112 (with Xu and Zhang) In Proceedings of the 4th Conference on Interactive |
112 (with Xu and Zhang) In Proceedings of the 4th Conference on Interactive |
113 Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in |
113 Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in |
114 Computer Science. Pages 147-162. |
114 Computer Science. Pages 147-162. |
|
115 © <A HREF="http://link.springer.com/chapter/10.1007/978-3-642-39634-2_13">Springer Verlag</A> |
115 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>] |
116 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>] |
116 <p><B>A Formal Model and Correctness Proof for an Access Control Policy Framework.</B> |
117 |
|
118 (The phrase in the abstract is meant to say " we tie the knot ... ". This typo |
|
119 is corrected in the version above.) |
|
120 |
|
121 <p><B>A Formal Model and Correctness Proof for an Access Control Policy Framework.</B> |
117 (with Wu and Zhang) In Proceedings of the 3rd Conference on Certified Programs |
122 (with Wu and Zhang) In Proceedings of the 3rd Conference on Certified Programs |
118 and Proofs (CPP 2013). In Lecture Notes in Computer Science. |
123 and Proofs (CPP 2013). In Lecture Notes in Computer Science. |
119 </TD> |
124 </TD> |
120 </TR> |
125 </TR> |
121 |
126 |
124 <TD BGCOLOR="FFFFFF" WIDTH="75%"> |
129 <TD BGCOLOR="FFFFFF" WIDTH="75%"> |
125 <H3>2012</H3> |
130 <H3>2012</H3> |
126 <p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> |
131 <p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> |
127 (with Kaliszyk) Journal of Logical |
132 (with Kaliszyk) Journal of Logical |
128 Methods in Computer Science, Volume 8 (2:14), 2012. 35 pages. |
133 Methods in Computer Science, Volume 8 (2:14), 2012. 35 pages. |
129 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>] |
134 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]<BR><BR> |
130 |
135 |
131 <p><b>Priority Inheritance Protocol Proved Correct.</B> |
136 <p><b>Priority Inheritance Protocol Proved Correct.</B> |
132 (with Zhang and Wu) In Proceedings of the 3rd Conference on Interactive |
137 (with Zhang and Wu) In Proceedings of the 3rd Conference on Interactive |
133 Theorem Proving (ITP 2012). In Volume 7406 of Lecture Notes in |
138 Theorem Proving (ITP 2012). In Volume 7406 of Lecture Notes in |
134 Computer Science. Pages 217-232. |
139 Computer Science. Pages 217-232. |
155 <p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof |
160 <p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof |
156 Pearl).</B> |
161 Pearl).</B> |
157 (with Wu and Zhang) |
162 (with Wu and Zhang) |
158 In Proceedings of the 2nd Conference on Interactive Theorem Proving (ITP 2011). |
163 In Proceedings of the 2nd Conference on Interactive Theorem Proving (ITP 2011). |
159 In Volume 6898 of Lecture Notes in Computer Science. Pages 341-356. |
164 In Volume 6898 of Lecture Notes in Computer Science. Pages 341-356. |
160 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6898.htm">Springer Verlag</A> |
165 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-22863-6_25">Springer Verlag</A> |
161 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/itp-11.pdf">pdf</A>] |
166 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/itp-11.pdf">pdf</A>] |
162 |
167 |
163 <p><B>Quotients Revisited for Isabelle/HOL.</B> |
168 <p><B>Quotients Revisited for Isabelle/HOL.</B> |
164 (with Kaliszyk) In Proceedings of the ACM Symposium on Applied |
169 (with Kaliszyk) In Proceedings of the ACM Symposium on Applied |
165 Computing (SAC 2011), Software Verification and Testing track, |
170 Computing (SAC 2011), Software Verification and Testing track, |
172 Appendix, which are corrected in the pdf-file above. Thanks!) |
177 Appendix, which are corrected in the pdf-file above. Thanks!) |
173 |
178 |
174 <p><B>Mechanizing the Metatheory of Mini-XQuery.</B> (with Cheney) |
179 <p><B>Mechanizing the Metatheory of Mini-XQuery.</B> (with Cheney) |
175 In Proceedings of the 1st Conference on Certified Programs and Proofs (CPP 2011). |
180 In Proceedings of the 1st Conference on Certified Programs and Proofs (CPP 2011). |
176 In Volume 7086 of Lecture Notes in Computer Science. Pages 280-295. |
181 In Volume 7086 of Lecture Notes in Computer Science. Pages 280-295. |
177 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t7086.htm">Springer Verlag</A> |
182 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-25379-9_21">Springer Verlag</A> |
178 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cpp-11.pdf">pdf</A>] |
183 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cpp-11.pdf">pdf</A>] |
179 |
184 |
180 </TD> |
185 </TD> |
181 </TR> |
186 </TR> |
182 |
187 |
184 <TD BGCOLOR="FFFFFF" WIDTH="75%"> |
189 <TD BGCOLOR="FFFFFF" WIDTH="75%"> |
185 <H3>2010</H3> |
190 <H3>2010</H3> |
186 <p><B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> (with Huffman) |
191 <p><B>Proof Pearl: A New Foundation for Nominal Isabelle.</B> (with Huffman) |
187 In Proceedings of the 1st Conference on Interactive Theorem Proving (ITP 2010). |
192 In Proceedings of the 1st Conference on Interactive Theorem Proving (ITP 2010). |
188 In Volume 6172 of Lecture Notes in Computer Science. Pages 35-50. |
193 In Volume 6172 of Lecture Notes in Computer Science. Pages 35-50. |
189 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t6172.htm">Springer Verlag</A> |
194 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-642-14052-5_5">Springer Verlag</A> |
190 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>] |
195 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>] |
191 |
196 |
192 <p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer) |
197 <p><B>Mechanizing the Metatheory of LF.</B> (with Cheney and Berghofer) |
193 In <A HREF="http://doi.acm.org/10.1145/1877714.1877721"> |
198 In <A HREF="http://doi.acm.org/10.1145/1877714.1877721"> |
194 ACM Transactions on Computational Logic</A>, Vol 12(2), Pages 15:1 - 15:42, 2011. |
199 ACM Transactions on Computational Logic</A>, Vol 12(2), Pages 15:1 - 15:42, 2011. |
212 [<A HREF="http://isabelle.in.tum.de/nominal/manual/SOS.pdf">pdf</A>]. |
217 [<A HREF="http://isabelle.in.tum.de/nominal/manual/SOS.pdf">pdf</A>]. |
213 |
218 |
214 <p><B>Proceedings of Theorem Proving in Higher Order Logics (TPHOLs'09).</B> |
219 <p><B>Proceedings of Theorem Proving in Higher Order Logics (TPHOLs'09).</B> |
215 (with Berghofer, Nipkow and Wenzel) Volume 5674 of Lecture Notes in |
220 (with Berghofer, Nipkow and Wenzel) Volume 5674 of Lecture Notes in |
216 Computer Science, 2009. |
221 Computer Science, 2009. |
217 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5674.htm">Springer Verlag</A> |
222 © <A HREF="http://link.springer.com/book/10.1007/978-3-642-03359-9/page/1">Springer Verlag</A> |
218 |
223 |
219 <p><B>Nominal Verification of W.</B> (with Nipkow) |
224 <p><B>Nominal Verification of W.</B> (with Nipkow) |
220 From Semantics to Computer Science, Essays in Honour of Gilles Kahn, |
225 From Semantics to Computer Science, Essays in Honour of Gilles Kahn, |
221 edited by Bertot, Huet, Levy and Plotkin. Cambridge |
226 edited by Bertot, Huet, Levy and Plotkin. Cambridge |
222 University Press, 2009. Pages 363-382. |
227 University Press, 2009. Pages 363-382. |
235 |
240 |
236 <p><B>Nominal Inversion Principles.</B> (with Berghofer) |
241 <p><B>Nominal Inversion Principles.</B> (with Berghofer) |
237 In Proceedings of 21st International Conference on Theorem Proving in |
242 In Proceedings of 21st International Conference on Theorem Proving in |
238 Higher Order Logics (TPHOLs'08). In Volume 5170 of Lecture Notes in |
243 Higher Order Logics (TPHOLs'08). In Volume 5170 of Lecture Notes in |
239 Computer Science. Pages 71-85. |
244 Computer Science. Pages 71-85. |
240 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5170.htm">Springer Verlag</A> |
245 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-71067-7_10">Springer Verlag</A> |
241 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tphols-08.pdf">pdf</A>]<BR><BR> |
246 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tphols-08.pdf">pdf</A>]<BR><BR> |
242 |
247 |
243 (Note that the proof in figure 3 is chosen as an illustrative example to |
248 (Note that the proof in figure 3 is chosen as an illustrative example to |
244 show how to use inversion principles (the main topic of the paper). If one |
249 show how to use inversion principles (the main topic of the paper). If one |
245 does the induction on the beta-reduction relation, instead of the typing |
250 does the induction on the beta-reduction relation, instead of the typing |
250 <p><B>Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in |
255 <p><B>Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in |
251 Nominal Isabelle.</B> (with Chapman and McKinna) |
256 Nominal Isabelle.</B> (with Chapman and McKinna) |
252 In Proceedings of 9th International Conference on Artificial Intelligence |
257 In Proceedings of 9th International Conference on Artificial Intelligence |
253 and Symbolic Computation (AISC'08). In Volume 5144 of Lecture Notes in |
258 and Symbolic Computation (AISC'08). In Volume 5144 of Lecture Notes in |
254 Artificial Intelligene. Pages 38-52. |
259 Artificial Intelligene. Pages 38-52. |
255 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5144.htm">Springer Verlag</A> |
260 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-85110-3_5">Springer Verlag</A> |
256 |
261 |
257 |
262 |
258 |
263 |
259 <p><B>Revisiting Cut-Elimination: One Difficult Proof is Really a Proof.</B> (with Zhu) |
264 <p><B>Revisiting Cut-Elimination: One Difficult Proof is Really a Proof.</B> (with Zhu) |
260 In Proceedings of the 19th International Conference on Rewriting Techniques |
265 In Proceedings of the 19th International Conference on Rewriting Techniques |
261 and Applications (RTA 2008). In Volume 5117 of Lecture Notes in Computer Science. |
266 and Applications (RTA 2008). In Volume 5117 of Lecture Notes in Computer Science. |
262 Pages 409-424. |
267 Pages 409-424. |
263 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t5117.htm">Springer Verlag</A> |
268 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-70590-1_28">Springer Verlag</A> |
264 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR> |
269 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR> |
265 |
270 |
266 (This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising |
271 (This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising |
267 the proof in Nominal Isabelle.) |
272 the proof in Nominal Isabelle.) |
268 </TD> |
273 </TD> |
274 <p><B>Barendregt's Variable Convention in Rule Inductions.</B> |
279 <p><B>Barendregt's Variable Convention in Rule Inductions.</B> |
275 (with Berghofer and Norrish) In Proceedings of the 21th |
280 (with Berghofer and Norrish) In Proceedings of the 21th |
276 Conference on Automated Deduction (CADE 2007). In volume 4603 |
281 Conference on Automated Deduction (CADE 2007). In volume 4603 |
277 of Lecture Notes in Artificial Intelligence. Bremen, Germany. |
282 of Lecture Notes in Artificial Intelligence. Bremen, Germany. |
278 July 2007. Pages 35-50. |
283 July 2007. Pages 35-50. |
279 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm">Springer Verlag</A> |
284 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-73595-3_4">Springer Verlag</A> |
280 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.pdf">pdf</A>] |
285 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.pdf">pdf</A>] |
281 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps">ps</A>] |
286 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps">ps</A>] |
282 <BR><BR>This paper supersedes the MERLIN-paper from 2005. |
287 <BR><BR>This paper supersedes the MERLIN-paper from 2005. |
283 |
288 |
284 <p><B>Nominal Techniques in Isabelle/HOL.</B> In |
289 <p><B>Nominal Techniques in Isabelle/HOL.</B> In |
315 <p><B>A Recursion Combinator for Nominal Datatypes |
320 <p><B>A Recursion Combinator for Nominal Datatypes |
316 Implemented in Isabelle/HOL.</B> (with Berghofer) In Proceedings of the 3rd |
321 Implemented in Isabelle/HOL.</B> (with Berghofer) In Proceedings of the 3rd |
317 International Joint Conference on Automated Deduction (IJCAR 2006). |
322 International Joint Conference on Automated Deduction (IJCAR 2006). |
318 Seattle, USA. In volume 4130 of Lecture Notes in Artificial Intelligence. |
323 Seattle, USA. In volume 4130 of Lecture Notes in Artificial Intelligence. |
319 Pages 498-512. |
324 Pages 498-512. |
320 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4130.htm">Springer Verlag</A> |
325 © <A HREF="http://link.springer.com/chapter/10.1007%2F11814771_41">Springer Verlag</A> |
321 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps">ps</A>] |
326 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps">ps</A>] |
322 |
327 |
323 <p><B>Classical Logic is better than Intuitionistic Logic: |
328 <p><B>Classical Logic is better than Intuitionistic Logic: |
324 A Conjecture about Double-Negation Translations.</B> (with Ratiu) In Proceedings |
329 A Conjecture about Double-Negation Translations.</B> (with Ratiu) In Proceedings |
325 of the 1st International Workshop on Classical Logic and Computation (CL & C 2006). |
330 of the 1st International Workshop on Classical Logic and Computation (CL & C 2006). |
348 <A HREF="http://cs.nyu.edu/pipermail/fom/2005-December/009495.html">FOM</A> mailing-list.) |
353 <A HREF="http://cs.nyu.edu/pipermail/fom/2005-December/009495.html">FOM</A> mailing-list.) |
349 |
354 |
350 <p><B>Nominal Techniques in Isabelle/HOL.</B> (with Tasson) In Proceedings of the 20th |
355 <p><B>Nominal Techniques in Isabelle/HOL.</B> (with Tasson) In Proceedings of the 20th |
351 Conference on Automated Deduction (CADE 2005). In volume 3632 of Lecture Notes in Artificial |
356 Conference on Automated Deduction (CADE 2005). In volume 3632 of Lecture Notes in Artificial |
352 Intelligence. Tallinn, Estonia. July 2005. Pages 38-53. |
357 Intelligence. Tallinn, Estonia. July 2005. Pages 38-53. |
353 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3632.htm">Springer Verlag</A> |
358 © <A HREF="http://link.springer.com/chapter/10.1007%2F11532231_4">Springer Verlag</A> |
354 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">ps</A>] |
359 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-cade-05.ps">ps</A>] |
355 |
360 |
356 <p><B>Avoiding Equivariance in Alpha-Prolog.</B> (with Cheney) In Proceedings of the 7th |
361 <p><B>Avoiding Equivariance in Alpha-Prolog.</B> (with Cheney) In Proceedings of the 7th |
357 International Conference on Typed Lambda Calculi and Applications (TLCA 2005). |
362 International Conference on Typed Lambda Calculi and Applications (TLCA 2005). |
358 In Volume 3461 of Lecture Notes in Computer Science. Nara, Japan. April 2005. Pages 401-416. |
363 In Volume 3461 of Lecture Notes in Computer Science. Nara, Japan. April 2005. Pages 401-416. |
375 |
380 |
376 <p><B>Alpha-Prolog: A Logic Programming Language with Names, Binding and Alpha-Equivalence.</B> |
381 <p><B>Alpha-Prolog: A Logic Programming Language with Names, Binding and Alpha-Equivalence.</B> |
377 (with Cheney) In Proceedings of the International Conference on Logic Programming |
382 (with Cheney) In Proceedings of the International Conference on Logic Programming |
378 (ICLP 2004). In Volume 3132 of Lecture Notes in Computer Science. St-Malo, France. |
383 (ICLP 2004). In Volume 3132 of Lecture Notes in Computer Science. St-Malo, France. |
379 September 2004. Pages 269-283. |
384 September 2004. Pages 269-283. |
380 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t3132.htm">Springer Verlag</A> |
385 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-27775-0_19">Springer Verlag</A> |
381 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/alpha-iclp.ps">ps</A>] |
386 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/alpha-iclp.ps">ps</A>] |
382 </TD> |
387 </TD> |
383 </TR> |
388 </TR> |
384 |
389 |
385 <TR> |
390 <TR> |
387 <H3>2003</H3> |
392 <H3>2003</H3> |
388 <p><B>Nominal Unification.</B> (with Pitts and Gabbay) |
393 <p><B>Nominal Unification.</B> (with Pitts and Gabbay) |
389 In Proceedings of the Computer Science Logic and 8th Kurt Gödel Colloquium |
394 In Proceedings of the Computer Science Logic and 8th Kurt Gödel Colloquium |
390 (CSL & KGC 2003). In Volume 2803 of Lecture Notes in Computer Science. Vienna, Austria. |
395 (CSL & KGC 2003). In Volume 2803 of Lecture Notes in Computer Science. Vienna, Austria. |
391 August 2003. Pages 513-527. |
396 August 2003. Pages 513-527. |
392 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t2803.htm">Springer Verlag</A> |
397 © <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-45220-1_41">Springer Verlag</A> |
393 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu.ps">ps</A>] |
398 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nomu.ps">ps</A>] |
394 |
399 |
395 <p><B>System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo |
400 <p><B>System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo |
396 Alpha-Equivalence.</B> (with Cheney) In Proceedings of the 17th International Workshop on |
401 Alpha-Equivalence.</B> (with Cheney) In Proceedings of the 17th International Workshop on |
397 Unification, UNIF'03. Valencia, Spain. June 2003. Technical Report |
402 Unification, UNIF'03. Valencia, Spain. June 2003. Technical Report |
436 |
441 |
437 <p><B>Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.</B> |
442 <p><B>Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.</B> |
438 In Proceedings of the 5th International Conference on Typed Lambda Calculi and |
443 In Proceedings of the 5th International Conference on Typed Lambda Calculi and |
439 Applications (TLCA 2001). In Volume 2044 of Lecture Notes in |
444 Applications (TLCA 2001). In Volume 2044 of Lecture Notes in |
440 Computer Science. Krakow, Poland. May 2001. Pages 415-429. |
445 Computer Science. Krakow, Poland. May 2001. Pages 415-429. |
441 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t2044.htm">Springer Verlag</A> |
446 © <A HREF="http://link.springer.com/chapter/10.1007%2F3-540-45413-6_32">Springer Verlag</A> |
442 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.ps.gz">ps.gz</A>] |
447 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.ps.gz">ps.gz</A>] |
443 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.pdf">pdf</A>] |
448 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-01.pdf">pdf</A>] |
444 </TD> |
449 </TD> |
445 </TR> |
450 </TR> |
446 |
451 |
459 <H3>1999</H3> |
464 <H3>1999</H3> |
460 <p><B> Strong Normalisation of Cut-Elimination in Classical Logic.</B> |
465 <p><B> Strong Normalisation of Cut-Elimination in Classical Logic.</B> |
461 (with Bierman) In Proceedings of the 5th International Conference on Typed |
466 (with Bierman) In Proceedings of the 5th International Conference on Typed |
462 Lambda Calculi and Applications (TLCA 1999). In Volume 1581 of Lecture Notes in |
467 Lambda Calculi and Applications (TLCA 1999). In Volume 1581 of Lecture Notes in |
463 Computer Science. L'Aquila, Italy. April 1999. Pages 365-380. |
468 Computer Science. L'Aquila, Italy. April 1999. Pages 365-380. |
464 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t1581.htm">Springer Verlag</A> |
469 © <A HREF="http://link.springer.com/chapter/10.1007%2F3-540-48959-2_26">Springer Verlag</A> |
465 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.ps.gz">ps.gz</A>] |
470 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.ps.gz">ps.gz</A>] |
466 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.pdf">pdf</A>] |
471 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tlca-99.pdf">pdf</A>] |
467 </TD> |
472 </TD> |
468 </TR> |
473 </TR> |
469 |
474 |
472 <H3>1998</H3> |
477 <H3>1998</H3> |
473 <p><B> Implementation of Proof Search in the Imperative Programming Language Pizza.</B> |
478 <p><B> Implementation of Proof Search in the Imperative Programming Language Pizza.</B> |
474 In Proceedings of the 7th International Conference on Automated Reasoning with |
479 In Proceedings of the 7th International Conference on Automated Reasoning with |
475 Analytic Tableaux and Related Methods (TABELAUX 1998). In Volume 1397 of Lecture Notes in |
480 Analytic Tableaux and Related Methods (TABELAUX 1998). In Volume 1397 of Lecture Notes in |
476 Artificial Intelligence. Oisterwijk, the Netherlands. May 1998. Pages 313-319. |
481 Artificial Intelligence. Oisterwijk, the Netherlands. May 1998. Pages 313-319. |
477 © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t1397.htm">Springer Verlag</A> |
482 © <A HREF="http://link.springer.com/chapter/10.1007%2F3-540-69778-0_31">Springer Verlag</A> |
478 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-98.ps.gz">ps.gz</A>] |
483 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tableaux-98.ps.gz">ps.gz</A>] |
479 </TD> |
484 </TD> |
480 </TR> |
485 </TR> |
481 |
486 |
482 <TR> |
487 <TR> |