Re: Algorithms, term rewriting and compile time reflection

[via Digitalmars-d]

On Thursday, 23 October 2014 at 13:57:03 UTC, Low Functioning 
wrote:
How about a function returns a T', which is implicitly 
convertible to T, where T' has some enum "tags" attached to it.

Why is implicit conversion a problem? To the compiler it would 
just be another function call?