A. Asperti and G. Longo, Categories, Types and Structures. Category Theory for the Working Computer Scientist, 1991.

L. Babai, Automorphism groups, isomorphism, reconstruction, Handbook of Combinatorics, vol.2, pp.1447-1541, 1995.

V. Balat and R. Di-cosmo, A Linear Logical View of Linear Type Isomorphisms, Lecture Notes in Computer Science, vol.1683, pp.250-265, 1999.

H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, 1984.

G. Barthe, A computational view of implicit coercions in type theory, Mathematical Structures in Computer Science, vol.15, issue.5, pp.839-874, 2005.

R. Brown, P. G. Higgins, and R. Sivera, Nonabelian Algebraic Topology, 2011.

K. Bruce and G. Longo, Provable isomorphisms and domain equations in models of typed languages, Proceedings of the ACM Symposium on Theory of Computing (STOC 85, pp.263-272, 1985.

K. Bruce, R. Di-cosmo, and G. Longo, Provable isomorphisms of types, Mathematical Structures in Computer Science (Special Issue), vol.2, issue.2, pp.231-247, 1992.

P. Clairambault, Isomorphisms of types in the presence of higher-order references, Logical Methods in Computer Science, vol.8, pp.1-28, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00651816

M. Coppo, M. Dezani-ciancaglini, I. Margaria, and M. Zacchi, Isomorphism of intersection and union types, Mathematical Structures in Computer Science, vol.27, issue.5, pp.603-625, 2017.

M. Coppo, M. Dezani-ciancaglini, A. Díaz-caro, I. Margaria, and M. Zacchi, Retractions in intersection types, EPTCS, vol.242, pp.31-47, 2016.

T. Coquand and G. Huet, The calculus of constructions, Information and Computation, vol.76, issue.23, pp.95-120, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00076024

D. Delahaye, Information retrieval in a coq proof library using type isomorphisms, Lecture Notes in Computer Science, vol.1956, pp.131-147, 1999.

M. Dezani-ciancaglini, Characterization of normal forms possessing inverse in the ? ? ? ? ?calculus, Theoretical Computer Science, vol.2, pp.323-337, 1976.

D. Cosmo and R. , Isomorphisms of Types: From Lambda-Calculus to Information Retrieval and Language Design, 1995.

K. Dosen and Z. Petric, Isomorphic objects in symmetric monoidal closed categories, Mathematical Structures in Computer Science, vol.7, pp.639-662, 1997.

M. Fiore, Isomorphisms of generic recursive polynomial types, POPL '04, pp.77-88, 2004.

M. Fiore, R. Di-cosmo, and V. Balat, Remarks on isomorphisms in typed lambda calculi with empty and sum types, Annals of Pure and Applied Logic, vol.141, issue.1, pp.35-50, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00151252

R. Frucht, Herstellung von Graphen mit vorgegebener abstrakten Gruppe, Kompositio Math, vol.6, pp.39-50, 1938.

R. Frucht, Graphs of degree three with a given abstract group, Canadian Journal of Mathematics, vol.1, pp.365-378, 1949.

H. Goguen, A Typed Operational Semantics for Type Theory, 1994.

C. Hankin, Lambda Calculi: A Guide for Computer Scientists, Graph Theory, 1969.

M. Hall and . Jr, The Theory of Groups, The Macmillan Company, 1959.

J. Lambek and P. J. Scott, Introduction to Higher-Order Categorical Logic, Cambridge Studies in Advanced Mathematics, 1988.

G. Longo, K. Milsted, and S. Soloviev, The genericity theorem and effective parametricity in polymorphic lambda-calculus, Theoretical Computer Science, vol.121, pp.323-349, 1993.

Z. Luo, Computation and Reasoning. A Type Theory for Computer Science, International Series of Monographs on Computer Science, vol.11, 1994.

Z. Luo, S. Soloviev, and T. Xue, Coercive subtyping: Theory and implementation, Information and Computation, vol.223, pp.18-42, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01130574

M. Lane and S. , Topology and logic as a source of algebra, Bulletin of the American Mathematical Society, vol.82, issue.1, pp.1-40, 1976.

L. Marie-magdeleine, Sous-typage coercitif en présence de réductions non-standards dans un système aux types dépendants, 2009.

G. Pólya, Kombinatorische Anzahlbestimmungen f'ur Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, pp.145-254, 1937.

S. Soloviev and Z. Luo, Coercion completion and conservativity in coercive subtyping, Annals of Pure and Applied Logic, vol.113, issue.1-3, pp.297-322, 2002.

S. V. Solov'ev, The category of finite sets and cartesian closed categories, Journal of Soviet Mathematics, vol.22, issue.3, pp.1387-1400, 1983.

S. V. Soloviev, A complete axiom system for isomorphism of types in closed categories, LPAR'93, vol.698, pp.360-371, 1993.

S. Soloviev, On isomorphism of dependent products in a typed logical framework, Postproceedings of 20th International Conference on Types for Proofs and Programs, TYPES 2014, vol.39, pp.275-288, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01913983

C. Stirling, Proof systems for retracts in simply typed lambda calculus, Lecture Notes in Computer Science, vol.7966, issue.2, pp.398-409, 2013.

, Homotopy Type Theory: Univalent Foundations of Mathematics, 2013.

A. T. White, Graphs, Groups and Surfaces, 1984.