writes-the-binding-a-deep-firing-stands-in.yaml

# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# The site a firing is written under, which the '--deep' walk refines as it
# enters a binding: both firings are of the same entry and answer the same way,
# so the locator standing beside them is the one thing telling a reader which
# part of the program each of them belongs to. A locator reaches a binding and
# no further: the λ function of the first one fires on a dispatch standing
# inside 'mark', which no locator names, so the firing is written under
# 'Φ.foo.mark' — the binding the walk had entered.
symbolic: |
  - λ: L_number_plus
    dataize:
      𝛿1: $.ρ
      𝛿2: $.x
    𝑛: Φ.number( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
location: 'Q'
deep: true
input: >
  ⟦ bytes(φ) ↦ ⟦⟧,
    number(φ) ↦ ⟦ plus(ρ, x) ↦ ⟦ λ ⤍ L_number_plus ⟧ ⟧,
    foo ↦ ⟦ mark ↦ 5.plus( 6 ) ⟧,
    bar ↦ 7.plus( 8 ) ⟧
protocol: |
  𝕄(Φ):
    𝕄(Φ.foo):
      𝕄(Φ.foo.mark):
        𝑛·0·1 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ )
        𝑛·0·2 := Φ.number( φ ↦ 𝑛·0·1 )
        𝑛·0·3 := Φ.number( φ ↦ 𝑛·0·1 )
        𝑛·0·4 := Φ.bytes( φ ↦ 40-18-00-00-00-00-00-00:Δ )
        𝑛·0·5 := Φ.number( φ ↦ 𝑛·0·4 )
        𝑛·0·6 := Φ.number( φ ↦ 𝑛·0·1 )
        𝑛·0·7 := 𝑛·0·6.plus( x ↦ 𝑛·0·5 )
        𝔼(L_number_plus):
          𝔻(Φ.a🌵0):
            𝕄(Φ.a🌵0):
              𝑛·1·1 := Φ.number( φ ↦ 𝑛·0·1 )
              𝑛·1·2 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ )
            𝛿·1·1 := 40-14-00-00-00-00-00-00  # 5.0
          𝛿1·1 := 𝛿·1·1  # 𝔻(ξ.ρ)
          𝔻(Φ.a🌵1):
            𝕄(Φ.a🌵1):
              𝑛·1·3 := Φ.number( φ ↦ 𝑛·0·4 )
              𝑛·1·4 := Φ.bytes( φ ↦ 40-18-00-00-00-00-00-00:Δ )
            𝛿·1·2 := 40-18-00-00-00-00-00-00  # 6.0
          𝛿2·1 := 𝛿·1·2  # 𝔻(ξ.x)
          𝑛·1·5 := Φ.number( φ ↦ 𝜎1:λ )  # 𝑛
          𝕄(𝑛·1·5):
            𝑛·1·6 := Φ.number( φ ↦ 𝜎1:λ )
          𝑛·1·7 := 𝑛·1·6  # 𝕄(𝑛·1·5)
    𝕄(Φ.bar):
      𝑛·0·8 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ )
      𝑛·0·9 := Φ.number( φ ↦ 𝑛·0·8 )
      𝑛·0·10 := Φ.number( φ ↦ 𝑛·0·8 )
      𝑛·0·11 := Φ.bytes( φ ↦ 40-20-00-00-00-00-00-00:Δ )
      𝑛·0·12 := Φ.number( φ ↦ 𝑛·0·11 )
      𝑛·0·13 := Φ.number( φ ↦ 𝑛·0·8 )
      𝑛·0·14 := 𝑛·0·13.plus( x ↦ 𝑛·0·12 )
      𝔼(L_number_plus):
        𝔻(Φ.a🌵2):
          𝕄(Φ.a🌵2):
            𝑛·2·1 := Φ.number( φ ↦ 𝑛·0·8 )
            𝑛·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 := Φ.number( φ ↦ 𝑛·0·11 )
            𝑛·2·4 := Φ.bytes( φ ↦ 40-20-00-00-00-00-00-00:Δ )
          𝛿·2·2 := 40-20-00-00-00-00-00-00  # 8.0
        𝛿2·2 := 𝛿·2·2  # 𝔻(ξ.x)
        𝑛·2·5 := Φ.number( φ ↦ 𝜎2:λ )  # 𝑛
        𝕄(𝑛·2·5):
          𝑛·2·6 := Φ.number( φ ↦ 𝜎2:λ )
        𝑛·2·7 := 𝑛·2·6  # 𝕄(𝑛·2·5)