Tag Archives: dynamic

Dynamic Anytime Algorithms

I’m still thinking about ways to eliminate stateful semantics from large-scale reactive applications for RDP, i.e. pursuing stability instead. Stateless semantics make an application more robust against resets, disruption or partitioning, etc.. To achieve stability without state requires accepting some indeterminism … Continue reading

Posted in Language Design | Tagged , , , , | 1 Comment