On 4/25/06, Antti-Juhani Kaijanaho <[EMAIL PROTECTED]> wrote:
> John Meacham wrote:
> > * every runnable thread is guarenteed to run in a finite amount of time if a
> > program reaches a yield-point infinitly often.
> "Infinitely often" is unclear
"Infinitely often" is a very well-defined term in temporal logic. I
think it is this that John is referring to.
--
Taral <[EMAIL PROTECTED]>
"You can't prove anything."
-- Gödel's Incompetence Theorem
_______________________________________________
Haskell-prime mailing list
[email protected]
http://haskell.org/mailman/listinfo/haskell-prime
