Set (abstract Data Type) - Type Theory

Type Theory

In type theory, sets are generally identified with their indicator function: accordingly, a set of values of type may be denoted by or . (Subtypes and subsets may be modeled by refinement types, and quotient sets may be replaced by setoids.) The characteristic function F of a set S is defined as: F(x) = \begin{cases} 1, & \mbox{if } x \in S \\ 0, & \mbox{if } x \not \in S \end{cases}

In theory, many other abstract data structures can be viewed as set structures with additional operations and/or additional axioms imposed on the standard operations. For example, an abstract heap can be viewed as a set structure with a min(S) operation that returns the element of smallest value.

Read more about this topic:  Set (abstract Data Type)

Famous quotes containing the words type and/or theory:

    “But the mother’s yearning, that completest type of the life in another life which is the essence of real human love, feels the presence of the cherished child even in the debased, degraded man.”
    —George Eliot [Mary Ann (or Marian)

    “There never comes a point where a theory can be said to be true. The most that one can claim for any theory is that it has shared the successes of all its rivals and that it has passed at least one test which they have failed.”
    —A.J. (Alfred Jules)