Nominal Renaming Sets

Nominal techniques are based on the idea of sets with a finitely-supported atoms-permutation action. We consider the idea of nominal renaming sets , which are sets with a finitely-supported atoms-renaming action; renamings can identify atoms, permutations cannot. We show that nominal renaming sets exhibit many of the useful qualities found in (permutative) nominal sets; an elementary sets-based presentation, inductive datatypes of syntax up to binding, cartesian closure, and being a topos. Unlike is the case for nominal sets, the notion of names-abstraction coincides with functional abstraction. Thus we obtain a concrete presentation of sheaves on the category of finite sets in the form of a category of sets with structure.

[1]  Samuel Staton.  Name-passing process calculi : operational models and structural operational semantics , 2007 .

[2]  J. Benthem,et al.  Higher-Order Logic , 2001 .

[3]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[4]  Murdoch James Gabbay,et al.  Capture-avoiding substitution as a nominal algebra , 2007, Formal Aspects of Computing.

[5]  Kamel Barkaoui,et al.  Theoretical Aspects of Computing - ICTAC 2006, Third International Colloquium, Tunis, Tunisia, November 20-24, 2006, Proceedings , 2006, ICTAC.

[6]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

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

[8]  James Ee.  The fresh approach. , 1953 .

[9]  Sam Staton,et al.  A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[10]  N Brunner.  75 YEARS OF INDEPENDENCE PROOFS BY FRAENKEL-MOSTOWSKI PERMUTATION MODELS. , 1996 .

[11]  Andrew M. Pitts,et al.  On a monadic semantics for freshness , 2005, Theor. Comput. Sci..

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

[13]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[14]  Amy P. Felty,et al.  Higher-Order Abstract Syntax in Coq , 1995, TLCA.

[15]  André Hirschowitz,et al.  Higher-Order Abstract Syntax with Induction in Coq , 1994, LPAR.

[16]  William M. Farmer,et al.  The seven virtues of simple type theory , 2008, J. Appl. Log..

[17]  de Ng Dick Bruijn.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[18]  Andrew M. Pitts.  Equivariant Syntax and Semantics , 2002, ICALP.

[19]  Aad Mathssen,et al.  Logical Calculi for Reasoning with Binding , 2008 .

[20]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[21]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[22]  Furio Honsell,et al.  Translating specifications from nominal logic to CIC with the theory of contexts , 2005, MERLIN '05.

[23]  Andrew M. Pitts,et al.  A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[24]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[25]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[26]  Murdoch James Gabbay.  A general mathematics of names , 2007, Inf. Comput..

[27]  Andrew M. Pitts,et al.  FreshML: programming with binders made simple , 2003, ICFP '03.

[28]  Mark R. Shinwell,et al.  Fresh Objective Caml user manual , 2005 .

[29]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[30]  Marino Miculan,et al.  Developing (Meta)Theory of λ-calculus in the Theory of Contexts1 1Work partially supported by Italian MURST project tosca and EC-WG types. , 2001 .

[31]  Nick Benton,et al.  Relational Reasoning in a Nominal Semantics for Storage , 2005, TLCA.

[32]  Daniel Hirschkoff.  A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions , 1997, TPHOLs.

[33]  Sam Lindley,et al.  Extensional Rewriting with Sums , 2007, TLCA.

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

[35]  Joëlle Despeyroux,et al.  A Higher-Order Specification of the pi-Calculus , 2000, IFIP TCS.

[36]  M. Hoffman.  Semantical analysis of higher-order abstract syntax , 1999 .

[37]  Andrzej S. Murawski,et al.  Nominal games and full abstraction for the nu-calculus , 2004, LICS 2004.

[38]  Dale Miller,et al.  A proof theory for generic judgments: an extended abstract , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[39]  Lawrence C. Paulson,et al.  The foundation of a generic theorem prover , 1989, Journal of Automated Reasoning.

[40]  Furio Honsell,et al.  An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS , 2001, ICALP.

[41]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[42]  Jaime G. Carbonell,et al.  Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.

[43]  Martin Hofmann,et al.  Consistency of the theory of contexts , 2006, J. Funct. Program..

[44]  Mark R. Shinwell.  The fresh approach: functional programming with names and binders , 2005 .

[45]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.