Re: The wisdom of the object mentors (Was: Searching OO Associations with RDBMS Persistence Models)

Patrick May wrote:
> "topmind" <topmind_at_technologist.com> writes:
> > Sure, some parameters may be nouns, but which noun gets to be King
> > Noun? Rather than arbitrarily promote one, make them *all*
> > parameters.
> >
> > noun1.doX(noun2, noun3); // artificial promotion of a noun One
> >
> > Versus:
> >
> > doX(noun1, noun2, noun3); // equal footing
>
> This is an issue with languages that support only single
> dispatch, not with OO in general. Common Lisp's CLOS allows exactly
> what you describe in your second example, while providing strong
> support for OO.

You mean predicate-based algorithm look-up? Sounds like TOP-ish relational to me. (And/or Prolog-like perhaps.)

>
> Regards,
>
> Patrick

-T- Received on Tue Jul 04 2006 - 08:15:39 CEST