Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] "Nasty" functions and memory usage
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Sebastien Carlier <sebc@p...>
Subject: Re: [Caml-list] "Nasty" functions and memory usage
Alex Baretta wrote:
> Now, my question is, how come the memory usage of the Ocaml (3.00)
> front end does not grow with time as it attempts to compute the
> type of, say, f6?

I think it's pretty-printing that is actually taking a lot of time.
During inference you would only have (2**n) types because there is a
lot of sharing.  However, if you try to print the type you will really
have (2**(2**n)) nodes to traverse.

To unsubscribe, mail  Archives: