phino-0.0.158: test-resources/evaluate-packs/morphs-two-branches-spelling-one-term-through-one-firing.yaml
# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# The memo of '--acyclic=plausible' serves the operands of a firing as much
# as the walk: the two branches of this fork spell one term, so the sum the
# second one starts from is the formation the first one fired, and the
# second branch reaches the normal form the first reached, symbol and all,
# through a firing that reduces nothing and answers what the first one did.
# The branches are met as 'morph' operands of the fork and not as bindings
# the deep walk went over first, since the fork is fired by the dispatch off
# it (#1476).
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.@'
acyclic: plausible
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 ).plus( 3 ), 1.plus( 2 ).plus( 3 ) ).plus( 9 ) ⟧
result: '⟦ x ↦ 9, λ ⤍ L_number_plus ⟧'
protocol: |
𝕄(Φ.φ):
𝑛·0·1 := 5.0
𝑛·0·2 := 𝑛·0·1.gt( x ↦ 0.0 )
𝔼(L_number_gt):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·1·1 := 5.0
morphed 𝑛·1·2 := 𝑛·1·1
boxed 𝑛·1·3 := 𝑛·1·2.φ
𝕄(𝑛·1·3):
𝑛·1·4 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ )
morphed 𝑛·1·5 := 𝑛·1·4
boxed 𝑛·1·6 := 𝑛·1·5.φ
𝛿·1·1 := 40-14-00-00-00-00-00-00 # 5.0
𝛿1·1 := 𝛿·1·1 # 𝔻(ξ.ρ)
𝔻(ξ.x):
𝕄(ξ.x):
𝑛·1·7 := 0.0
morphed 𝑛·1·8 := 𝑛·1·7
boxed 𝑛·1·9 := 𝑛·1·8.φ
𝕄(𝑛·1·9):
𝑛·1·10 := Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ )
morphed 𝑛·1·11 := 𝑛·1·10
boxed 𝑛·1·12 := 𝑛·1·11.φ
𝛿·1·2 := 00-00-00-00-00-00-00-00 # 0.0
𝛿2·1 := 𝛿·1·2 # 𝔻(ξ.x)
𝑛·1·13 := Φ.bool( φ ↦ 𝜎1:λ ) # 𝑛
𝕄(𝑛·1·13):
𝑛·1·14 := Φ.bool( φ ↦ 𝜎1:λ )
morphed 𝑛·1·15 := 𝑛·1·14
𝑛·1·16 := 𝑛·1·15 # 𝕄(𝑛·1·13)
𝑛·0·3 := 𝑛·1·14.if( then ↦ 1.0.plus( 2.0 ).plus( 3.0 ) )
𝑛·0·4 := 𝑛·0·3( else ↦ 1.0.plus( 2.0 ).plus( 3.0 ) )
𝔼(L_fork):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·2·1 := Φ.bool( φ ↦ 𝜎1:λ )
morphed 𝑛·2·2 := 𝑛·1·16
boxed 𝑛·2·3 := 𝑛·2·2.φ
𝛿·2·1 := 𝔻(𝜎1:λ)
𝛿1·2 := 𝛿·2·1 # 𝔻(ξ.ρ)
𝕄(ξ.then):
𝑛·2·4 := 1.0
𝑛·2·5 := 𝑛·2·4.plus( x ↦ 2.0 )
𝔼(L_number_plus):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·3·1 := 1.0
morphed 𝑛·3·2 := 𝑛·3·1
boxed 𝑛·3·3 := 𝑛·3·2.φ
𝕄(𝑛·3·3):
𝑛·3·4 := Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ )
morphed 𝑛·3·5 := 𝑛·3·4
boxed 𝑛·3·6 := 𝑛·3·5.φ
𝛿·3·1 := 3F-F0-00-00-00-00-00-00 # 1.0
𝛿1·3 := 𝛿·3·1 # 𝔻(ξ.ρ)
𝔻(ξ.x):
𝕄(ξ.x):
𝑛·3·7 := 2.0
morphed 𝑛·3·8 := 𝑛·3·7
boxed 𝑛·3·9 := 𝑛·3·8.φ
𝕄(𝑛·3·9):
𝑛·3·10 := Φ.bytes( φ ↦ 40-00-00-00-00-00-00-00:Δ )
morphed 𝑛·3·11 := 𝑛·3·10
boxed 𝑛·3·12 := 𝑛·3·11.φ
𝛿·3·2 := 40-00-00-00-00-00-00-00 # 2.0
𝛿2·3 := 𝛿·3·2 # 𝔻(ξ.x)
𝑛·3·13 := Φ.number( φ ↦ 𝜎2:λ ) # 𝑛
𝕄(𝑛·3·13):
𝑛·3·14 := Φ.number( φ ↦ 𝜎2:λ )
morphed 𝑛·3·15 := 𝑛·3·14
𝑛·3·16 := 𝑛·3·15 # 𝕄(𝑛·3·13)
𝑛·2·6 := 𝑛·3·14.plus( x ↦ 3.0 )
morphed 𝑛·2·7 := 𝑛·2·6
𝑛1·2 := 𝑛·2·6 # 𝕄(ξ.then)
𝕄(ξ.else):
𝑛·2·8 := Φ.number( φ ↦ 𝑛·3·4 )
𝑛·2·9 := 𝑛·2·8.plus( x ↦ 𝑛·3·7 )
𝔼(L_number_plus):
𝑛·4·1 := 𝑛·3·14 # 𝑛
𝑛·4·2 := 𝑛·3·16 # 𝕄(𝑛·4·1)
𝑛·2·10 := 𝑛·3·14.plus( x ↦ 3.0 )
morphed 𝑛·2·11 := 𝑛·2·10
𝑛2·2 := 𝑛·2·10 # 𝕄(ξ.else)
𝑛·2·12 := 𝑛·2·10 # 𝑛
𝕄(𝑛·2·12):
morphed 𝑛·2·13 := 𝑛·2·10
𝑛·2·14 := 𝑛·2·10 # 𝕄(𝑛·2·12)
𝔼(L_number_plus):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·5·1 := Φ.number( φ ↦ 𝜎2:λ )
morphed 𝑛·5·2 := 𝑛·4·2
boxed 𝑛·5·3 := 𝑛·5·2.φ
𝛿·5·1 := 𝔻(𝜎2:λ)
𝛿1·5 := 𝛿·5·1 # 𝔻(ξ.ρ)
𝔻(ξ.x):
𝕄(ξ.x):
𝑛·5·4 := 3.0
morphed 𝑛·5·5 := 𝑛·5·4
boxed 𝑛·5·6 := 𝑛·5·5.φ
𝕄(𝑛·5·6):
𝑛·5·7 := Φ.bytes( φ ↦ 40-08-00-00-00-00-00-00:Δ )
morphed 𝑛·5·8 := 𝑛·5·7
boxed 𝑛·5·9 := 𝑛·5·8.φ
𝛿·5·2 := 40-08-00-00-00-00-00-00 # 3.0
𝛿2·5 := 𝛿·5·2 # 𝔻(ξ.x)
𝑛·5·10 := Φ.number( φ ↦ 𝜎3:λ ) # 𝑛
𝕄(𝑛·5·10):
𝑛·5·11 := Φ.number( φ ↦ 𝜎3:λ )
morphed 𝑛·5·12 := 𝑛·5·11
𝑛·5·13 := 𝑛·5·12 # 𝕄(𝑛·5·10)
𝑛·0·5 := 𝑛·5·11.plus( x ↦ 9.0 )
morphed 𝑛·0·6 := 𝑛·0·5