Jump to text
On this page
Copy and source
Original source · lines 94–111
Published source confirmed at last check

Source changed 2026-11-16 21:18:08 UTC · snapshot created 2026-11-16 21:19:40 UTC · last check 2026-11-17 19:15:10 UTC

CP-DESCRIPTION-TO-BEHAVIOR - A notification rule becomes an ongoing service

  • Situation: You want messages from a named sender to trigger an immediate notification, while other messages wait for a later digest. A rule can be stated, but that statement does not yet define the behavior of the service.
  • Question: What information and operations make the rule executable, and which changes require another computational organization?
  • First useful result or blocker: An executable rule connected to its message and notification operations, with explicit conditions on identity, repetition and timeliness, or the unavailable information or operation that prevents that behavior.
  • Start with: C.29.2 for the computational question. Use CMP.16 if the units and operations still need construction; use CMP.12 when a rule description needs interpretation. A known adequate implementation can be used directly.
  • Stop or return: Stop when the required behavior is available with adequate grounds. A different source of messages, required observation or failure condition reopens the construction that depends on it.

Start with an admitted event containing a sender identifier, message identifier and content. Suppose sender identity is supplied reliably, events arrive once in order, and a notification operation is available. An interpreter can read a description such as If(SenderIs(Vasya), Notify, AddToDigest): test the supplied identifier and perform the selected action. CMP.12 derives the meaning of those constructors and their composition. Defining the description as data also permits a later tool to translate or analyze rules.

The word immediate introduces a further obligation. Decide whether the receiver needs an eventual response, a bound after receipt, or a bound after the message was sent. The last bound also depends on message transport. An interpreter that selects the correct action does not establish any of these timing guarantees by itself. C.29.3 connects computational operations to an actual executor and readout; the receiving work supplies the useful deadline and the consequences of missing it.

Now the transport may repeat a message. Re-executing Notify can duplicate an external effect, even if rule evaluation is a pure function. A message identifier and retained delivery state can support a changed operation, but recording before or after sending leaves different crash cases. CMP.14 develops the interaction and failure conditions; the Readme’s retry case below shows why a repeated logical request needs a different argument from a cached function result. CMP.10 helps select storage only after the required identity and retention conditions are known. Deleting delivery state after an arbitrary interval cannot preserve a promise covering later repetitions.

If messages must instead be classified by urgency inferred from content, the known sender test no longer supplies the decision rule. CMP.7 constructs the learner, its candidate rule family, feedback and conditions of further use; CMP.4 or CMP.6 can supply its search or update. Better training fit does not establish the future error rate, and classifier quality does not establish delivery behavior. A change to inference can therefore preserve the notification protocol while reopening the evidence for classification.

This one use can involve an interpreted description, learned behavior and an interacting realization without making all three compulsory. Their connection follows from what the service must do and what its environment supplies. The full methods explain the respective constructions.