]> On Sun, Jan 26, 2003 at 08:01:16PM +0100, Oliver Bandel wrote: [...] > > a) Converting the list to an array, shorten the array, > converting back to a list, using the list in a functional > manner. > > b) Using pattern match to throw away the first element, then > working in the part after the "->" with a function, which > works on the rest of the list. > > c) using a function, which uses an index, for counting, at which > position we are inside of the list OK, I've found a very simple solution. :) OK, it is functional programming..... OK, it is Ocaml... OK, I use pattern matching.... OK, this is my solution: let discard_first lis = match lis with [] -> [] | hd::tl -> tl So, the main way to get a solution to a program in fp is simply: write a function for the simplest case, and then use that function... The last days I often, over and over again found, that I most of the times think more complicated, than a solution in FP is! Maybe this "think complicated" is an imperative illness. (?!) And more and more I see, what the difference between FP and IP is: It's much more easy than an IP-programmer thought that it is. It's unbelievable, that I every day see more examples of how easy programming can be, if it is functional. nearly unbelievable.... Ciao, Oliver ------------------- 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