Exercise 63.1.
The modal lookup and the one-component substitution give 𝑢::𝐴[𝑥:𝐴]∈ΔΔ;𝑧:𝐴⊢𝑧/𝑥:𝑥:𝐴Δ;𝑧:𝐴⊢𝖼𝗅𝗈(𝑢,𝑧/𝑥):𝐴Meta. Applying Ctx-I yields Δ;𝑦 :𝐴 ⊢𝖻𝗈𝗑(𝑧 :𝐴.𝖼𝗅𝗈(𝑢,𝑧/𝑥)) :[𝑧 :𝐴 ⊢𝐴]. For the altered body, Ctx-I asks for Δ;𝑧 :𝐴 ⊢𝑦 :𝐴. Variable lookup fails because its ordinary context contains only 𝑧 :𝐴; the ambient declaration 𝑦 :𝐴 is not a premise of the rule.
Exercise 63.2.
Substitution first reaches the neutral head and produces a canonical lambda: [𝜆(𝑧:𝐴).𝑧/𝑓]𝐴−→𝐴−𝑓=𝜆(𝑧:𝐴).𝑧. The application clause would therefore create (𝜆(𝑧 :𝐴). 𝑧) 𝑦. It does not return that noncanonical redex; it immediately continues with the lambda body at the domain approximation: [𝜆(𝑧:𝐴).𝑧/𝑓]𝐴−→𝐴−(𝑓𝑦)=[𝑦/𝑧]𝐴−𝑧=𝑦. The term body need not be smaller than the original application, but the outer index has decreased strictly from 𝐴− →𝐴− to its proper subexpression 𝐴−.
Exercise 63.3.
The normal component 𝑀/𝑥 forbids erasing 𝑥’s approximation, while the atomic component 𝑅//𝑦 permits either retaining or erasing 𝑦’s. The complete list is therefore (𝑥:𝐴−,𝑦:𝐵−)and(𝑥:𝐴−,𝑦:). There are no other choices. Erasing 𝑥’s type would lose the termination index needed if substituting its normal component creates a redex. The atomic component for 𝑦 cannot create a head redex, so keeping 𝐵− is safe but not required.
Exercise 63.4.
At the simply typed layer, let 𝐼 =𝜆(𝑥 :𝐴). 𝑥 and take 𝗅𝖾𝗍𝖻𝗈𝗑(𝖻𝗈𝗑(⋅.𝐼),𝑢.𝖼𝗅𝗈(𝑢,⋅)). It has type 𝐴 →𝐴 and its box redex contracts to 𝐼. If the 𝗅𝖾𝗍𝖻𝗈𝗑 occurs in function position, a commuting conversion must first expose that principal redex.
At the canonical layer, assume a closed constant 𝑐 :𝐴 and a meta-variable 𝑢::(∏𝑣::𝐴[⋅]𝐴)[⋅]. The atomic term 𝗆𝖺𝗉𝗉(𝖼𝗅𝗈(𝑢, ⋅), ̂⋅.𝑐) synthesizes (A). Hereditarily substitute ̂⋅.𝗆𝗅𝖺𝗆(𝑣.𝖼𝗅𝗈(𝑣, ⋅)) for (u). Substitution into the atomic head returns a meta-abstraction, so the contextual-application clause creates a meta-level beta-redex. It immediately substitutes ̂⋅.𝑐 for (v) in 𝖼𝗅𝗈(𝑣, ⋅), returning (c) at the strictly smaller domain approximation. Thus the first calculus normalizes an independently defined reduction relation, while the second contracts a newly created redex inside its typing computation. The examples do not transfer strong normalization between the calculi.
Practical route.
The Beluga scope experiment of exercise 63.5 is developed in appendix F. Its portable Kappa run, pinned Beluga source locator, and unavailable-toolchain boundary are recorded in appendix E.