Hello,
I have a question that may pertain to type theory.
According to Enderton, one of the ways to define an ordered pair (a,b)
is {{a},{a,b}}. A relation is defined as a set of ordered-pairs. A
map, of course, is a single-valued relation.
Given all that, suppose I have a FiniteMap Int
On 2004 July 26 Monday 13:46, [EMAIL PROTECTED] wrote:
According to Enderton, one of the ways to define an ordered pair (a,b)
is {{a},{a,b}}. A relation is defined as a set of ordered-pairs. A
map, of course, is a single-valued relation.
The motivation for defining ordered pairs that way is
