A. Bailey, The machine-checked literate formalisation of algebra in type theory An implementation of typed LF with coercive subtyping and universes, Journal of Automated Reasoning, vol.27, issue.1, pp.3-27, 1999.

. Coq, The Coq Proof Assistant Reference Manual (Version 8.3), INRIA. The Coq Development Team, 2010. [6] H. Goguen, A typed operational semantics for type theory, 1952.

G. Longo, Subtyping parametric and dependent types, Invited lecture at school on type theory and term rewriting, 1996.

G. Longo, K. Milsted, and S. Soloviev, Coherence and transitivity of subtyping as entailment, Journal of Logic and Computation, vol.10, issue.4, pp.493-526, 2000.
DOI : 10.1093/logcom/10.4.493

Y. Luo, Coherence and Transitivity in Coercive Subtyping, 2005.
DOI : 10.1007/3-540-45653-8_17

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

Z. Luo, Coercive subtyping in type theory, LNCS, vol.1258, 1997.
DOI : 10.1007/3-540-63172-0_45

Z. Luo, Coercive subtyping, Journal of Logic and Computation, vol.9, issue.1, pp.105-130, 1999.
DOI : 10.1093/logcom/9.1.105
URL : https://hal.archives-ouvertes.fr/hal-01130574

Z. Luo, Manifest Fields and Module Mechanisms in Intensional Type Theory, LNCS, vol.113, issue.1-3, 2009.
DOI : 10.1016/S0168-0072(01)00063-X

Z. Luo, Type-theoretical semantics with coercive subtyping, Semantics and Linguistic Theory, vol.20, issue.SALT20, 2010.

Z. Luo, Contextual Analysis of Word Meanings in Type-Theoretical Semantics, Logical Aspects of Computational Linguistics (LACL'2011), in: LNAI, 2011.
DOI : 10.1007/978-3-642-22221-4_11

Z. Luo, Formal semantics in modern type theories with coercive subtyping, Linguistics and Philosophy, vol.113, issue.1???3, 2012.
DOI : 10.1007/s10988-013-9126-4

Z. Luo and R. Adams, Structural subtyping for inductive types with functorial equality rules, Mathematical Structures in Computer Science, vol.664, issue.05, 2008.
DOI : 10.1093/logcom/9.1.105

Z. Luo and Y. Luo, Transitivity in coercive subtyping, Information and Computation, vol.197, issue.1-2, pp.122-144, 2005.
DOI : 10.1016/j.ic.2004.10.008

Z. Luo and R. Pollack, LEGO Proof Development System: User's Manual, 1992.

Z. Luo and S. Soloviev, Dependent coercions, The 8th Inter. Conf. on Category Theory and Computer Science (CTCS'99), 1999.

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

. Matita, The Matita proof assistant, 2008.

J. C. Mitchell, Coercion and type inference, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '84, 1983.
DOI : 10.1145/800017.800529

J. C. Mitchell, Abstract, Journal of Functional Programming, vol.17, issue.03, pp.245-286, 1991.
DOI : 10.1016/S0019-9958(82)80087-9

B. Nordström, K. Petersson, and J. Smith, Programming in Martin?Löf's Type Theory: An Introduction, 1990.

J. Pustejovsky, The Generative Lexicon, MIT, 1995.

A. Saibi, Typing algorithm in type theory with inheritance, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, 1997.
DOI : 10.1145/263699.263742

S. Soloviev and Z. Luo, Coercion completion and conservativity in coercive subtyping, Annals of Pure and Applied Logic, vol.113, issue.1-3, pp.1-3, 2002.
DOI : 10.1016/S0168-0072(01)00063-X

T. Xue, Conservativity of coercive subtyping, 2012.

T. Xue and Z. Luo, Dot-types and Their Implementation, LNCS, vol.7351, 2012.
DOI : 10.1007/978-3-642-31262-5_17