On Sunday, 15 May 2016 at 12:00:43 UTC, Martin Nowak wrote:
On 05/15/2016 01:55 PM, Ola Fosheim Grøstad wrote:
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.
Why not do something that takes about a month and is much more
likely to succeed?
Well, you can, but it won't bring improvements to the language
down the line. If typical CTFE can be rewritten as simple tail
recursion then you probably can find existing libraries that will
do it for you.