## Nominal techniques in Isabelle/HOL (2005)

### Cached

### Download Links

- [www4.in.tum.de]
- [www4.in.tum.de]
- [www.mathematik.uni-muenchen.de]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the 20th International Conference on Automated Deduction (CADE-20 |

Citations: | 80 - 12 self |

### BibTeX

@INPROCEEDINGS{Urban05nominaltechniques,

author = {Christian Urban},

title = {Nominal techniques in Isabelle/HOL},

booktitle = {Proceedings of the 20th International Conference on Automated Deduction (CADE-20},

year = {2005},

pages = {38--53},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. In this paper we define an inductive set that is bijective with the ff-equated lambda-terms. Unlike de-Bruijn indices, however, our inductive definition includes names and reasoning about this definition is very similar to informal reasoning on paper. For this we provide a structural induction principle that requires to prove the lambda-case for fresh binders only. The main technical novelty of this work is that it is compatible with the axiom-of-choice (unlike earlier nominal logic work by Pitts et al); thus we were able to implement all results in Isabelle/HOL and use them to formalise the standard proofs for Church-Rosser and strongnormalisation. Keywords. Lambda-calculus, nominal logic, structural induction, theoremassistants.