I think simulating normal-order evaluation in an eager language is quite
an enlightening exercise; thanks for the suggestion of that!
Although I note with some dismay that I still find it simpler to think in
terms of imperative objects when it comes to knocking out an
implementation.
Actually, that's kind of a topic for a pub conversation, perhaps. I don't
know about anyone else, but I found when I was hacking in Prolog that I
wasn't _truly_ thinking in a declarative style - rather, in the back of my
head I was always translating what I was writing into my intuitions about
how an (imperative) implementation of Prolog would behave.
I think I still have the same kind of habit with FP, although I'm able to
suppress it more these days.
Anyway, having had a bit of a think about it I reckon I've a reasonable
outline for that talk on Zippers next month. No required reading will be
necessary - I'm intending to motivate the problem and develop the solution
in an entirely self-contained way.
Cheers,
jan
--
Update your address books:
ja...@ioctl.org http://ioctl.org/jan/