Subtyping relations are usually defined either syntactically by a formal system or semantically by an interpretation of types into an untyped denotational model. This work shows how to define a subtyping relation semantically in the presence of boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm. The presentation is voluntarily kept informal and discursive and the technical details are reduced to a minimum since we rather insist on the motivations, the intuition, and the guidelines to apply the approach. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Castagna, G., & Frisch, A. (2005). A gentle introduction to semantic subtyping. In Lecture Notes in Computer Science (Vol. 3580, pp. 30–34). Springer Verlag. https://doi.org/10.1007/11523468_3
Mendeley helps you to discover research relevant for your work.