A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
General Bindings and Alpha-Equivalence in Nominal Isabelle
[chapter]
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
doi:10.1007/978-3-642-19718-5_25
fatcat:nthyd76evjg5bntpwzleohnrka