 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
The Liskov substitution principle is one possible definition of subtype, a relation between datatypes. The name is commonly used in the field of object-oriented computer programming for the definition of subtype introduced by Barbara Liskov and substitutability; that is, if S is a subtype of T, then objects of type T in a program may be substituted with objects of type S, without altering any of the desirable properties of that program (e.g., correctness).
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
