Re: [Caml-list] Compile-time performance problem

[Goswin von Brederlow <goswin-v-b@web.de>]

On Tue, Nov 08, 2016 at 09:56:33AM +0100, Christoph H??ger wrote:
> let (<+) a v = Array.append a [|v|] 
> let foo k s =
>   ((fun k  -> fun s  -> (k#_continue_ (object (self)  end)) 1)
>      (object (self)
>         val _continue_ =
>           fun x  ->
>             (fun k  ->
>                fun s  ->
>                  ((fun k  -> fun s  -> (k#_continue_ (object (self)  end)) 2)
...

Do you have to use objects there? Does the problem go away if you use
a simple type for the continuation?

The thing with CPS is that your code can be converted into simple
jumps instead of function calls. Everything is a tail call. And all
your objects are dummies that can be optimized away if you try hard
enough. Really complex dummies. I can imagine the bytecode simply
creates the objects and calls the methods while the native code
optimizes it all away. Hard to say if that is linear (and really
slow), quadratic or exponential with just one example though.

MfG
	Goswin