WOW.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Polymorphism (computer science) - Wikipedia

    en.wikipedia.org/wiki/Polymorphism_(computer...

    In programming language theory and type theory, polymorphism is the use of a single symbol to represent multiple different types. [1] In object-oriented programming, polymorphism is the provision of a single interface to entities of different types. [2] The concept is borrowed from a principle in biology where an organism or species can have ...

  3. Parametric polymorphism - Wikipedia

    en.wikipedia.org/wiki/Parametric_polymorphism

    In programming languages and type theory, parametric polymorphism allows a single piece of code to be given a "generic" type, using variables in place of actual types, and then instantiated with particular types as needed. [1] : 340 Parametrically polymorphic functions and data types are sometimes called generic functions and generic datatypes ...

  4. Subtyping - Wikipedia

    en.wikipedia.org/wiki/Subtyping

    In programming language theory, subtyping (also called subtype polymorphism or inclusion polymorphism) is a form of type polymorphism. A subtype is a datatype that is related to another datatype (the supertype) by some notion of substitutability, meaning that program elements (typically subroutines or functions), written to operate on elements ...

  5. Function overloading - Wikipedia

    en.wikipedia.org/wiki/Function_overloading

    t. e. In some programming languages, function overloading or method overloading is the ability to create multiple functions of the same name with different implementations. Calls to an overloaded function will run a specific implementation of that function appropriate to the context of the call, allowing one function call to perform different ...

  6. Polymorphic recursion - Wikipedia

    en.wikipedia.org/wiki/Polymorphic_recursion

    Roberts (p. 171) gives a related example in Java, using a Class to represent a stack frame. The example given is a solution to the Tower of Hanoi problem wherein a stack simulates polymorphic recursion with a beginning, temporary and ending nested stack substitution structure. See also. Higher-ranked polymorphism; Notes

  7. Composition over inheritance - Wikipedia

    en.wikipedia.org/wiki/Composition_over_inheritance

    Composition over inheritance (or composite reuse principle) in object-oriented programming (OOP) is the principle that classes should favor polymorphic behavior and code reuse by their composition (by containing instances of other classes that implement the desired functionality) over inheritance from a base or parent class. [2]

  8. Ad hoc polymorphism - Wikipedia

    en.wikipedia.org/wiki/Ad_hoc_polymorphism

    t. e. In programming languages, ad hoc polymorphism [1] is a kind of polymorphism in which polymorphic functions can be applied to arguments of different types, because a polymorphic function can denote a number of distinct and potentially heterogeneous implementations depending on the type of argument (s) to which it is applied. When applied ...

  9. Dynamic dispatch - Wikipedia

    en.wikipedia.org/wiki/Dynamic_dispatch

    e. In computer science, dynamic dispatch is the process of selecting which implementation of a polymorphic operation ( method or function) to call at run time. It is commonly employed in, and considered a prime characteristic of, object-oriented programming (OOP) languages and systems. [1]