The Setting
An odd retained data path pairs a data term with a test to produce a formula. A double channel uses two odd paths and four successive carrier extensions to transport a predicate with a query tag.
Fix a pure type specification with arbitrary axiom and product-rule relations. Terms have variables, sort constants, applications, annotated abstractions , and dependent products .β¦ Labelled terms give each application and binder a label , , or , recording data to data, data to proof, or proof to proof.β¦ Write and for these two modes. Contexts are newest-first lists; named bound variables below stand for de Bruijn indices, with zero referring to the nearest binder.
For a labelled context , the typing judgment uses the axiom, variable, weakening, product, abstraction, application, and conversion rules, with matching labels in function types and their applications.β¦ Full labelled reduction contracts a labelled abstraction applied with the same label and permits reduction in every annotation and binder body.β¦ Convertibility is its equivalence closure.β¦ Erasure deletes the labels and gives the corresponding unlabelled terms.β¦ A data-only term has label at every application and binder.β¦
A mode environment assigns a mode to each variable. Its extension by assigns to the newest variable and retains the older assignments.β¦ The mode discipline assigns variables their environment modes and sorts data mode. An application uses its labelβs argument and result modes. An abstraction has a data-mode annotation and a body in the result mode, checked after extension by the argument mode. A product has data mode when its domain and codomain have data mode under the corresponding binder extension. The nondependent labelled arrow is defined in (1). (1)β¦
A normal term admits no full step.β¦ A weakly normalizing term is a term that has a finite reduction to a normal term; write for a chosen such normal form. For an unlabelled context , the normal form sort profile and the axiom and output profiles are the sets in (2). (2) A valid context is obtained from the empty context by adjoining types that have a sort.β¦ A feasible profile is a nonempty set of sorts of the form for a normal term in a valid context .β¦ A feasible product triple consists of feasible profiles with .β¦ For labelled terms, sorting at , written , means for every ; further sorts are allowed.β¦ For unlabelled terms, is the typing judgment of the pure type system , with the axiom, variable, weakening, product, abstraction, application, and conversion rules.β¦
The primary signed graph has a positive inclusion edge from a feasible profile to a feasible profile whenever . Each feasible product triple gives a negative edge and a positive edge . A positive path is a finite, possibly empty, path using only positive edges.β¦ For a collection of profiles, an observation layer is a profile reachable positively from a nonempty with .β¦ For a collection of profiles, a direct observation layer is an observation layer for that admits a feasible triple with .β¦ A logical terminal profile is the middle profile of a feasible triple with .β¦
Logical and Data Paths
A feasible witness family chooses a type and a value at every feasible profile . The type is data-only, has normal erasure, and is sorted at in ; , and both terms have data mode under .
A proof wrapper is a finite sequence of positive and negative extensions of the identity wrapper.β¦ The identity wrapper acts on a formula as ; if a wrapper acts as , a positive extension with annotation acts as , and a negative extension with annotation acts as .β¦ A formed proof path starts with the identity at its source profile and permits restriction of its target profile to a subset. A positive extension uses a feasible triple and annotation to pass from to . A negative extension uses and annotation , requires , and reverses parity. Parity counts negative extensions modulo two. The negative-step test records whether at least one negative extension occurs.β¦
A typed open proof transformer from a formula to a formula is a proof-mode term of type in the context extended by a temporary proof input of type ; the ambient variables in are shifted under that input.β¦ A logical setup chooses and uniform typed open proof transformers between the witness types at any two logical terminal profiles. It also chooses a feasible triple with , together with even proof paths and . For every direct observation layer , a quantifier route chooses a feasible triple and even proof paths from to and from to .β¦ The logical falsity of the logical setup is the witness type .β¦ The logical code of consists of this falsity and its two fixed wrappers; its operations are defined in (3).β¦ Logical implication wraps the proof-to-proof arrow from to with .β¦ Logical negation is implication from to the logical falsity .β¦ Logical conjunction negates the implication from to the negation of .β¦ Negating the conjunction of the negations of and gives logical disjunction .β¦ The polarity-selected proposition is when is true and its logical negation when is false.β¦ (3)
An all-positive data path retains a domain annotation and its original dummy value at each extension. Its formation starts at the identity, permits target restriction, and uses a feasible triple to extend from to with .β¦ A formed data tail ending at chooses a sort with and nonempty , an all-positive data path from to , and even proof paths from to and back. Its returning proof path must contain a negative step.
A retained data path starts at the identity and admits positive extensions with fixed annotations and dummy values, or negative extensions with fixed data tails.β¦ Its parity counts its negative extensions. Formation allows target restriction and positive extensions along feasible triples using . A negative extension from to uses a feasible triple and a formed tail ending at . A double channel is a pair of odd retained paths.β¦ A double channel is formed from through to when is formed from to and is formed from to .β¦
Write for the type wrapped along a retained path . The identity gives ; a positive extension with annotation gives , and a negative extension with tail gives , where is the tailβs carrier.β¦ Write and for these two extensions. The builder returns at the identity and forms a constant data abstraction at a positive extension. At a negative extension it abstracts over , observes its bound input against , and sends the resulting formula through the tail. A callbackβs distinguished input remains free during this construction.
The observation is defined by (4), where is the tailβs reading operation and is capture-avoiding instantiation of its distinguished input. (4)β¦ For an odd path , its observation callback is the open formula in a context extended by .β¦
Renaming acts on every retained annotation and dummy value, on both paths of a double channel, and on the logical code, preserving their path shapes and parities. Substitution replaces variables capture-avoidantly, fixing the newest variable under a binder and shifting the older images.β¦ The open composition of open terms and with a common ambient context is the open term obtained by substituting for the distinguished input of while preserving that ambient context.β¦
Tags and Payloads
For the double channel , let denote its carrier operation. Its iterated carrier and fourfold carrier are defined in (5). (5) A query index has the four-bit word , with the least significant bit first.β¦ A query tag has nonzero index .β¦ The tagged embedding iterates the signed embeddings, the maps from a carrier to the next carrier selected by the bits of , using at each step the carrier tower corresponding to the remaining suffix.β¦ Its open form substitutes the distinguished variable for .β¦ For a nonempty finite sign word, the iterated signed embedding first embeds along the remaining suffix and then uses the first sign to select the signed embedding at the carrier depth equal to the suffix length.
For any finite sign word , the tag predicate is an open formula with logical truth at the empty word. For a nonempty word it conjoins the bit predicate, which tests the sign at the current carrier depth, with the polarity selected by the first sign and the recovered tag predicate of the remaining suffix, both at the carrier depth equal to the suffix length; uses the four-bit word of . The recovery operation lifts an open formula through one application of the carrier operation. The iterated recovery predicate starts at the open formula and applies this operation successively over .β¦
Fix an odd retained path . For tags , a type , a term of the wrapped type , a payload of type , and a channel input , the encoding predicate , tagged encoder , mark , and decoder are the constructions in (6). The decoderβs open predicate composes the first pathβs observation callback with the zero-tagged variable embedding.β¦ (6)
Write when a proof-mode term satisfies .β¦ Typed logical equivalence is the existence of uniform typed open proof transformers from to and from to , in the context with mode environment .β¦
The Claim
Theorem 1. Fix the logical setup , a formed double channel with input profile , and a formed odd retained path starting at . Let have data mode and be sorted at in , and let have data mode with . For a data-mode term with and tags , the mark has the polarity in (7). (7)β¦ If for a sort , then every data-mode term with satisfies (8). (8)β¦
What Is Checked
The statements range over labelled typing and its mode discipline, a logical setup with fixed feasible witnesses, and formed retained paths, with equivalence measured by typed open proof transformers.