I have a similar utility but it is limited to work on tacit verbs; see,
http://www.jsoftware.com/pipermail/general/2009-August/033224.html
It might, or might not, be possible to generalize it easily. Also,
one has to avoid circular definitions (that is, plain and mutual
recursion, anonymous recu
When I was working in APL in the 1980s there used to be a utility
function called'Tree':
TREE'F0'
F0
..F1*
..F2
F2_1*
..F2_1_1*
F2_2*
..F3*
i.e. an indented list of function calls.(The real functions would have names).
Has anyone done anything similar for J?
---
