General Bindings and Alpha-Equivalence in Nominal Isabelle [chapter]

Christian Urban, Cezary Kaliszyk
2011 Lecture Notes in Computer Science  
Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to de-Bruijn indices). In this paper we present an extension of Nominal Isabelle for dealing with general bindings, that means term-constructors where multiple variables are bound at once. Such general bindings are ubiquitous in programming language research and only very poorly
more » ... with single binders, such as lambdaabstractions. Our extension includes new definitions of α-equivalence and establishes automatically the reasoning infrastructure for α-equated terms. We also prove strong induction principles that have the usual variable convention already built in. G. Barthe (Ed.): ESOP
doi:10.1007/978-3-642-19718-5_25 fatcat:nthyd76evjg5bntpwzleohnrka