fires-a-formation-once-however-often-it-is-met.yaml

# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# The memo of '--acyclic=plausible': 𝔼 is a function of the formation it
# fires, so two bindings spelling one term fire one formation twice, and a
# run firing it afresh each time mints two symbols for one value and fires
# everything under the second once more (#1476). The 'evaluate' lines of
# 'L_pair' fire 'a' and then 'b', which spell the very same sum. Under the
# mode the second firing takes what the first answered: it reduces nothing,
# mints nothing and lands 'b' on the very symbol 'a' came to. The protocol
# still writes the firing of 'b' at its own site, with the answer the firing
# of 'a' made, named after the line that made it, and with no operand line
# under it, since none was reduced (#1874).
symbolic: |
  - λ: L_number_plus
    dataize:
      𝛿1: $.ρ
      𝛿2: $.x
    𝑛: Φ.number( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
  - λ: L_pair
    morph:
      𝑛1: $.a
      𝑛2: $.b
    evaluate:
      𝑛3: 𝑛1
      𝑛4: 𝑛2
    𝑛: ⟦ φ ↦ ⟦ a ↦ 𝑛3, b ↦ 𝑛4 ⟧ ⟧
location: 'Q.p'
acyclic: plausible
input: >
  ⟦ bytes(φ) ↦ ⟦⟧,
    number(φ) ↦ ⟦ plus(ρ, x) ↦ ⟦ λ ⤍ L_number_plus ⟧ ⟧,
    p ↦ ⟦
      a ↦ 7.plus( 5.plus( 6 ) ),
      b ↦ 7.plus( 5.plus( 6 ) ),
      λ ⤍ L_pair ⟧.φ ⟧
result: >
  ⟦ a ↦ ⟦ φ ↦ 𝜎2:λ, plus(x) ↦ L_number_plus:λ ⟧,
    b ↦ ⟦ φ ↦ 𝜎2:λ, plus(x) ↦ L_number_plus:λ ⟧ ⟧
protocol: |
  𝕄(Φ.p):
    𝔼(L_pair):
      𝕄(Φ.a🌵0):
        𝑛·1·1 := 7
        𝑛·1·2 := 𝑛·1·1.plus( x ↦ 5.plus( 6 ) )
      𝑛1·1 := 𝑛·1·2  # 𝕄(ξ.a)
      𝕄(Φ.a🌵1):
        𝑛·1·3 := 7
        𝑛·1·4 := 𝑛·1·3.plus( x ↦ 5.plus( 6 ) )
      𝑛2·1 := 𝑛·1·4  # 𝕄(ξ.b)
      𝔼(L_number_plus):  # 𝔼(𝑛1)
        𝔻(Φ.a🌵2):
          𝕄(Φ.a🌵2):
            𝑛·2·1 := 7
            𝑛·2·2 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ )
          𝛿·2·1 := 40-1C-00-00-00-00-00-00  # 7.0
        𝛿1·2 := 𝛿·2·1  # 𝔻(ξ.ρ)
        𝔻(Φ.a🌵3):
          𝕄(Φ.a🌵3):
            𝑛·2·3 := 5
            𝑛·2·4 := 𝑛·2·3.plus( x ↦ 6 )
          𝔼(L_number_plus):
            𝔻(Φ.a🌵4):
              𝕄(Φ.a🌵4):
                𝑛·3·1 := 5
                𝑛·3·2 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ )
              𝛿·3·1 := 40-14-00-00-00-00-00-00  # 5.0
            𝛿1·3 := 𝛿·3·1  # 𝔻(ξ.ρ)
            𝔻(Φ.a🌵5):
              𝕄(Φ.a🌵5):
                𝑛·3·3 := 6
                𝑛·3·4 := Φ.bytes( φ ↦ 40-18-00-00-00-00-00-00:Δ )
              𝛿·3·2 := 40-18-00-00-00-00-00-00  # 6.0
            𝛿2·3 := 𝛿·3·2  # 𝔻(ξ.x)
            𝑛·3·5 := Φ.number( φ ↦ 𝜎1:λ )  # 𝑛
            𝕄(𝑛·3·5):
              𝑛·3·6 := Φ.number( φ ↦ 𝜎1:λ )
            𝑛·3·7 := 𝑛·3·6  # 𝕄(𝑛·3·5)
        𝛿2·2 := 𝔻(𝜎1:λ)  # 𝔻(ξ.x)
        𝑛·2·5 := Φ.number( φ ↦ 𝜎2:λ )  # 𝑛
        𝕄(𝑛·2·5):
          𝑛·2·6 := Φ.number( φ ↦ 𝜎2:λ )
        𝑛·2·7 := 𝑛·2·6  # 𝕄(𝑛·2·5)
      𝑛3·1 := 𝑛·2·7  # 𝔼(𝑛1)
      𝔼(L_number_plus):  # 𝔼(𝑛2)
        𝑛·4·1 := 𝑛·2·6  # 𝑛
        𝑛·4·2 := 𝑛3·1  # 𝕄(𝑛·4·1)
      𝑛4·1 := 𝑛·4·2  # 𝔼(𝑛2)
      𝑛·1·5 := ⟦ a ↦ 𝑛·2·6, b ↦ 𝑛·2·6 ⟧:φ  # 𝑛
      𝑛·1·6 := ⟦ a ↦ 𝑛·2·6, b ↦ 𝑛·2·6 ⟧:φ  # 𝕄(𝑛·1·5)