The search session has expired. Please query the service again.
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.
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.
Currently displaying 1 –
4 of
4