Re: The wisdom of the object mentors (Was: Searching OO Associations with RDBMS Persistence Models)
Date: 1 Jun 2006 13:07:49 -0700
> 1. Mapping (call to) the tuple of arguments to the tuple of results
> Map : f x x1 x x2 x ... x xN -> y1 x y2 x ... x yN
> 2. Composition:
> o : f1 x f2 -> f1 (f2 (x))
> 3. Comparison
> = : f1 x f2 -> Boolean
> 4. Copy (for marshaling, closures etc)
> := : f -> f
Copying is not a logical operation. Yet it corresponds to a trivial relational query that outputs the same relation.
> 5. Convolution
> * : f1 x f2 x sum x prod x inv -> sum (prod (f(x), g(inv (x)))
> 6. Extension
> and so on
What is extension?
> >> But that is rather trivial and uninteresting.
> > Well, it's hardly trivial for numbers, why it suddenly becomes trivial
> > for functions?
> Because in this particular case function is a value and values are outside
> the language scope. Somewhere in the application domain exists 2. So there
> does sine. You don't care what they are. You only need some object to
> represent them. Let the bit pattern 0x1 represent 2 and 0x2 do sine. End of
> Don't you see any difference between mathematical constructs and
> programming language objects?
Yes. Programming language objects are bastardized counterparts of mathematical constructs. Received on Thu Jun 01 2006 - 22:07:49 CEST