- Barendregt's Variable Convention in Rule Christian Urban 1 , Stefan Berghofer 1 , and Michael Norrish 2
- Strong Normalisation of Cut-Elimination in Classical Logic
- Fundamenta Informaticae XX (2001) 133 1 Strong Normalisation of Cut-Elimination in Classical Logic
- Avoiding Equivariance in AlphaProlog Christian Urban 1 and James Cheney 2
- Noname manuscript No. (will be inserted by the editor)
- Nominal Unification Christian Urban a Andrew Pitts a Murdoch Gabbay b
- Work in Progress: Logic Programming with Names and James Cheney 1 and Christian Urban 2
- A Formal Treatment of the Barendregt Variable Convention in Rule Extended Abstract
- A HeadtoHead Comparison of de Bruijn Indices and Names
- Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
- Christian Urban Gonville and Caius College
- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
- Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
- A Formal Treatment of the Barendregt Variable Convention in Rule Extended Abstract
- Nominal Inversion Principles Stefan Berghofer and Christian Urban
- Strong Normalisation of Cut-Elimination in Classical Logic
- A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof Pearl)
- Isabelle How to Prove False using the Variable Convention Christian Urban, Technical University of Munich
- Strong Induction Principles in the Locally Nameless Representation of Binders
- To appear in EPTCS. Nominal Unification Revisited
- Noname manuscript No. (will be inserted by the editor)
- Nominal Unification Christian Urban Andrew Pitts Murdoch Gabbay
- System Description: #Prolog, a Fresh Approach to Logic Programming Modulo #Equivalence
- Nominal Unification Christian Urban Andrew Pitts Murdoch Gabbay
- Mechanizing the Metatheory of LF Christian Urban
- General Bindings and Alpha-Equivalence in Nominal Isabelle
- Fundamenta Informaticae XX (2000) 1--33 1 Strong Normalisation of CutElimination in Classical Logic
- Classical Logic is better than Intuitionistic Logic: A Conjecture about DoubleNegation Translations
- Nominal Techniques in Isabelle/HOL ? Christian Urban 1 and Christine Tasson 2
- Prolog: A Logic Programming Language with Names, Binding and Equivalence
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Strong Normalisation of Cut-Elimination in Classical Logic
- System Description: #Prolog, a Fresh Approach to Logic Programming Modulo #Equivalence
- Fundamenta Informaticae XX (2000) 1--33 1 Strong Normalisation of CutElimination in Classical Logic
- Nominal Unification Christian Urban a Andrew Pitts a Murdoch Gabbay b
- Prolog: A Logic Programming Language with Names, Binding and Equivalence
- Nominal Techniques in Isabelle/HOL ? Christian Urban 1 and Christine Tasson 2
- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
- Classical Logic is better than Intuitionistic Logic: A Conjecture about DoubleNegation Translations
- Nominal Unification Christian Urban Andrew Pitts Murdoch Gabbay
- Work in Progress: Logic Programming with Names and James Cheney 1 and Christian Urban 2
- Christian Urban Gonville and Caius College
- A Formal Treatment of the Barendregt Variable Convention in Rule Extended Abstract
- Noname manuscript No. (will be inserted by the editor)
- Barendregt's Variable Convention in Rule Christian Urban 1 , Stefan Berghofer 1 , and Michael Norrish 2
- A HeadtoHead Comparison of de Bruijn Indices and Names
- Avoiding Equivariance in AlphaProlog Christian Urban 1 and James Cheney 2
- Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
- Noname manuscript No. (will be inserted by the editor)
- A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions (Proof Pearl)
- Priority Inheritance Protocol Proved Correct Xingyuan Zhang1
- Mechanizing the Metatheory of LF Christian Urban
- Strong Induction Principles in the Locally Nameless Representation of Binders
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Mechanizing the Metatheory of mini-XQuery James Cheney1
- Proof Pearl: A New Foundation for Nominal Isabelle Brian Huffman1
- GENERAL BINDINGS AND ALPHA-EQUIVALENCE IN NOMINAL ISABELLE CHRISTIAN URBAN AND CEZARY KALISZYK
- Fundamenta Informaticae XX (2001) 133 1 Strong Normalisation of Cut-Elimination in Classical Logic
- To appear in EPTCS. Nominal Unification Revisited
- General Bindings and Alpha-Equivalence in Nominal Isabelle
- A Formal Treatment of the Barendregt Variable Convention in Rule Extended Abstract
- Quotients Revisited for Isabelle/HOL Cezary Kaliszyk
- Nominal Unification Christian Urban Andrew Pitts Murdoch Gabbay
- Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
- Nominal Inversion Principles Stefan Berghofer and Christian Urban
- Nominal Verification of Algorithm W Christian Urban and Tobias Nipkow
- Isabelle How to Prove False using the Variable Convention Christian Urban, Technical University of Munich
- Strong Normalisation of Cut-Elimination in Classical Logic
