Re: Visitor pattern w/ separate iterator (like fold) need ideas

In comp.lang.functional, I <cfc@shell01.theworld.com> wrote:
> So, I am soliciting suggestions on how to improve this model.
> Including ones like read the XYZZY book or article.


Vesa Karvonen replied:
> Since you asked, cursory reading of your article reminded me of an
> article by Jeremy Gibbons discussed (and linked to) here:
>
> Design Patterns as Higher-Order Datatype-Generic Programs
> http://lambda-the-ultimate.org/node/1360


and Ralf Laemmel replied:
> I recommend looking into Joost Visser's work on visitor combinators [1],
> more generally into strategic programming, where traversal strategies
> are programmer-definable abstractions that are derived from single
> primitives such as traversal of immediate children; there is a lot of
> related work on Eelco Visser's, Joost Visser's and my web sites, but I
> refer to [2] most specifically because it describes the notion of
> strategic programming with some useful reference to OO programming, and
> it also refers to adaptive programming, which is something you as well
> could want to review for the purposes of your design.
>
> [1] http://doi.acm.org/10.1145/504282.504302
>
> [2] http://doi.acm.org/10.1145/643603.643621


Thank you both! These are exactly the kinds of references I was
looking for. One quickly learns that when one comes up with an idea
that there are others that have had the same or similar ideas. I have
read these references quickly and can already see that they will
influence my perspective on the problem. Having combinator
(functions) that allow one to combine traversals and visitors will
certainly extend the reach of the model.


------------------------------------------------------------------------


As an aside to Ralf's longer comment/question which I didn't quote, I
can see your point of eliminating the state. That does simplify some
things (and is certainly appropriate from an FP perspective, as state
is an implementation artifact). My exposure of the state was simply
my all-too-imperative-background.


Again, thanks for the insights, my world has improved,
-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
23 Bailey Rd voice : (508) 435-5016
Berlin, MA 01503 USA fax : (978) 838-0263 (24 hours)

Return to the comp.compilers page.
Search the comp.compilers archives again.