17 Feb
2006
17 Feb
'06
4:10 a.m.
On Thu, Feb 16, 2006 at 12:27:54PM +0000, Robin Green wrote:
But are there any decidable type checking algorithms that have been seriously proposed or used which would take far too long to terminate for real code? If not, then decidability is the only thing that matters.
Perhaps they weren't proposed because decidability was not the only thing that mattered? Best regards Tomasz -- I am searching for programmers who are good at least in (Haskell || ML) && (Linux || FreeBSD || math) for work in Warsaw, Poland