Battle-plan for CTFE

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

On Sunday, 15 May 2016 at 10:29:21 UTC, Martin Nowak wrote:
> On 05/10/2016 08:45 AM, Jacob Carlborg wrote:
> overhead and complexity over an AST interpreter. If you want to 
> go really fast you need some sort of JIT anyhow, but a proper 
> interpreter will be orders of mangnitude faster than the 
> current implementation.

If you are going to have fast evaluation of loops/recursion then 
you need to use a solver. And well, doing worse than O(log N) at 
compile time is a very bad idea.

Why not start with the most difficult case first? Then the simple 
cases will resolve themselves for free, most likely.