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.
|Country:||Papua New Guinea|
|Published (Last):||27 May 2018|
|PDF File Size:||19.96 Mb|
|ePub File Size:||7.27 Mb|
|Price:||Free* [*Free Regsitration Required]|
Liskov substitution principle
Please help to improve this article by introducing more precise citations. Object-oriented programming Type theory Programming principles Formal methods Programming language semantics.
It is a semantic rather than merely syntactic relation, because it intends to guarantee semantic interoperability of types in a hierarchy, object types in particular.
The formalization of the principle by its authors. Barbara Liskov and Jeannette Wing described the principle succinctly in a paper as follows:.
For the economic principle, see Substitute good. Views Read Edit View history.
An article popular in the object-oriented programming community that gives several examples of LSP violations. A keynote address in which Liskov first formulated the principle.
This page was last edited on 27 Novemberat Leavens and Krishna K. Nonetheless, the principle is useful in reasoning about the design of class hierarchies. More formally, the Liskov substitution principle LSP is a particular definition of a subtyping relation, called strong behavioral subtypingqnd was initially introduced by Barbara Liskov in a conference keynote address titled Data abstraction and hierarchy. This article includes a list of referencesbut its sources remain unclear because it has insufficient bierarchy citations.
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. Contains a gentler introduction to behavioral subtyping in its various forms in chapter 2. The rules on pre- and postconditions are identical to those introduced by Bertrand Meyer in his book Object-Oriented Software Construction.
An updated version appeared as CMU technical report: In addition to the signature requirements, the subtype must meet a number of behavioural conditions. Liskov’s daya 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 the desirable properties of that program bastraction.
Liskov substitution principle – Wikipedia
These are detailed in a terminology resembling that of design by contract methodology, leading to some restrictions on how contracts can interact with inheritance:. Leavens, Murali Sitaraman, ed.
This paper surveys various notions of behavioral subtyping, including Liskov and Wing’s. 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.
October Learn how and when to remove this template message. 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.
Taking aliasing into account was the major improvement made by Liskov and Wingand a key ingredient is the history constraint. Liskov, Barbara ; Wing, Jeannette July This paper discusses LSP in the mentioned context.
From Wikipedia, the free encyclopedia. A behavioral notion of subtyping.
Behavioural subtyping is undecidable in general: Articles lacking in-text citations from October All articles lacking in-text citations. Substitutability is a principle in 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. In the same barbar, Liskov and Wing detailed their notion of behavioral subtyping in an extension of Hoare logic hierarhy, which bears a certain resemblance to Bertrand Meyer ‘s design by contract in that it considers the interaction of subtyping with preconditionspostconditions and invariants.