concurrency guarentees clarification
taralx at gmail.com
Wed Apr 26 16:18:50 EDT 2006
On 4/25/06, Antti-Juhani Kaijanaho <antti-juhani at kaijanaho.info> 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 <taralx at gmail.com>
"You can't prove anything."
-- Gödel's Incompetence Theorem
More information about the Haskell-prime