Request PDF on ResearchGate | Data Abstraction and Hierarchy | An abstract is not available. Barbara Liskov at Massachusetts Institute of Technology. and Hierarchy. MIT. Barbara Liskov Laboratory for Computer Science Cambridge , Ma. Abstract. Data abstraction is a valuable method for organizing. Barbara Liskov. November Page 2. Outline. ▫ Inventing abstract data types . ▫ CLU. ▫ Type hierarchy. ▫ What next. Page 3. Data Abstraction Prehistory.
|Published (Last):||26 January 2009|
|PDF File Size:||8.4 Mb|
|ePub File Size:||7.33 Mb|
|Price:||Free* [*Free Regsitration Required]|
Liskov, Barbara ; Wing, Jeannette July Substitutability is a principle abstrsction object-oriented programming stating that, in a computer programif S is a subtype of T, then objects of type T may be replaced with objects of type S i.
From Wikipedia, the free encyclopedia.
In addition to the signature requirements, the subtype must meet a number of behavioural conditions. This paper discusses LSP in the mentioned context. This article includes a list of referencesbut its sources remain unclear because it has insufficient inline citations. Retrieved from ” https: Views Read Edit View history. For the economic principle, see Substitute good.
In the same paper, Liskov and Wing detailed their notion of behavioral subtyping in an extension of Hoare logicwhich bears a certain resemblance to Bertrand Meyer ‘s design by contract in that it considers the interaction of subtyping with preconditionspostconditions and invariants. Object-oriented programming Type theory Programming principles Formal methods Programming language semantics.
Leavens and Krishna K.
Liskov substitution principle – Wikipedia
Taking aliasing into account was the major improvement made by Liskov and Wingand a key ingredient hjerarchy the history constraint. The rules on pre- and postconditions are identical to those iherarchy by Bertrand Meyer in his book Object-Oriented Software Construction.
Liskov’s principle imposes some standard requirements on signatures that have been adopted in newer object-oriented programming languages usually at the level of classes rather than types; see nominal vs. A keynote address in which Liskov first formulated the principle. Both Meyer, and later Pierre America, who was the first to use the term behavioral subtypinggave proof-theoretic definitions of some behavioral subtyping notions, but their definitions did not take into account aliasing that may occur in programming languages that support references or pointers.
October Learn how and when to remove this template message. Behavioural subtyping is undecidable in general: These are detailed in a terminology hierarchhy that of design by contract methodology, leading to some restrictions on how contracts can interact with inheritance:.
Liskov substitution principle
Behavioural subtyping is a stronger notion than typical subtyping of functions defined in type theorywhich relies only on the contravariance of argument types and covariance of the return type. An article popular in the object-oriented programming community that gives several examples of LSP violations. Contains a gentler introduction to behavioral subtyping in its various forms in chapter 2.
Nonetheless, the principle is useful in reasoning about babrara design of class hierarchies. An updated version appeared as CMU technical report: A behavioral notion of subtyping. This paper surveys various notions of behavioral subtyping, including Liskov and Wing’s.
This page was last edited on 27 Novemberat Liskov’s notion of a behavioural subtype defines a notion of substitutability for objects; that is, if S is a subtype of Tthen objects of type T in a program may be replaced with objects of type S without altering any of barbqra desirable properties of that program e.
Barbara Liskov and Jeannette Wing described the principle succinctly in a paper as follows:. More formally, the Liskov substitution principle LSP is a particular definition of a subtyping relation, called strong behavioral subtypingthat was initially introduced by Barbara Liskov in a conference keynote address titled Data abstraction and hierarchy.