Re: Storing data and code in a Db with LISP-like interface
From: Neo <neo55592_at_hotmail.com>
Date: 13 Apr 2006 13:10:12 -0700
Message-ID: <1144959012.236946.261840_at_e56g2000cwe.googlegroups.com>
Date: 13 Apr 2006 13:10:12 -0700
Message-ID: <1144959012.236946.261840_at_e56g2000cwe.googlegroups.com>
> > > The only thing that matters is what operators do you have.
> > >.. ultimately it is the algebra or calculus that counts.
> >
> > Based on you assertion, it *appears* you are lacking some operator,
> > algebra or calculus as you are unable to apply the ones
> > you do know to solves the problem.
>
> You are seeing things.
> > Create a function that given a hierarchy and a thing in the hierarchy
> > returns the root.
>
> Why?
> > Please demonstrate ...
>
> getRoot: Hierarchy * Thing --> Thing ?
> getRoot(h,t)={x / is-a(h,t,x) and for all y in h not is-a(h,x,y) }
If anyone was successful in verifying the above solution, please post the steps :) Received on Thu Apr 13 2006 - 22:10:12 CEST