K. Bruce, R. D. Cosmo, and G. Longo, Provable isomorphisms of types, Math. Str. in Comp. Science, vol.2, issue.2, pp.231-247, 1992.

D. , Isomorphisms of simple inductive types through extensional rewriting, Math. Str. in Comp. Science, vol.15, issue.5, pp.875-915, 2005.

R. and D. Cosmo, Isomorphisms of types: from lambda-calculus to information retrieval and language design, 1995.

, The Coq Reference Manual

D. Delahaye, Information Retrieval in a Coq Proof Library Using Type Isomorphisms, TYPES, vol.1999, pp.131-147

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

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

, The HoTT Book. Homotopy Type Theory: Univalent Foundations of Mathematics. IAS Princeton, 2013.

G. Longo, K. Milsted, and S. Soloviev, The Genericity Theorem and effective Parametricity in Polymorphic lambda-calculus, Theor. Comp. Science, vol.121, pp.323-349, 1993.

Z. Luo, Computation and Reasoning. A Type Theory for Computer Science, 1994.

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

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

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, J. of Soviet Mathematics, vol.22, issue.3, pp.1387-1400, 1983.

C. Stirling, Proof Systems for Retracts in Simply Typed Lambda Calculus, pp.398-409, 2013.