| tuple | |
| 1. n. (set theory) A finite sequence of terms. | |
| A tuple is not merely a totally-ordered set because the same element can appear more than once in a tuple: for example,(a, b, a) qualifies as a 3-tuple whereas it would not qualify as a totally | |
| If commutativity were added to a tuple, it would turn into a multiset or "bag". For example, words (of some alphabetic language) can be considered to be tuples of letters. If the ordering requi | |
| 2. n. (computing) A single row in a relational database. | |
| 3. n. (computing) A set of comma-separated values passed to a program or operating system as a parameter to a function call. | |
| 4. n. (computing) In some programming languages, a data type that is similar but distinct from the list data type, whose instances are characterized by having a rather fixed arity, and the elements of which | |
| Both Python and Haskell have a tuple data type as well as a list data type. | |
| Unlike lists, tuples are not formed by consing. | |
