| |
Liskov substitution principle - Wikipedia, the free encyclopedia |
 | | In object-oriented programming, the Liskov substitution principle is a particular definition of subtype that was introduced by Barbara Liskov and Jeannette Wing in a 1993 paper entitled Family Values: A Behavioral Notion of Subtyping. |
| | Thus, Liskov and Wing's notion of "subtype" is based on the notion of substitutability; that is, if S is a subtype of T, then objects of type T in a program may be replaced with objects of type S without altering any of the desirable properties of that program (e.g., correctness). |
| | A function using a class hierarchy violating the principle uses a reference to a base class but must know about all the derivatives of that base class. |
| en.wikipedia.org /wiki/Liskov_substitution_principle (362 words) |
