Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Dynamically evaluating OCaml code
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Issac Trotts <ijtrotts@u...>
Subject: Re: [Caml-list] Dynamically evaluating OCaml code
On Thu, Apr 08, 2004 at 04:31:26PM +0100, Jon Harrop wrote:
> On Thursday 08 April 2004 3:56 pm, Markus Mottl wrote:
> > On Thu, 08 Apr 2004, John Goerzen wrote:
> > > Similar complaints exist for working with subsets of lists; it's really
> > > too hard to say "replace elements 4 through 9 with this", "delete
> > > elements 4 through 9", "return elements 4 through 9", etc.
> >
> > Yes, it's hard to do this with the current standard library.  The question
> > is: who needs these functions anyway?  I can't remember ever having felt
> > a need for them.
> 
> I could do with them! There are numerous such functions (and nice 
> implementations, like "List.nth -1 l" fetching the last element, more 
> powerful flatten etc.) which Mathematica has and which I miss.

GCaml has the ability to do this kind of total flattenning of nested
lists.  OCaml cannot do it unless you re-express your nested lists as
binary trees or something similar.

-- 
Issac Trotts
http://mallorn.ucdavis.edu/~ijtrotts
(w) 530-757-8789

-------------------
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