# HG changeset patch # User Christian Urban # Date 1319277118 -3600 # Node ID 60f6cd4991ad5d5c9da7a6762f5fb48bec9bfc4e # Parent f329c1f3b36563fed83f8d92d1aa2db3249bed8e changed address diff -r f329c1f3b365 -r 60f6cd4991ad index.html --- a/index.html Sat Oct 22 10:43:10 2011 +0100 +++ b/index.html Sat Oct 22 10:51:58 2011 +0100 @@ -2,7 +2,7 @@ Homepage of Christian Urban - + Links
-Home
-Publications
-Teaching
-Recent Talks
+Home
+Publications
+Teaching
+Recent Talks
My Research Group

Handy Information
-People in Logic
-Programming Languages
-Miscellaneous +People in Logic
+Programming Languages
+Miscellaneous

@@ -67,7 +67,7 @@ Fax +49 89 289 17307 - + @@ -189,13 +189,13 @@ Nominal Unification and Alpha-Prolog -Nominal unification is one outcome of +Nominal unification is one outcome of my involvement in the nominal logic project in Cambridge. Another is the logic programming language alpha-Prolog (joint work with Dr James Cheney), which uses nominal unification - click for details here. The nominal unification algorithm has been -formally verified in Isabelle. This +formally verified in Isabelle. This was possible since this unification algorithm is formulated in a simple first-order language (unlike other algorithms for higher-order unification). Prof. Daniel Friedman and his group use nominal @@ -218,8 +218,8 @@ as supervisor. My research in Cambridge was also very much influenced by Prof. Martin Hyland. Some details on my thesis "Classical Logic and Computation" are -elsewhere, including -a Java Applet that +elsewhere, including +a Java Applet that 'visualises' some of the results from the thesis. I completed the writing of the thesis in Marseille in the group of Prof. Jean-Yves Girard. My study in @@ -251,7 +251,7 @@ G4ip An implementation of G4ip using the imperative language Pizza can be found -here. +here. Pizza is a conservative extension of Java and a precursor of Scala. The implementation illustrates the technique of success continuations. diff -r f329c1f3b365 -r 60f6cd4991ad logic.html --- a/logic.html Sat Oct 22 10:43:10 2011 +0100 +++ b/logic.html Sat Oct 22 10:51:58 2011 +0100 @@ -2,7 +2,7 @@ Homepage of Christian Urban - + Links
-Home
-Publications
-Teaching
-Recent Talks
+Home
+Publications
+Teaching
+Recent Talks
My Research Group

Handy Information
-People in Logic
-Programming Languages
-Miscellaneous +People in Logic
+Programming Languages
+Miscellaneous

diff -r f329c1f3b365 -r 60f6cd4991ad misc.html --- a/misc.html Sat Oct 22 10:43:10 2011 +0100 +++ b/misc.html Sat Oct 22 10:51:58 2011 +0100 @@ -2,7 +2,7 @@ Christian Urban - + Links
-Home
-Publications
-Teaching
-Recent Talks
+Home
+Publications
+Teaching
+Recent Talks
My Research Group

Handy Information
-People in Logic
-Programming Languages
-Miscellaneous +People in Logic
+Programming Languages
+Miscellaneous

diff -r f329c1f3b365 -r 60f6cd4991ad publications.html --- a/publications.html Sat Oct 22 10:43:10 2011 +0100 +++ b/publications.html Sat Oct 22 10:51:58 2011 +0100 @@ -2,7 +2,7 @@ Christian Urban - + Links
-Home
-Publications
-Teaching
-Recent Talks
+Home
+Publications
+Teaching
+Recent Talks
My Research Group

Handy Information
-People in Logic
-Programming Languages
-Miscellaneous +People in Logic
+Programming Languages
+Miscellaneous

@@ -62,25 +62,25 @@

Mechanizing the Metatheory of Mini-XQuery. (with Cheney) To appear at CPP 2011. - [pdf] + [pdf]

A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions. (with Wu and Zhang) Journal version. Submitted. - [pdf] + [pdf]

General Bindings and Alpha-Equivalence in Nominal Isabelle. (with Kaliszyk) Journal version. Submitted. - [pdf] + [pdf]

How to Prove False using the Variable Convention. Appears as a poster at TTVSI, 1 page. - [pdf] - [poster] + [pdf] + [poster]

Strong Induction Principles in the Locally Nameless Representation of Binders (Preliminary Notes). (with Pollack) A shorter version of this paper was accepted at WMM'07. - [pdf] + [pdf] @@ -92,7 +92,7 @@ In Proceedings of the 20th European Symposium on Programming (ESOP 2011). In Volume 6602 of Lecture Notes in Computer Science. Pages 480-500. © Springer Verlag - [pdf] + [pdf]

A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof Pearl). @@ -100,13 +100,13 @@ In Proceedings of the 2nd Conference on Interactive Theorem Proving (ITP 2011). In Volume 6898 of Lecture Notes in Computer Science. Pages 341-356. © Springer Verlag - [pdf] + [pdf]

Quotients Revisited for Isabelle/HOL. (with Kaliszyk) In Proceedings of the ACM Symposium on Applied Computing (SAC 2011), Software Verification and Testing track, Pages 1639-1644. - [pdf] + [pdf] @@ -116,7 +116,7 @@ In Proceedings of the 1st Conference on Interactive Theorem Proving (ITP 2010). In Volume 6172 of Lecture Notes in Computer Science. Pages 35-50. © Springer Verlag - [pdf] + [pdf]

Mechanizing the Metatheory of LF. (with Cheney and Berghofer) In @@ -126,7 +126,7 @@

Nominal Unification Revisited. (invited paper) In Proceedings of the 24th Workshop on Unification (UNIF 2010). In Volume 42 of Electronic Proceedings in Theoretical Computer Science. Pages 1-11, 2010. - [pdf] + [pdf] @@ -148,7 +148,7 @@ From Semantics to Computer Science, Essays in Honour of Gilles Kahn, edited by Bertot, Huet, Levy and Plotkin. Cambridge University Press, 2009. Pages 363-382. - [pdf] + [pdf] @@ -158,7 +158,7 @@

Mechanizing the Metatheory of LF. (with Cheney and Berghofer) In Proceedings of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society, June 2008. Pages 45-56. - [pdf] More + [pdf] More information is elsewhere.

Nominal Inversion Principles. (with Berghofer) @@ -166,7 +166,7 @@ Higher Order Logics (TPHOLs'08). In Volume 5170 of Lecture Notes in Computer Science. Pages 71-85. © Springer Verlag - [pdf]

+ [pdf]

(Note that the proof in figure 3 is chosen as an illustrative example to show how to use inversion principles (the main topic of the paper). If one @@ -189,7 +189,7 @@ and Applications (RTA 2008). In Volume 5117 of Lecture Notes in Computer Science. Pages 409-424. © Springer Verlag - [pdf]

+ [pdf]

(This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising the proof in Nominal Isabelle.) @@ -205,20 +205,20 @@ of Lecture Notes in Artificial Intelligence. Bremen, Germany. July 2007. Pages 35-50. © Springer Verlag - [ps] + [ps]

This paper supersedes the MERLIN-paper from 2005.

Nominal Techniques in Isabelle/HOL. In Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356. - [ps] - [pdf] + [ps] + [pdf]

Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking. (with Narboux) In Proceedings of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2007). Electronic Notes in Theoretical Computer Science. Vol. 196. Pages 3-18. - [pdf]

+ [pdf]

(There is a minor problem in the statement on page 4 where we write that alpha-renamings are required in order to show the equivalence of Q-Beta and Q-Beta': While the equivalence @@ -238,7 +238,7 @@

Proof Theory of Classical Propositional Calculus. (with Hyland, Bellin and Robinson) In Theoretical Computer Science 2006. Vol. 364(2). Pages 143-170. - [ps] + [ps]

A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. (with Berghofer) In Proceedings of the 3rd @@ -246,19 +246,19 @@ Seattle, USA. In volume 4130 of Lecture Notes in Artificial Intelligence. Pages 498-512. © Springer Verlag - [ps] + [ps]

Classical Logic is better than Intuitionistic Logic: A Conjecture about Double-Negation Translations. (with Ratiu) In Proceedings of the 1st International Workshop on Classical Logic and Computation (CL & C 2006). Venice, Italy. 20pp. - [ps] + [ps]

A Head-to-Head Comparison of de Bruijn Indices and Names. (with Berghofer) In Proceedings of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2006). Electronic Notes in Theoretical Computer Science. Vol. 174(5). Pages 53-67. - [ps] + [ps] @@ -268,8 +268,8 @@

A Formal Treatment of the Barendregt Variable Convention in Rule Inductions. (with Norrish) In Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable Binding and Names (MERLIN 2005). Tallinn, Estonia. September 2005. Pages 25-32. © ACM, Inc. - [ps] - [pdf] + [ps] + [pdf]

(There was a small typo in the definition of permutation equality, which has been corrected in the versions above. This paper received favourable comments on the @@ -279,13 +279,13 @@ Conference on Automated Deduction (CADE 2005). In volume 3632 of Lecture Notes in Artificial Intelligence. Tallinn, Estonia. July 2005. Pages 38-53. © Springer Verlag - [ps] + [ps]

Avoiding Equivariance in Alpha-Prolog. (with Cheney) In Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA 2005). In Volume 3461 of Lecture Notes in Computer Science. Nara, Japan. April 2005. Pages 401-416. © Springer Verlag - [ps] + [ps] @@ -295,8 +295,8 @@

2004

Nominal Unification. (with Pitts and Gabbay) In Theoretical Computer Science 2004. Vol. 323(1-3). Pages 473-497. - [ps] - [pdf] + [ps] + [pdf]

Nominal Techniques for Reasoning about Formal Languages. Reader for an advanced course at the ESSLLI summer school. 26 Pages. Appeared as LORIA technical report. @@ -306,7 +306,7 @@ (ICLP 2004). In Volume 3132 of Lecture Notes in Computer Science. St-Malo, France. September 2004. Pages 269-283. © Springer Verlag - [ps] + [ps] @@ -318,18 +318,18 @@ (CSL & KGC 2003). In Volume 2803 of Lecture Notes in Computer Science. Vienna, Austria. August 2003. Pages 513-527. © Springer Verlag - [ps] + [ps]

System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo Alpha-Equivalence. (with Cheney) In Proceedings of the 17th International Workshop on Unification, UNIF'03. Valencia, Spain. June 2003. Technical Report DSIC-II/12/03, Departamento de Sistemas Informaticos y Computacion, Universidad Politecnica de Valencia, 2003. Pages 15-19. - [ps] + [ps]

Work in Progress: Logic Programming with Names and Binding. (with Cheney) CoLogNet Newsletter No. 4, 2003. Pages 25-28. - [ps] + [ps] @@ -339,7 +339,7 @@

Strong Normalisation of Herbelin's Explicit Substitution Calculus with Substitution Propagation. (with Dyckhoff) Journal of Logic and Computation, Volume 13, No 5, Pages 689-706. - [pdf] + [pdf]