General Bindings and Alpha-Equivalence in Nominal Isabelle

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 lambda-abstractions. Our extension includes new definitions of alpha-equivalence and establishes automatically the reasoning infrastructure for alpha-equated terms. We also prove strong induction principles that have the usual variable convention already built in.

[1]  Alexander Krauss,et al.  Automating recursive definitions and termination proofs in higher-order logic , 2009 .

[2]  Andrei Voronkov,et al.  Orienting rewrite rules with the Knuth-Bendix order , 2003, Inf. Comput..

[3]  Christian Urban,et al.  Mechanizing the Metatheory of LF , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[4]  Karl Crary,et al.  Towards a mechanized metatheory of standard ML , 2007, POPL '07.

[5]  Cezary Kaliszyk,et al.  General Bindings and Alpha-Equivalence in Nominal Isabelle , 2011, ESOP.

[6]  Benjamin C. Pierce,et al.  Mechanized Metatheory for the Masses: The PoplMark Challenge , 2005, TPHOLs.

[7]  Christian Urban,et al.  Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof , 2008, RTA.

[8]  Sam Tobin-Hochstadt,et al.  The design and implementation of typed scheme , 2008, POPL '08.

[9]  Arthur Charguéraud,et al.  The Locally Nameless Representation , 2012, Journal of Automated Reasoning.

[10]  Xavier Leroy,et al.  Polymorphic typing of an algorithmic language , 1992 .

[11]  James McKinna,et al.  Some Lambda Calculus and Type Theory Formalized , 1997, Journal of Automated Reasoning.

[12]  Tobias Nipkow,et al.  From Semantics to Computer Science: Nominal verification of algorithm W , 2009 .

[13]  Simon L. Peyton Jones,et al.  System F with type equality coercions , 2007, TLDI '07.

[14]  Andrew M. Pitts,et al.  Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.

[15]  Claude Kirchner,et al.  An overview of ELAN , 1998, WRLA.

[16]  Christian Urban,et al.  Nominal Techniques in Isabelle/HOL , 2005, Journal of Automated Reasoning.

[17]  Stefan Berghofer,et al.  Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering , 1999, TPHOLs.

[18]  Andrei Popescu,et al.  Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[19]  Tom Ridge,et al.  Ott: Effective tool support for the working semanticist , 2010, J. Funct. Program..

[20]  Tom Ridge,et al.  Ott: effective tool support for the working semanticist , 2007, ICFP '07.

[21]  Thorsten Altenkirch,et al.  PiSigma: Dependent Types without the Sugar , 2010, FLOPS.

[22]  W Christian Urban,et al.  Nominal Verification of Algorithm W , 2008 .

[23]  Cezary Kaliszyk,et al.  Quotients revisited for Isabelle/HOL , 2011, SAC '11.

[24]  Stephanie Weirich,et al.  Binders unbound , 2011, ICFP.

[25]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[26]  Randy Pollack,et al.  External and internal syntax of the lambda-calculus , 2010, J. Symb. Comput..

[27]  Tobias Nipkow,et al.  Type Inference Verified: Algorithm W in Isabelle/HOL , 1996, TYPES.

[28]  Peter V. Homeier.  A Design Structure for Higher Order Quotients , 2005, TPHOLs.

[29]  Frank Pfenning,et al.  System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.

[30]  Brian Huffman,et al.  A New Foundation for Nominal Isabelle , 2010, ITP.

[31]  Tobias Nipkow,et al.  Type Inference Verified: Algorithm W in Isabelle/HOL , 2004, Journal of Automated Reasoning.

[32]  Christian Urban,et al.  Proof Pearl : A New Foundation for Nominal Isabelle , 2010 .

[33]  James Cheney.  Scrap your nameplate: (functional pearl) , 2005, ICFP '05.

[34]  James Cheney.  Toward a general theory of names: binding and scope , 2005, MERLIN '05.