Re: Algorithms, term rewriting and compile time reflection

[Low Functioning via Digitalmars-d]

How about a function returns a T', which is implicitly 
convertible to T, where T' has some enum "tags" attached to it.