In general, it is hard to tell if a computation is long-running or unsolvable.
You could even say ... it's undecidable :)
Re: is type checking in D undecidable?
Stefan Koch via Digitalmars-d-learn Thu, 22 Oct 2020 11:42:14 -0700
On Thursday, 22 October 2020 at 18:33:52 UTC, Ola Fosheim Grøstad
wrote:
- is type checking in D undecid... Bruce Carneal via Digitalmars-d-learn
- Re: is type checking in ... Ola Fosheim Grøstad via Digitalmars-d-learn
- Re: is type checking... Bruce Carneal via Digitalmars-d-learn
- Re: is type chec... Ola Fosheim Grøstad via Digitalmars-d-learn
- Re: is type ... Stefan Koch via Digitalmars-d-learn
- Re: is ... Ola Fosheim Grøstad via Digitalmars-d-learn
- Re: is type chec... Kagamin via Digitalmars-d-learn
- Re: is type ... Bruce Carneal via Digitalmars-d-learn
- Re: is type checking in ... Dennis via Digitalmars-d-learn
