This might be off-topic, but wasn't there some work on a purely 
functional approach to this (?) problem? Looking back in my own ocaml 
code in the sparse matrix module in CamlFloat, I see that I used Gerard 
Huet's ideas on "contextual lists" (I think that is what it was 
called), which seems to have some bearing on this discussion.

--shiv--

PS:

I found some references:

  G. Huet. Linear Contexts and the Sharing Functor: Techniques for 
Symbolic Computation. Workshop on Thirty Five Years of Automath, 
Heriot-Watt University, Edinburgh, April 2002. Slides available as  ps. 
Final version in Thirty Five Years of Automating Mathematics, ed. 
Fairouz Kamareddine, Kluwer 2003. Available electronically as  pdf or 
ps.

at

http://pauillac.inria.fr/~huet/bib.html

On Apr 28, 2004, at 4:38 AM, skaller wrote:

> The key thing characterising an iterator appears to be
> that it is some state representing a position in a data
> structure.

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners