is type checking in D undecidable?

Paul Backus snarwin at
Thu Oct 22 20:37:22 UTC 2020

On Thursday, 22 October 2020 at 19:24:53 UTC, Bruce Carneal wrote:
> On a related topic, I believe that type functions enable a 
> large amount of code in the "may be hard to prove decidable" 
> category (templates) to be (re)written as clearly decidable 
> code.  Easier for the compiler to deal with and, more 
> importantly, easier to teach.

Type functions, like regular functions, are Turing-complete, and 
therefore undecidable in the general case.

More information about the Digitalmars-d-learn mailing list