On Fri, Aug 19, 2005 at 21:29:11 -0700, Larry Wall wrote: > Basically, unaries don't have to worry about reconciling different shapes. > They just recurse as much as is "reasonable", whatever that is.
Possible exact semantics of "reasonable":
hyper recurses at least one level, and then tries to match the
type of the hyper'ed function on each element. If the type does
not match, more attempts are made at recursion.
If at any point the shapes of the current node is different from
it's corresponding node in the other structure, then a binary
function is applied regardless of type (resulting in coercion or
a fatal error).
--
() Yuval Kogman <[EMAIL PROTECTED]> 0xEBD27418 perl hacker &
/\ kung foo master: /me does not drink tibetian laxative tea: neeyah!
pgpZh5buBST12.pgp
Description: PGP signature
