A Type-and-Effect System for Temporal Dependency Analysis of Render-based Reactive Programs

• URL: http://arxiv.org/abs/2607.27074v1
• Date: Wed, 29 Jul 2026 15:59:21 GMT
• Title: A Type-and-Effect System for Temporal Dependency Analysis of Render-based Reactive Programs
• Abstract summary: We present Willow, a calculus for reactive programming inspired by React.<n>Willow gives a time-aware operational semantics that models computation in terms of renders.<n>We show that Willow provides a practical foundation for reasoning about the temporal correctness of reactive programs.
• Score: 1.7400522414589747
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Reactive programming frameworks such as React allow developers to build interactive applications by declaratively specifying how outputs depend on changing inputs. Although this model makes it easy to reason about what an application computes, the temporal behavior of reactive programs remains difficult to understand and verify. Applications implicitly rely on timing assumptions buried in framework runtimes, leading to subtle bugs such as stale reads, transient inconsistencies, order-dependent behavior, and unintended feedback cycles. To address these challenges, this paper presents Willow, a core calculus for reactive programming inspired by React. Willow gives a time-aware operational semantics that models computation in terms of renders, the fundamental evaluation step in which components produce user interface descriptions, and pairs it with a novel type-and-effect system that statically tracks timing behavior as effects. A "next" modality expresses delays measured not only in renders but in any unit the host environment exposes--renders, network requests, or milliseconds. A family of modalities tracks the lifecycle of event handlers: when they are registered, when they fire, when pending events are canceled and when handlers are removed. A key insight is that the resulting effects form a temporal dependency graph, letting standard graph algorithms statically detect render cascades and inter-render loops that cause non-termination or performance degradation. We formalize Willow and prove preservation of the effect system with respect to the time-aware semantics. We also implement a prototype checker with automatic effect inference and evaluate it on representative reactive patterns such as debouncing, form inputs, and API-driven updates. Our results demonstrate that time-aware typing provides a practical foundation for reasoning about the temporal correctness of reactive programs.

Related papers

• Continuous Interaction Diffusion: A Diffusion-Native Runtime for Asynchronous Tool-Augmented Reasoning [10.650418762477475]
  Large language models increasingly rely on external tools to access up-to-date information, perform computation, and interact with the outside world.<n>For autoregressive models, tool use naturally fits the generation process: the model emits a tool call, waits for the result, and then continues generating.<n>It can force tool decisions before the model's reasoning has stabilized, delay useful observations until a discrete call finishes, and introduce redundant refinement and tool execution.<n>We introduce Continuous Interaction Diffusion (CID), a diffusion-runtime architecture that integrates model interaction into denoising.
  arXiv  Detail & Related papers  (2026-08-11T03:35:59Z)
• ScrambleToolBench: Agents Search Exhaustively Even When Their Own Map Points to the Next Step [74.83535434786145]
  We introduce ScrambleToolBench, an interactive terminal benchmark designed to isolate behavioral reasoning.<n>The benchmark requires agents to uncover hidden tool behaviors entirely through trial-and-error interaction.<n>Our evaluation of state-of-the-art language models reveals that successful initial discovery does not translate into robust adaptation.
  arXiv  Detail & Related papers  (2026-08-03T15:07:46Z)
• Explainable Runtime Dependency Tracking for AI-RAN Conflict Monitoring [0.0]
  Future AI-integrated Radio Access Networks (AI-RAN) will combine open programmability with learning-enabled xApps, rApps, and control functions that act on shared parameters and key performance indicators (KPIs)<n>For conflict monitoring, it is not enough to know which applications are deployed; the system must also know whether the parameter--KPI dependencies assumed by runtime diagnosis remain valid under the current operating regime.<n>This paper studies a lightweight monitoring primitive for that purpose: tracking an interpretable dependency representation from streaming telemetry events.
  arXiv  Detail & Related papers  (2026-06-04T19:21:32Z)
• MultiAct: Text-to-Motion Generation from Composite Text via Tailored Attention Guidance [54.131431576597514]
  MultiAct is an unpaired, inference-time framework for compositional text-to-motion synthesis.<n>Our method counteracts semantic collapse by adaptively amplifying cross-attention scores associated with underrepresented prompt components.
  arXiv  Detail & Related papers  (2026-05-29T07:14:48Z)
• A Physical Agentic Loop for Language-Guided Grasping with Execution-State Monitoring [5.437966695589128]
  We reformulate language-guided grasping as a bounded embodied agent operating over grounded execution states.<n>We introduce a physical agentic loop that wraps an unmodified learned manipulation primitive.<n>We validate the resulting loop on a mobile manipulator with an eye-in-hand D405 camera.
  arXiv  Detail & Related papers  (2026-04-08T08:01:35Z)
• Dynamic analysis enhances issue resolution [53.50448142467294]
  DAIRA (Dynamic Analysis-enhanced Issue Resolution Agent) is an automated repair framework that embeds dynamic analysis into the agent's reasoning cycle.<n> Driven by a Test Tracing-Driven methodology, DAIRA utilizes lightweight monitors to extract critical runtime data.<n>When powered by Gemini 3 Flash Preview, DAIRA establishes a new state-of-the-art (SOTA) performance, achieving a 79.4% resolution rate on the SWE-bench Verified dataset.
  arXiv  Detail & Related papers  (2026-03-23T14:48:54Z)
• FASTER: Rethinking Real-Time Flow VLAs [82.58822112377923]
  Real-time execution is crucial for deploying Vision-Language-Action (VLA) models in the physical world.<n>We show that reaction time follows a uniform distribution determined jointly by the Time to First Action (TTFA) and the execution horizon.<n>We propose Fast Action Sampling for ImmediaTE Reaction (FASTER) to overcome this issue.
  arXiv  Detail & Related papers  (2026-03-19T17:51:37Z)
• Reactive Knowledge Representation and Asynchronous Reasoning [35.58961985804191]
  Exact inference in complex probabilistic models often incurs prohibitive computational costs.<n>Existing methods are often inefficient for ongoing reasoning, as they re-evaluate the entire model upon any change.<n>We first introduce Resin, a probabilistic programming language that merges probabilistic logic with reactive programming.<n>To provide efficient and exact semantics for Resin, we propose Reactive Circuits (RCs)<n>In high-fidelity drone swarm simulations, our approach achieves several orders of magnitude of speedup over frequency-agnostic inference.
  arXiv  Detail & Related papers  (2026-02-05T13:02:01Z)
• Sliding-Window Signatures for Time Series: Application to Electricity Demand Forecasting [2.8173956667218305]
  We propose a novel forecasting framework based on ridge regression with signature features calculated on sliding windows.<n>We establish theoretical guarantees, namely universality of approximation and stationarity of signatures.<n>Results show that signature features effectively encode temporal and nonlinear dependencies, yielding accurate forecasts competitive with those based on expert knowledge.
  arXiv  Detail & Related papers  (2025-10-14T09:49:30Z)
• On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
  Temporally causal representation learning aims to identify the latent causal process from time series observations. Most methods require the assumption that the latent causal processes do not have instantaneous relations. We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
  arXiv  Detail & Related papers  (2024-05-24T08:08:05Z)
• TimeGraphs: Graph-based Temporal Reasoning [64.18083371645956]
  TimeGraphs is a novel approach that characterizes dynamic interactions as a hierarchical temporal graph. Our approach models the interactions using a compact graph-based representation, enabling adaptive reasoning across diverse time scales. We evaluate TimeGraphs on multiple datasets with complex, dynamic agent interactions, including a football simulator, the Resistance game, and the MOMA human activity dataset.
  arXiv  Detail & Related papers  (2024-01-06T06:26:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.