DMCA
General Bindings and Alpha-Equivalence in Nominal Isabelle
Cached
Download Links
| Citations: | 5 - 1 self |
BibTeX
@MISC{Urban_generalbindings,
author = {Christian Urban and Cezary Kaliszyk},
title = {General Bindings and Alpha-Equivalence in Nominal Isabelle},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. 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 supported 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. 1
Keyphrases
nominal isabelle general binding usual variable convention single binder bound variable equated term language research reasoning infrastructure new definition definitional extension multiple variable isabelle hol theorem prover proving infrastructure language calculus de-bruijn index strong induction principle
