Liskov substitution principle (Q957386)

From Wikidata
Jump to navigation Jump to search
object-oriented programming principle stating that, in a computer program, if S is a subtype of T, then objects of type T may be replaced with objects of type S without altering any of the desirable properties of the program (correctness, etc.)
  • LSP
  • strong behavioral subtyping
  • strong behavioural subtyping
  • Liskov substitutibility
edit
Language Label Description Also known as
English
Liskov substitution principle
object-oriented programming principle stating that, in a computer program, if S is a subtype of T, then objects of type T may be replaced with objects of type S without altering any of the desirable properties of the program (correctness, etc.)
  • LSP
  • strong behavioral subtyping
  • strong behavioural subtyping
  • Liskov substitutibility

Statements

Identifiers