Battle-plan for CTFE

[Ola Fosheim Grøstad via Digitalmars-d-announce]

On Sunday, 15 May 2016 at 13:44:45 UTC, Martin Nowak wrote:
>  2^^15 | 3.7s  | 4.8G | 0.13s | 10.0M
>  2^^16 | 5:30m | 15G  | 0.13s | 10.8M
>
> D's CTFE grows O(N^2) b/c it leaks for almost every operation.
> We don't currently need a superfast interpreter, even the 
> simplest
> possible interpreter will allow so much more that we're more 
> likely
> limited by the lack of I/O before we need a faster interpreter.

Well, this looks really bad.  But a solver would get you much 
more than an interpreter. E.g. proving that asserts always hold 
etc.