Hello,
I am looking at this paper you are probably familiar with:
I am trying to find something in FJ which resembles the foldtree function shown there. My ultimate goal is to have the examples rewritten in Functional Java.
As you can see, foldtree takes two separate functions - one which combines siblings, and one which combines the parent with the folded siblings. (If I understood correctly)
Is there something similar in FJ?
Thanks for your time.
Regards, Dimitar