Thank you Elan. I am very interested in languages with small footprints and lots of power. One thing I look for is the ability to treat code as data that can be dynamically manipulated and subsequently executed ala John Koza's Genetic Programming http://www.genetic-programming.com/ I would also like to invite you to check out http://www.kx.com/download/products_download_k.html another lang that weighs in at under 300k for which I have used to independently verify Koza's Lisp and C results. I am very excited about kicking Rebol's tires. [EMAIL PROTECTED] wrote: > > Hi ebierly > > you wrote: > >a:"ed" > >b:"a" > >c:"b" > >>> do do c > >== ed > >Is there a way to determine the depth of indirection such as f of c = 2? > > depth?: func [word [word!] /local depth] [ > depth: 0 > while [ value? to-word :word ] [ > word: get to-word :word > depth: depth + 1 > ] > depth > ] > > >> depth? 'a > == 1 > >> depth? 'b > == 2 > >> depth? 'c > == 3 > > Note that depth? of 'a is 1, which I believe makes sense, and therefore > detph? 'c becomes 3. > > Elan
