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:

    “It took six weeks of debate in the Senate to get the Arms Embargo Law repealed—and we face other delays during the present session because most of the Members of the Congress are thinking in terms of next Autumn’s election. However, that is one of the prices that we who live in democracies have to pay. It is, however, worth paying, if all of us can avoid the type of government under which the unfortunate population of Germany and Russia must exist.”
    —Franklin D. Roosevelt (1882–1945)

    “Freud was a hero. He descended to the “Underworld” and met there stark terrors. He carried with him his theory as a Medusa’s head which turned these terrors to stone.”
    —R.D. (Ronald David)