\emph{Functional Reactive Programming~(FRP)} simplifies a universal concept found in software architecture and infrastructure: the idea that dependencies between data units should be managed by the underlying language, leaving developers and domain experts to merely define the units and their relationships. This pattern is ubiquitous, appearing in \texttt{React}’s unidirectional dataflow, build system graphs, and spreadsheet formulas.

A prevailing dogma dictates that to achieve determinism, dependency graphs must be \emph{Directed Acyclic Graphs (DAGs)}. This creates a fundamental tension between the \emph{software architect}, who examines the big picture to strictly enforce topology and prevent errors, and the \emph{software developer}, who focuses on the single unit of data and intuitively adds dependencies as needed. Consequently, safe languages restrict the developer with DAGs, while flexible systems allow cycles but force manual state management—defeating the very purpose of the reactive paradigm.

We introduce a semantic framework that resolves this tension. We define cyclic dependencies not as errors, but via \emph{constructive assignment}, where a variable’s value is the deterministic merge of converging data streams.

We present:

1. A semantic model by which FRP may contain cycles;

2. An architecture that integrates this model into \emph{Object-Oriented Programming (OOP)};

3. A change-propagation algorithm for the semantic model and architecture;

4. A concrete framework in the form of a language extension.

5. A clinical \emph{User Interface (UI)} prototype with a comparative analysis regarding modularity and code reuse as application requirements evolve.