answers-a-whole-family-of-names-with-one-entry.yaml

# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# The key of an entry is a regular expression over λ names, so one entry
# stands for the whole family of them a box numbers its functions with.
symbolic: |
  - λ: L_number_(plus|times)
    dataize:
      𝛿1: $.ρ
      𝛿2: $.x
    𝑛: Φ.number( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
location: 'Q.@'
input: >
  ⟦ bytes(φ) ↦ ⟦⟧,
    number(φ) ↦ ⟦
      plus(ρ, x) ↦ ⟦ λ ⤍ L_number_plus ⟧,
      times(ρ, x) ↦ ⟦ λ ⤍ L_number_times ⟧ ⟧,
    φ ↦ 5.plus( 6 ).times( 7 ).φ ⟧
result: '𝜎2:λ'
protocol: |
  𝕄(Φ.φ):
    𝑛·0·1 := 5.0
    𝑛·0·2 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ), plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
    𝑛·0·3 := 𝑛·0·1.plus( x ↦ 6.0 )
    𝑛·0·4 := ⟦ x ↦ 6.0, λ ⤍ L_number_plus ⟧
    𝔼(L_number_plus):
      𝔻(ξ.ρ):
        𝕄(ξ.ρ):
          𝑛·1·1 := 5.0
          𝑛·1·2 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ), plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
          morphed 𝑛·1·3 := 𝑛·1·2
        boxed 𝑛·1·4 := 𝑛·1·3.φ
        𝕄(𝑛·1·4):
          𝑛·1·5 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ )
          𝑛·1·6 := 40-14-00-00-00-00-00-00:Δ:φ
          morphed 𝑛·1·7 := 𝑛·1·6
        boxed 𝑛·1·8 := 𝑛·1·7.φ
        𝛿·1·1 := 40-14-00-00-00-00-00-00  # 5.0
      𝛿1·1 := 𝛿·1·1  # 𝔻(ξ.ρ)
      𝔻(ξ.x):
        𝕄(ξ.x):
          𝑛·1·9 := 6.0
          𝑛·1·10 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-18-00-00-00-00-00-00:Δ ), plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
          morphed 𝑛·1·11 := 𝑛·1·10
        boxed 𝑛·1·12 := 𝑛·1·11.φ
        𝕄(𝑛·1·12):
          𝑛·1·13 := Φ.bytes( φ ↦ 40-18-00-00-00-00-00-00:Δ )
          𝑛·1·14 := 40-18-00-00-00-00-00-00:Δ:φ
          morphed 𝑛·1·15 := 𝑛·1·14
        boxed 𝑛·1·16 := 𝑛·1·15.φ
        𝛿·1·2 := 40-18-00-00-00-00-00-00  # 6.0
      𝛿2·1 := 𝛿·1·2  # 𝔻(ξ.x)
      𝑛·1·17 := Φ.number( φ ↦ 𝜎1:λ )  # 𝑛
      𝕄(𝑛·1·17):
        𝑛·1·18 := Φ.number( φ ↦ 𝜎1:λ )
        𝑛·1·19 := ⟦ φ ↦ 𝜎1:λ, plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
        morphed 𝑛·1·20 := 𝑛·1·19
      𝑛·1·21 := 𝑛·1·20  # 𝕄(𝑛·1·17)
    𝑛·0·5 := 𝑛·1·18.times( x ↦ 7.0 )
    𝑛·0·6 := ⟦ x ↦ 7.0, λ ⤍ L_number_times ⟧
    𝔼(L_number_times):
      𝔻(ξ.ρ):
        𝕄(ξ.ρ):
          𝑛·2·1 := Φ.number( φ ↦ 𝜎1:λ )
          𝑛·2·2 := ⟦ φ ↦ 𝜎1:λ, plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
          morphed 𝑛·2·3 := 𝑛·1·21
        boxed 𝑛·2·4 := 𝑛·2·3.φ
        𝛿·2·1 := 𝔻(𝜎1:λ)
      𝛿1·2 := 𝛿·2·1  # 𝔻(ξ.ρ)
      𝔻(ξ.x):
        𝕄(ξ.x):
          𝑛·2·5 := 7.0
          𝑛·2·6 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ ), plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
          morphed 𝑛·2·7 := 𝑛·2·6
        boxed 𝑛·2·8 := 𝑛·2·7.φ
        𝕄(𝑛·2·8):
          𝑛·2·9 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ )
          𝑛·2·10 := 40-1C-00-00-00-00-00-00:Δ:φ
          morphed 𝑛·2·11 := 𝑛·2·10
        boxed 𝑛·2·12 := 𝑛·2·11.φ
        𝛿·2·2 := 40-1C-00-00-00-00-00-00  # 7.0
      𝛿2·2 := 𝛿·2·2  # 𝔻(ξ.x)
      𝑛·2·13 := Φ.number( φ ↦ 𝜎2:λ )  # 𝑛
      𝕄(𝑛·2·13):
        𝑛·2·14 := Φ.number( φ ↦ 𝜎2:λ )
        𝑛·2·15 := ⟦ φ ↦ 𝜎2:λ, plus(x) ↦ L_number_plus:λ, times(x) ↦ L_number_times:λ ⟧
        morphed 𝑛·2·16 := 𝑛·2·15
      𝑛·2·17 := 𝑛·2·16  # 𝕄(𝑛·2·13)
    morphed 𝑛·0·7 := 𝜎2:λ