Voir la notice de l'article provenant de la source Numdam
Coalgebras have been proposed as formal basis for the semantics of objects in the sense of object-oriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in object-oriented programming. We show that different characterisations of behavioural subtyping found in the literature can conveniently be expressed in coalgebraic terms. We also investigate the subtle difference between behavioural subtyping and refinement.
@article{ITA_2001__35_1_61_0, author = {Poll, Erik}, title = {A coalgebraic semantics of subtyping}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {61--81}, publisher = {EDP-Sciences}, volume = {35}, number = {1}, year = {2001}, mrnumber = {1845875}, zbl = {0990.18004}, language = {en}, url = {http://geodesic.mathdoc.fr/item/ITA_2001__35_1_61_0/} }
TY - JOUR AU - Poll, Erik TI - A coalgebraic semantics of subtyping JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2001 SP - 61 EP - 81 VL - 35 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_2001__35_1_61_0/ LA - en ID - ITA_2001__35_1_61_0 ER -
Poll, Erik. A coalgebraic semantics of subtyping. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 35 (2001) no. 1, pp. 61-81. http://geodesic.mathdoc.fr/item/ITA_2001__35_1_61_0/