| Issue |
RAIRO-Theor. Inf. Appl.
Volume 35, Number 1, January/February 2001
Coalgebraic Methods in Computer Science
|
|
|---|---|---|
| Page(s) | 61 - 81 | |
| DOI | https://doi.org/10.1051/ita:2001109 | |
| Published online | 15 April 2002 | |
A Coalgebraic Semantics of Subtyping
Department of Computer Science, University of Nijmegen,
P.O. Box 9010, 6500 GL Nijmegen, The Netherlands.
Accepted: 9 March 2001
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.
Mathematics Subject Classification: 18C50 / 68Q70 / 68Q85
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.