reduces-the-branches-of-a-fork-through-morphing.yaml

# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# A branch is where a 'morph' operand earns its place: the condition comes
# down through 𝔻 and answers a symbol nobody has decided, both branches reach
# a normal form through 𝕄, and the answer is one of them. Every line of the
# firing points back at the line that minted the symbol it carries, which is
# how the dependencies between firings are read.
symbolic: |
  - λ: L_number_gt
    dataize:
      𝛿1: $.ρ
      𝛿2: $.x
    𝑛: Φ.bool( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
  - λ: L_number_plus
    dataize:
      𝛿1: $.ρ
      𝛿2: $.x
    𝑛: Φ.number( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
  - λ: L_fork
    dataize:
      𝛿1: $.ρ
    morph:
      𝑛1: $.then
      𝑛2: $.else
    𝑛: 𝑛1
location: 'Q.@'
deep: true
input: >
  ⟦ bytes(φ) ↦ ⟦⟧,
    bool(φ) ↦ ⟦ if ↦ ⟦ ρ ↦ ∅, then ↦ ∅, else ↦ ∅, λ ⤍ L_fork ⟧ ⟧,
    number(φ) ↦ ⟦
      gt(ρ, x) ↦ ⟦ λ ⤍ L_number_gt ⟧,
      plus(ρ, x) ↦ ⟦ λ ⤍ L_number_plus ⟧ ⟧,
    @ ↦ 5.gt( 0 ).if( 1.plus( 2 ), 3.plus( 4 ) ) ⟧
protocol: |
  𝕄(Φ.φ):
    𝑛·0·1 := 5
    𝑛·0·2 := 𝑛·0·1.gt( x ↦ 0 )
    𝔼(L_number_gt):
      𝔻(Φ.a🌵0):
        𝕄(Φ.a🌵0):
          𝑛·1·1 := 5
          𝑛·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 := 0
          𝑛·1·4 := Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ )
        𝛿·1·2 := 00-00-00-00-00-00-00-00  # 0.0
      𝛿2·1 := 𝛿·1·2  # 𝔻(ξ.x)
      𝑛·1·5 := Φ.bool( φ ↦ 𝜎1:λ )  # 𝑛
      𝕄(𝑛·1·5):
        𝑛·1·6 := Φ.bool( φ ↦ 𝜎1:λ )
      𝑛·1·7 := 𝑛·1·6  # 𝕄(𝑛·1·5)
    𝑛·0·3 := 𝑛·1·6.if( then ↦ 1.plus( 2 ) )
    𝑛·0·4 := 𝑛·0·3( else ↦ 3.plus( 4 ) )
    𝕄(Φ.φ.then):
      𝑛·0·5 := Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ )
      𝑛·0·6 := Φ.number( φ ↦ 𝑛·0·5 )
      𝑛·0·7 := Φ.number( φ ↦ 𝑛·0·5 )
      𝑛·0·8 := Φ.bytes( φ ↦ 40-00-00-00-00-00-00-00:Δ )
      𝑛·0·9 := Φ.number( φ ↦ 𝑛·0·8 )
      𝑛·0·10 := Φ.number( φ ↦ 𝑛·0·5 )
      𝑛·0·11 := 𝑛·0·10.plus( x ↦ 𝑛·0·9 )
      𝔼(L_number_plus):
        𝔻(Φ.a🌵2):
          𝕄(Φ.a🌵2):
            𝑛·2·1 := Φ.number( φ ↦ 𝑛·0·5 )
            𝑛·2·2 := Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ )
          𝛿·2·1 := 3F-F0-00-00-00-00-00-00  # 1.0
        𝛿1·2 := 𝛿·2·1  # 𝔻(ξ.ρ)
        𝔻(Φ.a🌵3):
          𝕄(Φ.a🌵3):
            𝑛·2·3 := Φ.number( φ ↦ 𝑛·0·8 )
            𝑛·2·4 := Φ.bytes( φ ↦ 40-00-00-00-00-00-00-00:Δ )
          𝛿·2·2 := 40-00-00-00-00-00-00-00  # 2.0
        𝛿2·2 := 𝛿·2·2  # 𝔻(ξ.x)
        𝑛·2·5 := Φ.number( φ ↦ 𝜎2:λ )  # 𝑛
        𝕄(𝑛·2·5):
          𝑛·2·6 := Φ.number( φ ↦ 𝜎2:λ )
        𝑛·2·7 := 𝑛·2·6  # 𝕄(𝑛·2·5)
    𝕄(Φ.φ.else):
      𝑛·0·12 := Φ.bytes( φ ↦ 40-08-00-00-00-00-00-00:Δ )
      𝑛·0·13 := Φ.number( φ ↦ 𝑛·0·12 )
      𝑛·0·14 := Φ.number( φ ↦ 𝑛·0·12 )
      𝑛·0·15 := Φ.bytes( φ ↦ 40-10-00-00-00-00-00-00:Δ )
      𝑛·0·16 := Φ.number( φ ↦ 𝑛·0·15 )
      𝑛·0·17 := Φ.number( φ ↦ 𝑛·0·12 )
      𝑛·0·18 := 𝑛·0·17.plus( x ↦ 𝑛·0·16 )
      𝔼(L_number_plus):
        𝔻(Φ.a🌵4):
          𝕄(Φ.a🌵4):
            𝑛·3·1 := Φ.number( φ ↦ 𝑛·0·12 )
            𝑛·3·2 := Φ.bytes( φ ↦ 40-08-00-00-00-00-00-00:Δ )
          𝛿·3·1 := 40-08-00-00-00-00-00-00  # 3.0
        𝛿1·3 := 𝛿·3·1  # 𝔻(ξ.ρ)
        𝔻(Φ.a🌵5):
          𝕄(Φ.a🌵5):
            𝑛·3·3 := Φ.number( φ ↦ 𝑛·0·15 )
            𝑛·3·4 := Φ.bytes( φ ↦ 40-10-00-00-00-00-00-00:Δ )
          𝛿·3·2 := 40-10-00-00-00-00-00-00  # 4.0
        𝛿2·3 := 𝛿·3·2  # 𝔻(ξ.x)
        𝑛·3·5 := Φ.number( φ ↦ 𝜎3:λ )  # 𝑛
        𝕄(𝑛·3·5):
          𝑛·3·6 := Φ.number( φ ↦ 𝜎3:λ )
        𝑛·3·7 := 𝑛·3·6  # 𝕄(𝑛·3·5)
    𝔼(L_fork):
      𝔻(Φ.a🌵6):
        𝕄(Φ.a🌵6):
          𝑛·4·1 := Φ.bool( φ ↦ 𝜎1:λ )
      𝛿1·4 := 𝔻(𝜎1:λ)  # 𝔻(ξ.ρ)
      𝑛1·4 := 𝑛·2·7  # 𝕄(ξ.then)
      𝑛2·4 := 𝑛·3·7  # 𝕄(ξ.else)
      𝑛·4·2 := 𝑛1·4  # 𝑛
      𝑛·4·3 := 𝑛1·4  # 𝕄(𝑛·4·2)