M. Abadi and L. Cardelli, A Theory of Objects, 1996.
DOI : 10.1007/978-1-4419-8598-9

M. Abadi and K. Leino, A logic of object-oriented programs, Proc. of TAPSOFT '97, pp.682-696, 1997.
DOI : 10.1007/BFb0030634

M. Abadi and G. D. Plotkin, A PER model of polymorphism and recursive types, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.355-365, 1990.
DOI : 10.1109/LICS.1990.113761

S. Abramsky, Domain theory in logical form*, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.1-77, 1991.
DOI : 10.1016/0168-0072(91)90065-T

S. Abramsky and C. L. Ong, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, vol.105, issue.2, pp.159-267, 1993.
DOI : 10.1006/inco.1993.1044

R. Amadio, Recursion over realizability structures. Information and Computation, pp.55-85, 1991.

S. Van-bakel, Complete restrictions of the intersection type discipline, Theoretical Computer Science, vol.102, issue.1, pp.135-163, 1992.
DOI : 10.1016/0304-3975(92)90297-S

S. Van-bakel, Intersection type assignment systems, Theoretical Computer Science, vol.151, issue.2, pp.385-435, 1995.
DOI : 10.1016/0304-3975(95)00073-6

S. Van-bakel and U. De-'liguoro, Logical semantics of the first order sigma-calculus

S. Van-bakel and U. De-'liguoro, Subtyping Object and Recursive Types Logically, Proc. of ICTCS'05, pp.66-80, 2005.
DOI : 10.1007/11560586_7

H. P. Barendregt, M. Coppo, and M. Dezani, A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.37, issue.04, pp.931-940, 1983.
DOI : 10.1002/malq.19800261902

V. Breazu-tannen, T. Coquand, C. A. Gunter, and A. Scedrov, Inheritance as implicit coercion, Information and Computation, vol.93, issue.1, pp.172-221, 1991.
DOI : 10.1016/0890-5401(91)90055-7
URL : http://doi.org/10.1016/0890-5401(91)90055-7

K. B. Bruce and G. Longo, A modest model of records, inheritance, and bounded quantification, Information and Computation, vol.87, issue.1-2, pp.196-240, 1990.
DOI : 10.1016/0890-5401(90)90062-M

K. B. Bruce and J. C. Mitchell, Per models of subtyping, recursive types and higherorder polymorphism, Proc. of POPL '92, pp.316-327, 1992.

F. Cardone, Relational semantics for recursive types and bounded quantification, Lecture Notes in Computer Science, vol.372, pp.164-178, 1989.
DOI : 10.1007/BFb0035759

U. De-'liguoro, Characterizing convergent terms in object calculi via intersection types, Proc. of TLCA'01, pp.315-328, 2001.

U. De-'liguoro, Subtyping in logical form, Proc. of ITRS'02, 2002.

A. Gordon and G. Rees, Bisimilarity for a first-order calculus of objects with subtyping, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.386-395, 1996.
DOI : 10.1145/237721.237807

J. L. Krivine, Lambda-calcul, types et modèles, 1990.
DOI : 10.1051/ita/1991250100671
URL : http://archive.numdam.org/article/ITA_1991__25_1_67_0.pdf

J. C. Mitchell, Foundations for Programming Languages, 1996.

B. Reus and T. Streicher, Semantics and logic of object calculi, Theoretical Computer Science, vol.316, issue.1-3, pp.191-213, 2004.
DOI : 10.1016/j.tcs.2004.01.030

B. H. Riskov and J. M. Wing, A behavioral notion of subtyping, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex, pp.1811-1841, 1994.

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399