On Wed, Sep 29, 2004 at 09:48:03PM +0300, Radu Grigore wrote:
> For this message I'll classify functions on "levels" based on how many
> nested parenthesis are needed to represent their type.
[...]
> (e.g. (('a -> 'b -> 'a) -> 'a -> 'b list -> 'a) -> 'c)? If so, are
> there any typical ones that appear in many applications (maybe not as
> widespread like map & company but at least of comparable usefulness)?
> One example of a level 2 function (stolen from a recent post by Jon
> Harrop) is this:
>   let sum fold = fold (+);;

You may have a look at:

  http://tomasz.ii.uni.wroc.pl/ComplexityOfML.pdf

for some statistical data regarding type sizes and orders.

-- 
: Michal Moskal :: http://www.kernel.pl/~malekith :: GCS !tv h e>+++ b++
: ::: Logic is a nice contrast to the Real World. :: UL++++$ C++ E--- a?

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