Manuscript En03-A@1 · En03-A.tex · definition · 5398614e

Definition: Certified interface rules

Typed interfaces and semantic configurations › Three rule kinds · lines 502–533

En03-A@1#def:rules, En03-A@1#eq:matter-rule, En03-A@1#eq:coupling

Back to manuscript

A finite run uses:

  1. A geometric rule, or -rule, which replaces supported geometric labels by a specified function of those labels and declared resources. It does not inspect matter state or matter-name cardinality. Its complete output is admissible and includes location transport.

    A transition rule specifies incoming and outgoing germs, their common event realization, and both one-sided continuations.

  2. A matter rule, which applies a declared channel

    on a named local interface, tensored with the identity on the remaining names. It may depend on , but does not change . Allocation and output locations are part of its certificate.

  3. A coupling rule, which declares a unital observable algebra and updates geometry by

    It returns a complete admissible configuration and a location transport map. It leaves the matter density operator unchanged.

Displayed formulas in this passage

  • En03-A@1#eq:matter-rule · line 516

  • En03-A@1#eq:coupling · line 526

Nearby in this section