M. Bojanczyk, B. Klin, S. Lasota, and S. Torunczyk, Turing Machines with Atoms, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.183-192, 2013.
DOI : 10.1109/LICS.2013.24

M. Bojanczyk, B. Klin, and S. Lasota, Automata with Group Actions, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.355-364, 2011.
DOI : 10.1109/LICS.2011.48

F. Bonchi, M. G. Buscemi, V. Ciancia, and F. Gadducci, A Presheaf Environment for the Explicit Fusion Calculus, Journal of Automated Reasoning, vol.340, issue.3, pp.161-183, 2012.
DOI : 10.1016/j.tcs.2005.03.017
URL : https://hal.archives-ouvertes.fr/hal-00777522

R. Bruni, U. Montanari, and M. Sammartino, Revisiting causality, coalgebraically, Acta Informatica, vol.19, issue.1, pp.5-33, 2015.
DOI : 10.1016/S1571-0661(05)80267-1
URL : https://arpi.unipi.it/bitstream/11568/687665/1/Revisiting%20Causality%2c%20Coalgebraically.pdf

A. Church, A Set of Postulates for the Foundation of Logic, The Annals of Mathematics, vol.33, issue.2, pp.346-366, 1932.
DOI : 10.2307/1968337

V. Ciancia, A. Kurz, and U. Montanari, Families of Symmetries as Efficient Models of Resource Binding, Electronic Notes in Theoretical Computer Science, vol.264, issue.2, pp.63-81, 2010.
DOI : 10.1016/j.entcs.2010.07.014

V. Ciancia and U. Montanari, A Name Abstraction Functor for Named Sets, Electronic Notes in Theoretical Computer Science, vol.203, issue.5, pp.49-70, 2008.
DOI : 10.1016/j.entcs.2008.05.019

V. Ciancia and U. Montanari, Symmetries, local names and dynamic (de)-allocation of names, Information and Computation, vol.208, issue.12, pp.1349-1367, 2010.
DOI : 10.1016/j.ic.2009.10.007

V. Ciancia and M. Sammartino, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours, Lecture Notes in Computer Science, vol.8902, pp.97-111, 2014.
DOI : 10.1007/978-3-662-45917-1_7

V. Ciancia and E. Tuosto, A novel class of automata for languages on infinite alphabets, 2009.

G. L. Ferrari, S. Gnesi, U. Montanari, and M. Pistore, A model-checking verification environment for mobile processes, ACM Transactions on Software Engineering and Methodology, vol.12, issue.4, pp.440-473, 2003.
DOI : 10.1145/990010.990013

G. Ferrari, U. Montanari, and E. Tuosto, Coalgebraic minimization of HD-automata for the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-calculus using polymorphic types, Theoretical Computer Science, vol.331, issue.2-3, pp.325-365, 2005.
DOI : 10.1016/j.tcs.2004.09.021

M. Fiore, G. Plotkin, and D. Turi, Abstract syntax and variable binding, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.193-202, 1999.
DOI : 10.1109/LICS.1999.782615

M. Fiore and S. Staton, Comparing operational models of name-passing process calculi, Information and Computation, vol.204, issue.4, pp.524-560, 2006.
DOI : 10.1016/j.ic.2005.08.004

M. Fiore, E. Moggi, and D. Sangiorgi, A fully-abstract model for the pi;-calculus, LICS '96. Proceedings., Eleventh Annual IEEE Symposium on, pp.43-54, 1996.

A. Fraenkel, Der Begriff " definit " und die Unabhängigkeit des Auswahlaxioms, Berl. Ber, pp.253-257, 1922.

M. Gabbay and A. Pitts, A new approach to abstract syntax involving binders, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.214-224, 1999.
DOI : 10.1109/LICS.1999.782617

M. Gabbay and V. Ciancia, Freshness and Name-Restriction in Sets of Traces with Names, Lecture Notes in Computer Science, vol.342, issue.1, pp.365-380, 2011.
DOI : 10.1016/j.tcs.2005.06.003

F. Gadducci, M. Miculan, and U. Montanari, About permutation algebras, (pre)sheaves and named sets, Higher-Order and Symbolic Computation, vol.249, issue.2-3, pp.283-304, 2006.
DOI : 10.1007/s10990-006-8749-3

B. Jacobs and A. Silva, Initial Algebras of Terms with Binding and Algebraic Structure, Lecture Notes in Computer Science, vol.8, issue.3, pp.211-234, 2014.
DOI : 10.2168/LMCS-6(3:23)2010

M. Kaminski and N. Francez, Finite-memory automata (extended abstract) In: 31st Annual Symposium on Foundations of Computer Science, pp.683-688, 1990.

B. Klin, S. Lasota, J. Ochremiak, and S. Toru´nczyktoru´nczyk, Turing machines with atoms, constraint satisfaction problems, and descriptive complexity, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-58, 2014.
DOI : 10.1145/2603088.2603135

D. Kozen, K. Mamouras, D. Petrisan, and A. Silva, Nominal Kleene Coalgebra, Lecture Notes in Computer Science, vol.9135, pp.286-298, 2015.
DOI : 10.1007/978-3-662-47666-6_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1031.6252

D. Kozen, K. Mamouras, and A. Silva, Completeness and Incompleteness in Nominal Kleene Algebra, Lecture Notes in Computer Science, vol.9348, pp.51-66, 2015.
DOI : 10.1007/978-3-319-24704-5_4

A. Kurz and D. Petrisan, On universal algebra over nominal sets, Mathematical Structures in Computer Science, vol.20, issue.02, pp.285-318, 2010.
DOI : 10.1016/j.entcs.2008.05.025

A. Kurz, T. Suzuki, and E. Tuosto, On Nominal Regular Languages with Binders, Lecture Notes in Computer Science, vol.7213, pp.255-269, 2012.
DOI : 10.1007/978-3-642-28729-9_17

F. W. Lawvere, FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES, Proceedings of the National Academy of Sciences, vol.50, issue.5, pp.869-872, 1963.
DOI : 10.1073/pnas.50.5.869

R. Milner, A Calculus of Communicating Systems, Inc, vol.92, 1982.
DOI : 10.1007/3-540-10235-3

R. Milner, Whats in a name?, Computer Systems, pp.205-209, 2004.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, i. Information and Computation, pp.1-40, 1992.

U. Montanari and M. Pistore, ??-Calculus, Structured Coalgebras, and Minimal HD-Automata, Lecture Notes in Computer Science, vol.1893, pp.569-578, 2000.
DOI : 10.1007/3-540-44612-5_52

U. Montanari and M. Sammartino, A network-conscious ??-calculus and its coalgebraic semantics, Theoretical Computer Science, vol.546, pp.188-224, 2014.
DOI : 10.1016/j.tcs.2014.03.009

G. Moore, Zermelo's axiom of choice: its origins, development, and influence. Studies in the history of mathematics and physical sciences, 1982.
DOI : 10.1007/978-1-4613-9478-5

A. Mostowski, Uber den Begriff einer Endlichen Menge, Comptes rendus des sances de la Socit des Sciences et des Lettres de Varsovie, pp.31-1320, 1938.

A. Murawski, S. Ramsay, and N. Tzevelekos, Bisimilarity in Fresh-Register Automata, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.156-167, 2015.
DOI : 10.1109/LICS.2015.24

M. Pistore, History Dependent Automata, 1999.

A. M. Pitts, Nominal logic, a first order theory of names and binding, Information and Computation, vol.186, issue.2, pp.165-193, 2003.
DOI : 10.1016/S0890-5401(03)00138-X

A. M. Pitts, Nominal Sets: Names and Symmetry in Computer Science, 2013.
DOI : 10.1017/CBO9781139084673

J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000.
DOI : 10.1016/S0304-3975(00)00056-6

M. R. Shinwell, A. M. Pitts, and M. J. Gabbay, Freshml: Programming with binders made simple, pp.263-274, 2003.

N. Tzevelekos, Fresh-register automata, Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.295-306, 2011.
DOI : 10.1145/1925844.1926420
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.684.5694

C. Urban, A. M. Pitts, and M. J. Gabbay, Nominal unification, Theoretical Computer Science, vol.323, issue.1-3, pp.473-497, 2004.
DOI : 10.1016/j.tcs.2004.06.016