phino-0.0.152: test-resources/evaluate-packs/morphs-a-program-that-already-carries-a-symbol.yaml
# SPDX-FileCopyrightText: Copyright (c) 2025 Objectionary.com
# SPDX-License-Identifier: MIT
---
# yamllint disable rule:line-length
# The program handed in is the answer an earlier run gave: its receiver is no
# number but the symbol 𝜎1 that run minted. The firing brings it down all the
# same, since a symbol dataizes to a fixed 42, and the protocol names the
# unknown that 42 stood for instead of writing the bytes twice.
symbolic: |
- λ: L_number_plus
dataize:
𝛿1: $.ρ
𝛿2: $.x
𝑛: Φ.number( φ ↦ ⟦ λ ⤍ 𝜎 ⟧ )
location: 'Q.@'
deep: true
input: >
⟦ bytes(φ) ↦ ⟦⟧,
number(φ) ↦ ⟦ plus(ρ, x) ↦ ⟦ λ ⤍ L_number_plus ⟧ ⟧,
@ ↦ Φ.number( φ ↦ ⟦ λ ⤍ 𝜎1 ⟧ ).plus( 7 ) ⟧
result: '⟦ φ ↦ 𝜎2:λ, plus(x) ↦ L_number_plus:λ ⟧'
protocol: |
𝕄(Φ.φ):
𝑛·0·1 := Φ.number( φ ↦ 𝜎1:λ )
𝑛·0·2 := 𝑛·0·1.plus( x ↦ 7 )
𝕄(Φ.φ.x):
𝑛·0·3 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ )
𝑛·0·4 := Φ.number( φ ↦ 𝑛·0·3 )
𝔼(L_number_plus):
𝔻(Φ.a🌵0):
𝕄(Φ.a🌵0):
𝑛·1·1 := Φ.number( φ ↦ 𝜎1:λ )
𝛿1·1 := 𝔻(𝜎1:λ) # 𝔻(ξ.ρ)
𝔻(Φ.a🌵1):
𝕄(Φ.a🌵1):
𝑛·1·2 := Φ.number( φ ↦ 𝑛·0·3 )
𝑛·1·3 := Φ.bytes( φ ↦ 40-1C-00-00-00-00-00-00:Δ )
𝛿·1·1 := 40-1C-00-00-00-00-00-00 # 7.0
𝛿2·1 := 𝛿·1·1 # 𝔻(ξ.x)
𝑛·1·4 := Φ.number( φ ↦ 𝜎2:λ ) # 𝑛
𝕄(𝑛·1·4):
𝑛·1·5 := Φ.number( φ ↦ 𝜎2:λ )
𝑛·1·6 := 𝑛·1·5 # 𝕄(𝑛·1·4)