is type checking in D undecidable?

Stefan Koch uplink.coder at
Thu Oct 22 18:38:12 UTC 2020

On Thursday, 22 October 2020 at 18:33:52 UTC, Ola Fosheim Grøstad 
> In general, it is hard to tell if a computation is long-running 
> or unsolvable.

You could even say ... it's undecidable :)

More information about the Digitalmars-d-learn mailing list