Nominal Groups and Their Homomorphism Theorems

We introduce and study the nominal groups, providing some algebraic properties of this new structure. We focus on the properties of nominal homomorphisms, and study the correspondence between some results obtained in the Fraenkel-Mostowski framework where only finitely supported objects are allowed and those obtained in the classical Zermelo-Fraenkel framework.

[1]  Slawomir Lasota,et al.  Towards nominal computation , 2012, POPL '12.

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

[3]  Sam Staton,et al.  Comparing operational models of name-passing process calculi , 2006, Inf. Comput..

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

[5]  Joachim Parrow,et al.  Formalising the pi-Calculus Using Nominal Logic , 2007, FoSSaCS.

[6]  Emilio Tuosto,et al.  On Nominal Regular Languages with Binders , 2012, FoSSaCS.

[7]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[8]  A. A. Fraenkel.  Adolf Lindenbaum und Andrzej Mostowski. Über die Unabhängigkeit des Auswahlaxioms und einiger seiner Folgerungen. Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie , Classe III, Bd. 31 (1938), S. 27–32. , 1939 .

[9]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[10]  Slawomir Lasota,et al.  Automata with Group Actions , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[11]  Pascal Fradet,et al.  Generalised multisets for chemical programming , 2006, Math. Struct. Comput. Sci..

[12]  Gabriel Ciobanu,et al.  Nominal Fusion Calculus , 2012, 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

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

[14]  Fabio Gadducci,et al.  About permutation algebras, (pre)sheaves and named sets , 2006, High. Order Symb. Comput..

[15]  A. Fraenkel,et al.  Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre , 1922 .

[16]  John S. Rose.  A Course on Group Theory , 2012 .

[17]  Christian Urban.  Nominal Techniques in Isabelle/HOL , 2008, Journal of Automated Reasoning.

[18]  H. Hermes.  Numbers and Games , 1991 .

[19]  J. Rhodes,et al.  Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines , 1965 .

[20]  J. Conway.  On Numbers and Games , 1976 .

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

[22]  Marco Bernardo,et al.  Formal Methods for Mobile Computing, 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures , 2005, SFM.