OctoInformBeta

OpenAI preprint, September 2026 · §5. Observation spaces and substitution-stable candidates

Lemma 32: Values at convertible expectations and candidate readouts at arbitrary literal expected sorts

Normal evaluation forgets its typing tree choices.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

A normal annotated term can have typing trees with different formation sorts or conversion steps. Evaluating such a tree involves both the expected type and the observation parameters supplied for its free variables. The term being evaluated is normal before those variables are replaced by actual terms.

Fix a pure type specification P=(S,𝒜,ℛ)P=(S,\mathcal A,\mathcal R), where SS is the set of sorts and 𝒜\mathcal A and ℛ\mathcal R are arbitrary axiom and product-rule relations.✦ Terms are variables, sorts, applications MNM\,N, annotated abstractions λx:A.M\lambda x:A.M, and dependent products Πx:A.B\Pi x:A.B.✦ Named variables are source notation; terms use de Bruijn indices, with index zero bound by the nearest binder, and contexts are newest-first lists. Variable renaming acts recursively under binders, where its lift fixes zero and shifts the renamed free indices.✦ Simultaneous substitution M[σ]M[\sigma] is capture-avoiding. Its lift fixes the bound variable and shifts the images of free variables✦; bound variable instantiation B[a/x]B[a/x] uses the single-variable substitution sending zero to aa and each successor to its predecessor.

Full one-step reduction →β\to_\beta contains head contraction (λx:A.b)a→βb[a/x](\lambda x:A.b)\,a\to_\beta b[a/x] and reduction in every application component, annotation and binder body. A normal term is a term admitting no full one-step beta reduction, and M≃βNM\simeq_\beta N denotes the equivalence relation generated by reduction.✦ Weak normalization means that some finite reduction reaches a normal term✦; its chosen normal form is M#M^\#. Strong normalization means that no infinite full reduction begins at the term.✦ Argument list reduction changes exactly one component by one beta step✦; a strongly normalizing argument list admits no infinite sequence of these changes.✦ Write Ma→M\,\vec a for left-associated iterated application.

Typing Γ⊢M:A\Gamma\vdash M:A uses the axiom relation, variable introduction and weakening, product formation with a triple in ℛ\mathcal R, abstraction and application. Conversion changes the expected type to a sorted beta-convertible type. A valid context is obtained from the empty context by adjoining a declaration x:Ax:A with Γ⊢A:s\Gamma\vdash A:s for some sort ss.✦ Declaration lookup gives a variable’s type in the full context, shifting its free indices across each newer declaration.✦ A legal term occurs as a subject or an expected type in a typing judgment.✦ Assume system weak normalization: in every valid context, both subjects and expected types of typing judgments are weakly normalizing.✦

A saturated context tower Ω\Omega is a nested sequence of valid contexts of length nn at stage nn, each extended by a sorted declaration. Every expression with a sort in a finite prefix, written with fixed free levels, is declared again beyond every prescribed stage. Tower typing Ω⊢M:A\Omega\vdash M:A means that some finite prefix types both the subject and the expected type after changing free levels to indices.✦ At length nn this reversal sends a level i<ni<n to n−1−in-1-i and fixes indices outside that range; bound variables retain their de Bruijn indices.✦

Profiles and Observation Layers

The normal form sort profile πΓ(T)\pi_\Gamma(T) is the set of all sorts typing T#T^\#.✦ The tower profile uses tower typing in place of typing in Γ\Gamma.✦ For a sort ss and profiles II and JJ, the axiom successor profile Ax⁡(s)\operatorname{Ax}(s) and product output profile Out⁡(I,J)\operatorname{Out}(I,J) are given with these profiles in (1). πΓ(T)={s∈S∣Γ⊢T#:s},πΩ(T)={s∈S∣Ω⊢T#:s},Ax⁡(s)={t∈S∣(s,t)∈𝒜},Out⁡(I,J)={c∈S∣∃a∈I∃b∈J(a,b,c)∈ℛ}.\begin{aligned} \pi_\Gamma(T)&=\{s\in S\mid\Gamma\vdash T^\#:s\},& \pi_\Omega(T)&=\{s\in S\mid\Omega\vdash T^\#:s\},\\ \operatorname{Ax}(s)&=\{t\in S\mid(s,t)\in\mathcal A\},& \operatorname{Out}(I,J)&= \{c\in S\mid\exists a\in I\ \exists b\in J\ (a,b,c)\in\mathcal R\}. \end{aligned}(1) A feasible profile is a nonempty πΓ(T)\pi_\Gamma(T) realized by a normal term TT in a valid context.✦ A feasible product profile triple (I,J,K)(I,J,K) consists of feasible profiles satisfying K=Out⁡(I,J)K=\operatorname{Out}(I,J).✦

The primary signed graph has feasible profiles as vertices. Its inclusion edges I→JI\to J, for J⊊IJ\subsetneq I, are positive. A feasible product profile triple (I,J,K)(I,J,K) gives a negative domain edge I→KI\to K and a positive codomain edge J→KJ\to K. A signed directed walk is a finite walk whose parity counts its negative edges, with the empty walk positive.✦ Directed reachability allows either parity✦; positive reachability uses only positive edges.✦ A strongly connected component is the set of vertices mutually reachable with one of its vertices.✦

Fix a family CC of profiles. An observation layer II is a feasible profile positively reachable in the primary graph from a nonempty Ax⁡(s)\operatorname{Ax}(s) with {s}∈C\{s\}\in C.✦ The secondary signed graph has observation layers as vertices. Its positive edges are the positive primary edges between these layers. Its negative edges I→KI\to K come from feasible triples (I,J,K)(I,J,K) all of whose profiles are observation layers. A direct observation layer is an observation layer II with a feasible triple (I,J,K)(I,J,K) for some J,K∈CJ,K\in C.✦

An active layer II is an observation layer with a directed walk in the secondary graph to a direct layer.✦ A plain layer II is an observation layer with directed walks in the secondary graph of both parities to direct layers, possibly with different endpoints. A free layer of sign ε\varepsilon is a nonplain profile with a walk of parity ε\varepsilon to a direct layer.✦ A forbidden configuration is a strongly connected component DD of the secondary graph consisting entirely of plain layers and containing a negative edge, together with a feasible triple (I,J,K)(I,J,K) and a sort ss such that J,K,{s}∈DJ,K,\{s\}\in D and the nonempty Ax⁡(s)\operatorname{Ax}(s) has positive primary reachability to II.✦ Assume that PP and CC admit no forbidden configuration.

Candidates and Observation Spaces

The top candidate Top⁡T\operatorname{Top}_T consists of the strongly normalizing terms with tower type TT.✦ Tested argument stacks at TT include the empty stack. A stack a::a→a::\vec a is tested at Πx:D.E\Pi x:D.E when a∈Top⁡Da\in\operatorname{Top}_D and a→\vec a is tested at (E[a/x])#(E[a/x])^\#. The ground candidate GTG_T at TT is the set of terms with tower type TT whose application to every tested argument stack at TT is strongly normalizing. A normalization candidate AA at TT is a set satisfying the bounds in (2) and head expansion closure. Top⁡T={M∣Ω⊢M:T and M is strongly normalizing},GT={M∣Ω⊢M:T and Ma→ is strongly normalizing for every tested stack a→},GT⊆A⊆Top⁡T.\begin{aligned} \operatorname{Top}_T &=\{M\mid\Omega\vdash M:T\text{ and }M\text{ is strongly normalizing}\},\\ G_T &=\{M\mid\Omega\vdash M:T\text{ and }M\,\vec a \text{ is strongly normalizing for every tested stack }\vec a\},\\ G_T&\subseteq A\subseteq\operatorname{Top}_T. \end{aligned}(2) Head expansion closure means that a typed term (λx:D.b)aa→(\lambda x:D.b)\,a\,\vec a belongs to AA whenever its head contractum b[a/x]a→b[a/x]\,\vec a belongs to AA, the terms D,b,aD,b,a are strongly normalizing, and a→\vec a is a strongly normalizing argument list.✦

An actual type TT is a term that is either normal and has some tower sort, or is a literal sort. A candidate assignment bb is a function on actual types whose value b(T)b(T) at each actual type TT is a normalization candidate at TT.✦ Write ℬ\mathcal B for the space of these assignments. The top assignment gives Top⁡T\operatorname{Top}_T at every coordinate.✦ A coordinate update b[T↦A]b[T\mapsto A] replaces that candidate and retains the other coordinates.✦

A plain observation schema FF on nodes NN is a family of key sets indexed by NN, with a target and an optional domain for each key.✦ A finite continuation path in a plain observation schema FF is a finite sequence of keys following successive targets.✦ A payload occurrence on a finite continuation path is a choice of a present domain dd at one of its keys.✦ For a family KK of spaces indexed by domain nodes, path parameters are families assigning an element of K(d)K(d) to every payload occurrence with domain dd on the path; single-frame parameters are such families for a path consisting of one key. Empty path parameters are unique. Prepending a frame combines its parameters with the remaining path parameters, and restriction to the first frame and the tail recovers the two parts. A plain observation table at a node nn of a plain observation schema FF is a function assigning a value in a fixed base space to every path from nn with its path parameters.✦

The recursive domain dependency relation d≺nd\prec n on the nodes of a plain observation schema FF holds when dd occurs as a domain after finitely many continuations from nn.✦ For well-founded dependency and base BB, the recursive plain observation space 𝒮F(n)\mathcal S_F(n) has the recursive table form (3); here 𝒫F(K,p)\mathcal P_F(K,p) denotes the path parameters just defined. Plain space unfolding identifies an observation with this table. 𝒮F(n)≅∏p a path from n(𝒫F(𝒮F,p)→B).\mathcal S_F(n)\cong \prod_{p\text{ a path from }n} \bigl(\mathcal P_F(\mathcal S_F,p)\to B\bigr).(3) The distinguished element of the recursive plain observation space 𝒮F(n)\mathcal S_F(n) at b∈Bb\in B is the observation with constant table value bb. The plain prefix decomposition separates the empty observation from each first-frame continuation: 𝒮F(n)≅B×∏a a key at n(single frame parameters at a→𝒮F(target⁡(a))).\mathcal S_F(n)\cong B\times \prod_{a\text{ a key at }n} \bigl(\text{single frame parameters at }a \to\mathcal S_F(\operatorname{target}(a))\bigr).(4)✦ The coordinates in (4) use parameter extension to prefix a frame and parameter restriction to split a nonempty path.

A normalized plain type TT is a normal tower-sorted term with plain profile.✦ A plain application key at a normalized plain type TT is a choice of a decomposition T=Πx:D.ET=\Pi x:D.E and a normal argument aa with Ω⊢a:D\Omega\vdash a:D, whose instantiated target has active profile. Its plain target node is (E[a/x])#(E[a/x])^\#✦; an active domain gives its plain domain node.✦ The actual plain schema is the plain observation schema whose nodes are normalized plain types and whose keys are plain application keys, with a domain present exactly when its profile is active.✦ Its recursive spaces are the actual plain observation spaces.✦ Their unfolding and actual plain prefix decomposition are (3) and (4) for this schema.

For key space QQ, plain payload space VV and opposite space YY, a free observation frame is a key with an optional payload, either absent, plain in VV, or opposite in YY.✦ A continuation stack is a finite list of free observation frames, and an exit stack is a finite list of free observation frames followed by one terminal frame. For a base space BB and an exit result space OO, a free table is a pair of functions assigning a result in BB to each continuation stack and a result in OO to each exit stack.✦ Denote its space by 𝒯(Y)\mathscr T(Y), keeping Q,V,B,OQ,V,B,O fixed.

Payload mapping along f:X→Yf:X\to Y changes only opposite payloads.✦ Frame mapping retains keys; continuation and exit stack mapping apply this to their frames. Table reindexing along ff precomposes both table components with these stack maps.✦ The observation table slice at a frame prefixes that frame to the continuing part of either kind of stack.✦ A constant observation table is a free table that returns a fixed base value on all continuation stacks and a fixed exit value on all exit stacks.✦

The finite observation stages and signed free spaces are defined by (5). Successor maps start at the empty stage and at each later stage reindex tables twice along the preceding successor map✦; stage inclusions iterate these maps.✦ The negative space is their direct limit, with finite-stage embeddings, and the positive space is a table space over the negative space.✦ $$X_0=\varnothing,\qquad X_{n+1}=\mathscr T(\mathscr T(X_n)),\qquad \mathcal M=\varinjlim_n X_n,\qquad \mathcal L=\mathscr T(\mathcal M).$$(5) Finite-stage restriction reindexes a positive table along a stage embedding. Finite-stage behavior is empty at zero and, at a successor stage, reindexes along the preceding restriction.✦ Represented negative behavior is the map from ℳ\mathcal M to tables over ℒ\mathcal L induced by finite-stage behavior.✦ A negative observation slice is a negative element representing a slice of this behavior.✦ The default positive observation is a constant table✦; the default negative observation embeds the corresponding stage-one constant table.✦

Values and Environments

For the actual observations, keys are terms, bases are candidate assignments ℬ\mathcal B, plain payloads are tagged actual plain observations over ℬ\mathcal B, and exits are optional tagged plain observations. A tagged plain observation consists of its normalized plain type and an element of that type’s actual plain space.✦ Actual positive and negative observations are the spaces ℒ\mathcal L and ℳ\mathcal M in (5) with these choices. A raw observation value is a tagged plain observation, an actual positive observation, or an actual negative observation, distinguished by its tag.✦

For an actual type TT and a raw observation value vv, observation tag compatibility Fits⁡(T,v)\operatorname{Fits}(T,v) requires a plain tag to have exactly type TT, a positive tag to have positive free profile at TT, and a negative tag to have negative free profile there.✦ For a term TT, a typed observation value vv at TT is a raw observation value satisfying Fits⁡(T,v)\operatorname{Fits}(T,v).✦ Plain value injection attaches its plain type tag✦; plain value extraction recovers the observation at that type.✦ Positive and negative value extraction recover the corresponding signed observation. Plain observation tagging returns the normalized plain type together with its extracted observation.✦

The base assignment base⁡(v)\operatorname{base}(v) of a raw value is its empty observation: for a plain value it is the first plain prefix coordinate, for a positive value its empty continuing result, and for a negative value that result in its represented behavior.✦ The default actual plain observation has constant top assignment.✦ At a normalized active type, meaning a normal sorted type with active profile, the distinguished observation value is its canonical typed observation value. A prescribed base observation replaces its empty observation by a given assignment, retaining all its nonempty default observations.✦ Typed value projection retains a raw value when its tag fits, and otherwise returns the distinguished value.✦ A checked exit value projects a present plain exit and uses the distinguished value for an absent exit.✦

Optional payload compatibility PayloadFits⁡(D,p)\operatorname{PayloadFits}(D,p) for a term DD and an optional raw observation value pp is the condition in (6). Active payload extraction returns its typed value when the domain is active.✦ PayloadFits⁡(D,p)⇔{πΩ(D) is inactive,p=none,Fits⁡(D,v),p=some(v).\operatorname{PayloadFits}(D,p)\quad\Longleftrightarrow\quad \begin{cases} \pi_\Omega(D)\text{ is inactive},&p=\mathrm{none},\\ \operatorname{Fits}(D,v),&p=\mathrm{some}(v). \end{cases}(6)✦ A typed observation environment ee from Γ\Gamma to Ω\Omega is a raw image substitution σ\sigma and an optional parameter assignment pip_i satisfying (7). The first condition is tower-typed substitution; declaration lookup views AA in the full source context. Γ[i]:A⇒Ω⊢σ(i):A[σ]andPayloadFits⁡((A[σ])#,pi).\Gamma[i]:A\quad\Longrightarrow\quad \Omega\vdash\sigma(i):A[\sigma] \quad\text{and}\quad \operatorname{PayloadFits}\bigl((A[\sigma])^\#,p_i\bigr).(7)✦ Environment extension by aa with tower type A[σ]A[\sigma] and a matching payload sends the new zero index to raw aa and its payload, and successors to the old images and parameters.✦ For Γ⊢M:T\Gamma\vdash M:T, the substituted actual type is (T[σ])#(T[\sigma])^\#.✦ For Γ⊢M:s\Gamma\vdash M:s, the substituted actual expression is (M[σ])#(M[\sigma])^\#.✦ When its profile is active, a substituted actual type is also a normalized active type. A normalized active type with plain profile gives its corresponding plain node.✦

An active application key at a normalized active type TT is a choice of a decomposition T=Πx:D.ET=\Pi x:D.E and a normal argument aa with Ω⊢a:D\Omega\vdash a:D, with active instantiated target.✦ Its active target type is (E[a/x])#(E[a/x])^\#.✦ At a plain source this is also a plain application key.✦ Plain payload decoding produces the tagged plain domain observation when the domain is active, and absence otherwise✦; plain payload encoding assigns the corresponding single-frame parameters. A positive frame has an absent, plain, or negative payload✦; a negative frame has an absent, plain, or positive payload.✦ Their payload decoding attaches the corresponding raw tags, and their payload encoding retains the matching tags of compatible optional raw values.

A free application gate at TT, argument qq, payload pp and exit flag requires an active key with argument qq and a compatible domain payload. Its target is plain exactly when the flag specifies an exit. A gated application key is an active application key satisfying a free application gate.✦ A lambda observation action is a function assigning a typed value at the active target to each active key and each compatible optional payload.✦

Plain observation application takes the relevant continuation coordinate of the plain prefix decomposition.✦ A plain lambda prefix has the lambda action as its continuation coordinates, using the encoded payloads and the instantiated body as target.✦ Positive and negative lambda continuations apply the action at a continuing gate and extract its signed result; when that gate fails they give the corresponding default. The lambda exit operation returns the action’s tagged plain observation at an exit gate, and absence otherwise.✦

A raw lambda table has its specified base on the empty stack. On a nonempty continuation stack it uses the represented negative behavior of the body action at the first frame; its exits use the exit action at a lone terminal frame and that body behavior after a continuing frame. Negative lambda behavior is this raw table with top assignment, negative lambda continuation and the decoded lambda exit operation.✦ Negative behavior packing chooses a negative observation with the given behavior when one exists, and the default negative observation otherwise.✦ A positive lambda table has the analogous empty base and positive continuations, with decoded lambda exits.✦ The lambda observation value uses the plain prefix or the signed lambda construction at its type.✦ Observation value application uses the next plain coordinate, a free continuation slice, or a checked plain exit, according to its source and target.✦

Structural Evaluation

A stored typing tree tt for Γ⊢M:T\Gamma\vdash M:T is a finite tree retaining the judgment’s generation choices. A variable node retains its declaration and conversion to TT; a sort node retains a chosen axiom successor and conversion. A product node retains domain and body trees at chosen sorts and the product rule. An abstraction retains its annotation and body trees, a sorted product type and conversion to that product; an application retains function and argument trees and conversion to the instantiated target.

Structural preevaluation evaluates a stored typing tree tt for Γ⊢M:T\Gamma\vdash M:T in a typed observation environment ee.✦ Its preliminary result has an active value Val⁡(t,e)\operatorname{Val}(t,e) at (T[σ])#(T[\sigma])^\# whenever that expected type has active profile, and a candidate readout Read⁡(t,e)\operatorname{Read}(t,e) at (M[σ])#(M[\sigma])^\#.✦ The readout is a set of terms, distinct from the observation value. Its optional evaluation parameter is the optional raw value in (8). Par⁡(t,e)={some(underlying raw value of Val⁡(t,e)),πΩ((T[σ])#) is active,none,otherwise.\operatorname{Par}(t,e)= \begin{cases} \mathrm{some}\bigl(\text{underlying raw value of }\operatorname{Val}(t,e)\bigr), &\pi_\Omega((T[\sigma])^\#)\text{ is active},\\ \mathrm{none},&\text{otherwise}. \end{cases}(8)

A product instance is a collection consisting of a domain DD, a body EE, a source context and an environment, with formation judgments at chosen sorts a,b,ca,b,c satisfying (a,b,c)∈ℛ(a,b,c)\in\mathcal R.✦ The substituted domain of a product instance is D[σ]D[\sigma], and its substituted body is E[σ↑]E[\sigma^\uparrow], where σ↑\sigma^\uparrow denotes the lifted substitution that fixes the bound variable. Denote their normal forms by D0D_0 and E0E_0. Its raw instantiated target at nn substitutes raw nn for zero and σ(i)\sigma(i) for each successor i+1i+1 in EE✦; write TnT_n for that target’s normal form. The instance extends its environment by nn and a compatible payload.✦ Payload-indexed body candidates for a product instance are families assigning a candidate at TnT_n to every tower-typed n:D0n:D_0 and every compatible payload, including all choices of that payload.✦

Given a domain candidate dd, the product tester set AA is dd when πΩ(D0)∈C\pi_\Omega(D_0)\in C, and Top⁡D0\operatorname{Top}_{D_0} otherwise. For a typed argument nn, the product candidate fibers ℱ(n)\mathcal F(n) are all its payload-indexed body candidates when πΩ(Tn)∈C\pi_\Omega(T_n)\in C, and the singleton {Top⁡Tn}\{\operatorname{Top}_{T_n}\} otherwise. The fiber family is empty for an argument without type D0D_0.✦ The indexed product test defining the product test candidate is (9). Prod⁡(D0,E0;A,ℱ)={f∈Top⁡Πx:D0.E0∣∀n∈A∀U∈ℱ(n)fn∈U}.\operatorname{Prod}(D_0,E_0;A,\mathcal F)= \{f\in\operatorname{Top}_{\Pi x:D_0.E_0}\mid \forall n\in A\ \forall U\in\mathcal F(n)\quad f\,n\in U\}.(9) The evaluated product candidate uses the domain read and the body reads in every matching extended environment in (9).✦ Product evaluation takes this candidate as its readout and updates the exact product coordinate in its observation base.✦ The stored product formation judgments give its product instance; instances from a product formation or a function with product type choose the corresponding formation sorts. A normalized argument frame uses n#n^\# as its key.✦ The application frame environment extends the instance environment by the key’s argument and matching payload.✦

The base candidate readout of a typing judgment and its active observation value uses that value’s base assignment at (M[σ])#(M[\sigma])^\# precisely when πΩ((M[σ])#)∈C\pi_\Omega((M[\sigma])^\#)\in C, the expected type is literally a sort ss with {s}∈C\{s\}\in C, and the substituted expected type has active profile.✦ Otherwise it is Top⁡(M[σ])#\operatorname{Top}_{(M[\sigma])^\#}. A base evaluation result consists of the active values and this readout.✦ Sort evaluation uses the distinguished active value and the top readout.✦ Variable evaluation takes its active value from the corresponding environment parameter.✦ Abstraction evaluation is a base result with the lambda observation value supplied by its abstraction observation action.✦ That action uses the body evaluations on the domain extension, together with the product typing and conversion to the expected type.✦ Application evaluation is a base result using the function and argument evaluations, their product and domain typings, and conversion to the instantiated target.✦ For an application Γ⊢fn:T\Gamma\vdash f\,n:T with Γ⊢f:Πx:D.E\Gamma\vdash f:\Pi x:D.E, Γ⊢n:D\Gamma\vdash n:D and T≃βE[n/x]T\simeq_\beta E[n/x], the application observation value in ee is a typed observation value at (T[σ])#(T[\sigma])^\# whenever this type has active profile.

The Claim

Theorem 1. Let MM be beta normal, let tt and t′t' be stored typing trees for Γ⊢M:T\Gamma\vdash M:T and Γ⊢M:U\Gamma\vdash M:U, and let ee be one typed observation environment from Γ\Gamma to Ω\Omega. The parameter equality in (10) assumes T≃βUT\simeq_\beta U. The readout equality assumes that T=sT=s and U=s′U=s' are literal sorts, for arbitrary s,s′∈Ss,s'\in S. Par⁡(t,e)=Par⁡(t′,e),Read⁡(t,e)=Read⁡(t′,e).\begin{aligned} \operatorname{Par}(t,e)&=\operatorname{Par}(t',e),\\ \operatorname{Read}(t,e)&=\operatorname{Read}(t',e). \end{aligned}(10)✦

What Is Checked

The claim is stated over full beta-normal annotated terms, stored typing trees and raw typed observation environments in a saturated context tower, under system weak normalization and exclusion of forbidden configurations. Every stored tree recovers its typing judgment.✦ A function’s dependent product type has some sort, supplying the product formation used by its instance.✦

For the actual plain schema these dependencies are well-founded under the stated assumptions, including dependencies after any finite continuation.✦ Decoded plain payloads satisfy domain compatibility.✦ At a normalized plain type, every typed value is a plain value injection✦. An active application key from a free source retains its sign whenever its target is nonplain.✦

The finite free observation stages and inclusions form a directed system.✦ Slicing a represented negative behavior is again representable by a negative observation.✦ Product instance normalization preserves the dependent product structure.✦ A tester typed at the normalized domain remains typed at the raw substituted domain.✦ The normalized body after substitution by an application frame environment is exactly the active target type.✦ The product test construction gives a normalization candidate for its domain and payload-indexed body candidates.✦