Positive Dedalus programs tolerate non-causality ?
We provide an initial investigation of the CRON conjecture by J.M. Hellerstein. This conjecture relates causality of message delivery to program monotonicity. We formalize the conjecture for the language Dedalus, that is inspired by Datalog. We show that positive programs remain correct when messages are sent into the past.
causality declarative networking asynchronous communication