phino-0.0.159: test-resources/evaluate-packs/takes-the-one-term-both-sides-of-a-join-come-to.yaml
# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# A join whose two sides come to the same normal form through 𝕄 has
# nothing to join (#1954): it mints no symbol and answers that one term,
# commented with both sides it came from.
symbolic: |
- λ: L_number_gt
dataize:
𝛿1: $.ρ
𝛿2: $.x
𝑛: Φ.bool( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
- λ: L_number_plus
dataize:
𝛿1: $.ρ
𝛿2: $.x
𝑛: Φ.number( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
- λ: L_fork
dataize:
𝛿1: $.ρ
join:
on: 𝛿1
left: $.then
right: $.else
location: 'Q.@'
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 ), 1.plus( 2 ) ).φ ⟧
result: '𝜎2:λ'
protocol: |
𝕄(Φ.φ):
𝑛·0·1 := 5.0
𝑛·0·2 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
𝑛·0·3 := 𝑛·0·1.gt( x ↦ 0.0 )
𝑛·0·4 := ⟦ x ↦ 0.0, λ ⤍ L_number_gt ⟧
𝔼(L_number_gt):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·1·1 := 5.0
𝑛·1·2 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-14-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
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 := 0.0
𝑛·1·10 := ⟦ φ ↦ Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
morphed 𝑛·1·11 := 𝑛·1·10
boxed 𝑛·1·12 := 𝑛·1·11.φ
𝕄(𝑛·1·12):
𝑛·1·13 := Φ.bytes( φ ↦ 00-00-00-00-00-00-00-00:Δ )
𝑛·1·14 := 00-00-00-00-00-00-00-00:Δ:φ
morphed 𝑛·1·15 := 𝑛·1·14
boxed 𝑛·1·16 := 𝑛·1·15.φ
𝛿·1·2 := 00-00-00-00-00-00-00-00 # 0.0
𝛿2·1 := 𝛿·1·2 # 𝔻(ξ.x)
𝑛·1·17 := Φ.bool( φ ↦ 𝜎1:λ ) # 𝑛
𝕄(𝑛·1·17):
𝑛·1·18 := Φ.bool( φ ↦ 𝜎1:λ )
𝑛·1·19 := ⟦ φ ↦ 𝜎1:λ, if(then, else) ↦ L_fork:λ ⟧
morphed 𝑛·1·20 := 𝑛·1·19
𝑛·1·21 := 𝑛·1·20 # 𝕄(𝑛·1·17)
𝑛·0·5 := 𝑛·1·18.if( then ↦ 1.0.plus( 2.0 ) )
𝑛·0·6 := ⟦ then ↦ 1.0.plus( 2.0 ), else ↦ ∅, λ ⤍ L_fork ⟧
𝑛·0·7 := 𝑛·0·5( else ↦ 1.0.plus( 2.0 ) )
𝑛·0·8 := ⟦ then ↦ 1.0.plus( 2.0 ), else ↦ 1.0.plus( 2.0 ), λ ⤍ L_fork ⟧
𝔼(L_fork):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·2·1 := Φ.bool( φ ↦ 𝜎1:λ )
𝑛·2·2 := ⟦ φ ↦ 𝜎1:λ, if(then, else) ↦ L_fork:λ ⟧
morphed 𝑛·2·3 := 𝑛·1·21
boxed 𝑛·2·4 := 𝑛·2·3.φ
𝛿·2·1 := 𝔻(𝜎1:λ)
𝛿1·2 := 𝛿·2·1 # 𝔻(ξ.ρ)
𝕄(ξ.then):
𝑛·2·5 := 1.0
𝑛·2·6 := ⟦ φ ↦ Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
𝑛·2·7 := 𝑛·2·5.plus( x ↦ 2.0 )
𝑛·2·8 := ⟦ x ↦ 2.0, λ ⤍ L_number_plus ⟧
morphed 𝑛·2·9 := 𝑛·2·8
𝕄(ξ.else):
𝑛·2·10 := 1.0
𝑛·2·11 := ⟦ φ ↦ Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
𝑛·2·12 := 𝑛·2·10.plus( x ↦ 2.0 )
𝑛·2·13 := ⟦ x ↦ 2.0, λ ⤍ L_number_plus ⟧
morphed 𝑛·2·14 := 𝑛·2·13
𝑛·2·15 := 𝑛·2·13 # 𝕄(ξ.then), 𝕄(ξ.else)
𝔼(L_number_plus):
𝔻(ξ.ρ):
𝕄(ξ.ρ):
𝑛·3·1 := 1.0
𝑛·3·2 := ⟦ φ ↦ Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
morphed 𝑛·3·3 := 𝑛·3·2
boxed 𝑛·3·4 := 𝑛·3·3.φ
𝕄(𝑛·3·4):
𝑛·3·5 := Φ.bytes( φ ↦ 3F-F0-00-00-00-00-00-00:Δ )
𝑛·3·6 := 3F-F0-00-00-00-00-00-00:Δ:φ
morphed 𝑛·3·7 := 𝑛·3·6
boxed 𝑛·3·8 := 𝑛·3·7.φ
𝛿·3·1 := 3F-F0-00-00-00-00-00-00 # 1.0
𝛿1·3 := 𝛿·3·1 # 𝔻(ξ.ρ)
𝔻(ξ.x):
𝕄(ξ.x):
𝑛·3·9 := 2.0
𝑛·3·10 := ⟦ φ ↦ Φ.bytes( φ ↦ 40-00-00-00-00-00-00-00:Δ ), gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
morphed 𝑛·3·11 := 𝑛·3·10
boxed 𝑛·3·12 := 𝑛·3·11.φ
𝕄(𝑛·3·12):
𝑛·3·13 := Φ.bytes( φ ↦ 40-00-00-00-00-00-00-00:Δ )
𝑛·3·14 := 40-00-00-00-00-00-00-00:Δ:φ
morphed 𝑛·3·15 := 𝑛·3·14
boxed 𝑛·3·16 := 𝑛·3·15.φ
𝛿·3·2 := 40-00-00-00-00-00-00-00 # 2.0
𝛿2·3 := 𝛿·3·2 # 𝔻(ξ.x)
𝑛·3·17 := Φ.number( φ ↦ 𝜎2:λ ) # 𝑛
𝕄(𝑛·3·17):
𝑛·3·18 := Φ.number( φ ↦ 𝜎2:λ )
𝑛·3·19 := ⟦ φ ↦ 𝜎2:λ, gt(x) ↦ L_number_gt:λ, plus(x) ↦ L_number_plus:λ ⟧
morphed 𝑛·3·20 := 𝑛·3·19
𝑛·3·21 := 𝑛·3·20 # 𝕄(𝑛·3·17)
morphed 𝑛·0·9 := 𝜎2:λ