Hi Lennart and everyone else,

On July 1 (18:00 -0700), Lennart Augustsson wrote with possible deletions:
| [...]
| I think the type should (almost) explain what it does :), let me
| exemplfy for lists 
| recurse c n [] = n
| recurse c n (x:xs) = c x xs (recurse c n xs)
| 
| So it's like foldr, except that the cons function gets the tail of the list,
| not just the head.  With it you can define an efficient tail function.

this is nothing more than a wild suspicion, but is there any relation
between `recurse' and paramorphisms? (Maybe not as close as between
`foldr' and catamorphisms, but the availability of xs to the cons
function rang a bell.)

Cheers,
   --Teggy
-- 
  | Torsten Grust                              [EMAIL PROTECTED] | 
  |                                   http://www.fmi.uni-konstanz.de/~grust/ |
  | Database Research Group, University of Konstanz (Lake Constance/Germany) |


Reply via email to