phino-0.0.165: test-resources/evaluate-packs/answers-its-own-sides-on-a-condition-another-join-read.yaml
# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# Two joins on one condition answer each its own sides (#1940). The memo of
# 'plausible' keeps the answer of a firing by the λ name and the operands it
# came down to, and a join reads its sides as well as its condition, so the
# second join, on the condition the first one read, reduces its own sides and
# answers 70 instead of the 7 of the first join.
symbolic: |
- λ: L_number_gt
dataize:
𝛿1: $.ρ
𝛿2: $.x
𝑛: Φ.bool( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
- λ: L_pick
dataize:
𝛿1: $.x
morph:
𝑛1: $.y
evaluate:
𝑛2: 𝑛1
𝑛: 𝑛2
- λ: L_fork
dataize:
𝛿1: $.ρ
join:
on: 𝛿1
left: $.then
right: $.else
location: 'Q.@'
acyclic: plausible
input: >
⟦ bytes(φ) ↦ ⟦⟧,
bool(φ) ↦ ⟦ if ↦ ⟦ ρ ↦ ∅, then ↦ ∅, else ↦ ∅, λ ⤍ L_fork ⟧ ⟧,
number(φ) ↦ ⟦ gt(ρ, x) ↦ ⟦ λ ⤍ L_number_gt ⟧ ⟧,
pick(x, y) ↦ ⟦ λ ⤍ L_pick ⟧,
φ ↦ Φ.pick( 5.gt( 0 ).if( 7, 7 ), 5.gt( 0 ).if( 70, 70 ) ).φ ⟧
result: '⟦ φ ↦ ⟦ Δ ⤍ 40-51-80-00-00-00-00-00 ⟧ ⟧'
protocol: |
𝕄(Φ.φ):
remembered 𝑛·0·1 ≡ Φ.pick # ⟦ x ↦ ∅, y ↦ ∅, λ ⤍ L_pick ⟧
𝑛·0·2 := Φ.pick( x ↦ 5.0.gt( 0.0 ).if( 7.0, 7.0 ) )
𝑛·0·3 := ⟦ x ↦ 5.0.gt( 0.0 ).if( 7.0, 7.0 ), y ↦ ∅, λ ⤍ L_pick ⟧
remembered 𝑛·0·3 ≡ 𝑛·0·1( x ↦ 5.0.gt( 0.0 ).if( 7.0, 7.0 ) )
𝑛·0·4 := 𝑛·0·2( y ↦ 5.0.gt( 0.0 ).if( 70.0, 70.0 ) )
𝑛·0·5 := ⟦ x ↦ 5.0.gt( 0.0 ).if( 7.0, 7.0 ), y ↦ 5.0.gt( 0.0 ).if( 70.0, 70.0 ), λ ⤍ L_pick ⟧
remembered 𝑛·0·5 ≡ 𝑛·0·3( y ↦ 5.0.gt( 0.0 ).if( 70.0, 70.0 ) )
𝔼(L_pick):
𝔻(ξ.x):
𝕄(ξ.x):
normalized 𝑛·1·1 := ⟦ φ ↦ ∅, gt(x) ↦ L_number_gt:λ ⟧ # Φ.number
𝑛·1·2 := 5.0
𝑛·1·3 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
normalized 𝑛·1·4 := ⟦ x ↦ ∅, λ ⤍ L_number_gt ⟧ # 𝑛·1·3.gt
𝑛·1·5 := 𝑛·1·2.gt( x ↦ 0.0 )
𝑛·1·6 := ⟦ x ↦ 0.0, λ ⤍ L_number_gt ⟧
𝔼(L_number_gt):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·2·1 := 5.0
𝑛·2·2 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
morphed 𝑛·2·3 := 𝑛·2·2
boxed 𝑛·2·4 := 𝑛·2·3.φ
normalized 𝑛·2·5 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ) # 𝑛·2·4
𝕄(𝑛·2·4):
normalized 𝑛·2·6 := ∅:φ # Φ.bytes
𝑛·2·7 := Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ )
𝑛·2·8 := 40-14-00-00-00-00-00-00:Δ:φ
morphed 𝑛·2·9 := 𝑛·2·8
boxed 𝑛·2·10 := 𝑛·2·9.φ
normalized 𝑛·2·11 := 40-14-00-00-00-00-00-00:Δ # 𝑛·2·10
𝛿·2·1 := 40-14-00-00-00-00-00-00 # 5.0
𝛿1·2 := 𝛿·2·1 # 𝔻(ξ.ρ)
𝔻(ξ.x):
𝕄(ξ.x):
𝑛·2·12 := 0.0
𝑛·2·13 := ⟦ φ ↦ Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
morphed 𝑛·2·14 := 𝑛·2·13
boxed 𝑛·2·15 := 𝑛·2·14.φ
normalized 𝑛·2·16 := Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ ) # 𝑛·2·15
𝕄(𝑛·2·15):
𝑛·2·17 := Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ )
𝑛·2·18 := 00-00-00-00-00-00-00-00:Δ:φ
morphed 𝑛·2·19 := 𝑛·2·18
boxed 𝑛·2·20 := 𝑛·2·19.φ
normalized 𝑛·2·21 := 00-00-00-00-00-00-00-00:Δ # 𝑛·2·20
𝛿·2·2 := 00-00-00-00-00-00-00-00 # 0.0
𝛿2·2 := 𝛿·2·2 # 𝔻(ξ.x)
𝑛·2·22 := Φ.bool( φ ↦ 𝜎1:λ ) # 𝑛
𝕄(𝑛·2·22):
normalized 𝑛·2·23 := ⟦ φ ↦ ∅, if(then, else) ↦ L_fork:λ ⟧ # Φ.bool
𝑛·2·24 := Φ.bool( φ ↦ 𝜎1:λ )
𝑛·2·25 := ⟦ φ ↦ 𝜎1:λ, if(then, else) ↦ L_fork:λ ⟧
morphed 𝑛·2·26 := 𝑛·2·25
𝑛·2·27 := 𝑛·2·26 # 𝕄(𝑛·2·22)
memoized 𝑛·1·6 ⇛ 𝑛·2·27
normalized 𝑛·1·7 := ⟦ then ↦ ∅, else ↦ ∅, λ ⤍ L_fork ⟧ # 𝑛·2·27.if
𝑛·1·8 := 𝑛·2·24.if( then ↦ 7.0 )
𝑛·1·9 := ⟦ then ↦ 7.0, else ↦ ∅, λ ⤍ L_fork ⟧
𝑛·1·10 := 𝑛·1·8( else ↦ 7.0 )
𝑛·1·11 := ⟦ then ↦ 7.0, else ↦ 7.0, λ ⤍ L_fork ⟧
morphed 𝑛·1·12 := 𝑛·1·11
𝔼(L_fork):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·3·1 := Φ.bool( φ ↦ 𝜎1:λ )
𝑛·3·2 := ⟦ φ ↦ 𝜎1:λ, if(then, else) ↦ L_fork:λ ⟧
morphed 𝑛·3·3 := 𝑛·2·27
boxed 𝑛·3·4 := 𝑛·3·3.φ
normalized 𝑛·3·5 := 𝜎1:λ # 𝑛·3·4
𝛿·3·1 := 𝔻(𝜎1:λ)
𝛿1·3 := 𝛿·3·1 # 𝔻(ξ.ρ)
𝕄(ξ.then):
𝑛·3·6 := 7.0
𝑛·3·7 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
morphed 𝑛·3·8 := 𝑛·3·7
𝕄(ξ.else):
𝑛·3·9 := 7.0
𝑛·3·10 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
morphed 𝑛·3·11 := 𝑛·3·10
𝑛·3·12 := 𝑛·3·11
memoized 𝑛·1·11 ⇛ 𝑛·3·12
boxed 𝑛·1·13 := 𝑛·3·12.φ
normalized 𝑛·1·14 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ ) # 𝑛·1·13
𝕄(𝑛·1·13):
𝑛·1·15 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ )
𝑛·1·16 := 40-1C-00-00-00-00-00-00:Δ:φ
morphed 𝑛·1·17 := 𝑛·1·16
boxed 𝑛·1·18 := 𝑛·1·17.φ
normalized 𝑛·1·19 := 40-1C-00-00-00-00-00-00:Δ # 𝑛·1·18
𝛿·1·1 := 40-1C-00-00-00-00-00-00 # 7.0
𝛿1·1 := 𝛿·1·1 # 𝔻(ξ.x)
𝕄(ξ.y):
𝑛·1·20 := Φ.number( φ ↦ 𝑛·2·7 )
𝑛·1·21 := ⟦ φ ↦ 𝑛·2·7, gt(x) ↦ L_number_gt:λ ⟧
normalized 𝑛·1·22 := ⟦ x ↦ ∅, λ ⤍ L_number_gt ⟧ # 𝑛·1·21.gt
𝑛·1·23 := 𝑛·1·20.gt( x ↦ 𝑛·2·12 )
𝑛·1·24 := ⟦ x ↦ 𝑛·2·12, λ ⤍ L_number_gt ⟧
𝔼(L_number_gt):
recalled 𝑛·1·6 ⇒ 𝑛·2·27
𝑛·4·1 := 𝑛·3·1 # 𝑛
𝑛·4·2 := 𝑛·2·27 # 𝕄(𝑛·4·1)
normalized 𝑛·1·25 := ⟦ then ↦ ∅, else ↦ ∅, λ ⤍ L_fork ⟧ # 𝑛·4·2.if
𝑛·1·26 := 𝑛·3·1.if( then ↦ 70.0 )
𝑛·1·27 := ⟦ then ↦ 70.0, else ↦ ∅, λ ⤍ L_fork ⟧
𝑛·1·28 := 𝑛·1·26( else ↦ 70.0 )
𝑛·1·29 := ⟦ then ↦ 70.0, else ↦ 70.0, λ ⤍ L_fork ⟧
morphed 𝑛·1·30 := 𝑛·1·29
𝑛1·1 := 𝑛·1·29 # 𝕄(ξ.y)
𝔼(L_fork): # 𝔼(𝑛1)
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·5·1 := Φ.bool( φ ↦ 𝜎1:λ )
𝑛·5·2 := ⟦ φ ↦ 𝜎1:λ, if(then, else) ↦ L_fork:λ ⟧
morphed 𝑛·5·3 := 𝑛·4·2
boxed 𝑛·5·4 := 𝑛·5·3.φ
𝛿·5·1 := 𝔻(𝜎1:λ)
𝛿1·5 := 𝛿·5·1 # 𝔻(ξ.ρ)
𝕄(ξ.then):
𝑛·5·5 := 70.0
𝑛·5·6 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-51-80-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
morphed 𝑛·5·7 := 𝑛·5·6
𝕄(ξ.else):
𝑛·5·8 := 70.0
𝑛·5·9 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-51-80-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ ⟧
morphed 𝑛·5·10 := 𝑛·5·9
𝑛·5·11 := 𝑛·5·10
memoized 𝑛·1·29 ⇛ 𝑛·5·11
𝑛2·1 := 𝑛·5·11 # 𝔼(𝑛1)
𝑛·1·31 := 𝑛·5·11 # 𝑛
𝕄(𝑛·1·31):
morphed 𝑛·1·32 := 𝑛·5·11
𝑛·1·33 := 𝑛·1·32 # 𝕄(𝑛·1·31)
remembered 𝑛·1·33 ≡ 𝑛·0·5
memoized 𝑛·0·5 ⇛ 𝑛·1·33
normalized 𝑛·0·6 := Φ.bytes( φ ↦ 40-51-80-00-00-00-00-00:Δ ) # 𝑛·1·33.φ
𝑛·0·7 := Φ.bytes( φ ↦ 40-51-80-00-00-00-00-00:Δ )
𝑛·0·8 := 40-51-80-00-00-00-00-00:Δ:φ
morphed 𝑛·0·9 := 𝑛·0·8