The Setting
An observation of a normalized plain type follows a finite sequence of typed applications. Values supplied at its active domains are the arguments of an observation table with values in a fixed base set.
Fix a pure type specification , with arbitrary axiom and product-rule relations, and a family . Terms are variables, sort constants, applications , annotated abstractions , and dependent products .✦ Write for typing by the axiom, variable, weakening, product, abstraction, application, and conversion rules of . Conversion uses the equivalence relation generated by full reduction, including reduction in annotations and binder bodies.✦ Substitution is capture-avoiding instantiation of the bound variable✦; simultaneous substitution and variable renaming act under binders by their lifts.
A valid context is obtained from the empty context by adjoining when for some sort .✦ A legal term in occurs as either the subject or the expected type of a typing judgement.✦ Assume is weakly normalizing: every legal term in every valid context reaches a normal form.✦ A normal term has no one-step reduct✦, and denotes a chosen normal form when weak normalization supplies one.✦
Let be a saturated context tower, with a valid context of length at each stage and , where for some . Contexts are newest-first. Tower terms use fixed levels for free variables; at stage , a level is read as the de Bruijn index , while indices are unchanged, and renaming is lifted under binders. Displayed binders use named notation. Tower typing means that some stage types both expressions after this translation.✦ A saturated context tower is a context tower in which every type sortable at a stage, expressed with fixed free levels, is declared again at arbitrarily late stages.
The normal form sort profiles, axiom successors, and product-rule outputs are (1) A feasible profile from (1) is a nonempty set of sorts obtained from a normal term in a valid context . A feasible product profile triple consists of feasible profiles with .✦
Signed Profiles and Observation Layers
The primary graph has profiles as vertices. Its positive edges are strict inclusions with feasible endpoints and , and codomain edges for feasible product profile triples . Its negative edges are the domain edges of those triples. Write for a finite path consisting of positive primary edges, including the empty path.✦
The observation layers associated with form the set (2)✦ The secondary graph on (2) retains a positive primary edge when both endpoints belong to . It has a negative edge for a feasible product profile triple when all three profiles belong to .
A signed walk is a finite directed walk whose sign is the parity of its number of negative edges; the empty walk is positive.✦ Directed reachability allows either parity.✦ A strongly connected component is the set of vertices mutually reachable with a fixed vertex in the set.✦
A direct layer is an for which a feasible product profile triple has .✦ An active layer is an observation layer that reaches a direct layer in the secondary graph.✦ A plain layer is an observation layer with both a positive walk and a negative walk in the secondary graph to direct layers, whose endpoints may differ.✦
A forbidden configuration is a strongly connected component of the secondary graph, all of whose vertices are plain, containing a negative edge and admitting a feasible product profile triple and a sort with (3)✦ Write for the existence of such a component satisfying (3).
Plain Types and Observation Tables
A normalized plain type is a normal term sortable in whose profile is plain.✦ Let be the collection of these types. An application key at is a decomposition together with a normal argument such that and is active.✦ The target node of an application key is ; when is active, the domain node of that key is .
A plain observation schema on a set assigns to each a set of keys, a target for each key, and an optional domain , where means no domain.✦ The actual schema has node set , the application keys just defined, and (4)✦
For a schema , a finite continuation path from is either the empty path or , where and starts at .✦ Write for these paths. A payload occurrence at on is a frame of whose designated domain is ; its set is , with occurrences at different frames kept distinct.✦ The recursive domain dependency is the least relation satisfying (5)✦ Here and in (5).
Let be a schema on and a family of sets indexed by . A frame parameter is an assignment of a value in to the designated domain of one frame.✦ A path parameter for and is an assignment of a value in to each payload occurrence at on a continuation path.✦ Their spaces, and the observation tables with base , are (6) Empty-path parameters in (6) are the empty assignment.✦ Parameter extension combines a first-frame assignment with a tail assignment✦; head and tail restriction recover these two assignments.
Let have well-founded recursive domain dependency . For a base set and a node , the recursive plain space is a set of observation tables defined by recursion along , with table equation and unfolding equivalence (7) The equivalence in (7) is induced by the displayed equality of spaces.✦
The Claim
Theorem 1 (Plain spaces). Assume no forbidden configuration occurs. For the actual schema , the recursive domain dependency satisfies (8)✦ For any base set and , define the actual plain observation space by (9)✦ The prefix decomposition for a well-founded schema specializes to the equivalence (10)✦ For any schema with well-founded recursive domain dependency, any set , and any , its distinguished value at a node is (11)✦
In the paper, the result reads: under the graph exclusion, the plain spaces admit prefix decomposition and distinguished values with base the constant whose next values are distinguished values.
What Is Checked
The actual spaces (9) and prefix maps (10) concern normalized plain types in a saturated tower of a weakly normalizing pure type system, with the graph exclusion as the hypothesis of (8). The distinguished values (11) are stated for any well-founded schema and any chosen base value.
For every schema, a payload occurrence at on a continuation path from gives the recursive domain dependency .✦