Re: [Haskell-cafe] Decidable type systems? (WAS: Associated TypeSynonyms question)

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.

Surely what matters is that they don't take far too long to terminate! Cheers, Miles