[stack] Re: Motivations to embrace undecidable type systems

"hallucious" <[email protected]>
Newsgroups gmane.comp.lang.concatenative
Message-ID <[email protected]> 
If decidable type inference means that the type of quotations and compositions of functions can be inferred and expressed, then I think that type inference is decidable in this system. You are not forced to simplify. (I should have pointed that out.)

But I do not think that type checking or type equality are decidable.
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.