The apply row up to ā with occurrence identity #
Annotated results are compared up to ā, equality up to rows annotated
š: rows annotated š and occurrences annotated š are
dropped, and what is left is equal up to a one-to-one renaming of the
occurrences, which keeps which aggregate values share which occurrences.
GeneratesAnnZ reads an aggregate value only through its value; this
module compares aggregate values through their occurrences, using the
identities the evaluator stamps on them (AggValue.oids,
AggExpr.oids).
GenRow.zeqRenis that comparison. An ordinary token and an aggregate expression are compared by what they compute and by their occurrences annotated otherwise thanšwith their identities, renamed by one injective map for the whole result. A nested value is compared the same way at every storey of what its occurrences read, with its occurrences annotatedšdropped at every storey; its own occurrences carry no identity, and its family, renamed by a second injective map, says which nested values share them. What it does not record is which occurrence of one nested value is which occurrence of another of the same family.GeneratesAnnRenis the generation predicate up to it.apply_mem_of_generatesAnnRenis the apply row: over Boolean functions of two variables, a set generating up to it holds the apply.annEpsOps_isBasis_in_class_renis the annotated basis theorem up to it, overAnnBasisClass: the nine classes generate, no proper subset of them does, and no set of classes does without the apply.
An ordinary token with its occurrences annotated š dropped, together
with their identities, and its family forgotten.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
The identities of a token's occurrences renamed.
Equations
Instances For
Dependency graph
A family identifier with its family renamed by Ļ: the column and
the terms applied since are kept, so two identifiers of one family stay of
one family.
Equations
Instances For
Dependency graph
An aggregate expression read up to ā: its occurrences annotated š
dropped together with their identities, the others' identities renamed by
Ļ, and its family by Ļ.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
What an occurrence of a nested value reads, up to ā: at every storey
the occurrences annotated š dropped, the identities of the expressions'
occurrences renamed by Ļ, and the families renamed by Ļ.
Equations
- One or more equations did not get rendered due to their size.
- NestInner.zeqNorm Ļ Ļ 0 e = AggExpr.zeqNorm Ļ (FamId.renameFamily Ļ) e
- NestInner.zeqNorm Ļ Ļ j.succ (Sum.inl x_2) = Sum.inl (NestInner.zeqNorm Ļ Ļ j x_2)
Instances For
Dependency graph
A nested value read up to ā: its occurrences annotated š dropped,
what the others read normalized at every storey, and its family renamed.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
A column value read up to ā, its occurrence identities renamed by Ļ
and its families by Ļ. An ordinary token and an expression are read by
their occurrences annotated otherwise than š, their identities saying
which occurrences they share with other values, and their families
forgotten. A nested value is read the same way at every storey of what its
occurrences read; its own occurrences carry no identity, and which ones two
nested values share is said by their families, which are renamed rather
than forgotten.
Equations
- GenValue.zeqNorm Ļ Ļ (Sum.inl v) = Sum.inl v
- GenValue.zeqNorm Ļ Ļ (Sum.inr (AggTok.tok a)) = Sum.inr (AggTok.tok (AggValue.renameOids Ļ a.zeroOccs))
- GenValue.zeqNorm Ļ Ļ (Sum.inr (AggTok.expr e)) = Sum.inr (AggTok.expr (AggExpr.zeqNorm Ļ (fun (x : FamId T) => FamId.none) e))
- GenValue.zeqNorm Ļ Ļ (Sum.inr (AggTok.nest a)) = Sum.inr (AggTok.nest (NestedValue.zeqNorm Ļ Ļ a))
Instances For
Dependency graph
A result read up to ā: its rows annotated otherwise than š, each
column read by GenValue.zeqNorm Ļ Ļ, with its annotation.
Equations
- GenRow.zeqNorm Ļ Ļ R = Multiset.map (fun (r : GenRow T K n) => (fun (k : Fin n) => GenValue.zeqNorm Ļ Ļ (r.1 k), r.2.finalize)) (Multiset.filter (fun (r : GenRow T K n) => r.2.finalize ā 0) R)
Instances For
Dependency graph
Two results equivalent up to ā: equal once the rows
and occurrences annotated š are dropped, up to a one-to-one renaming of
the occurrences and one of the families.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
A set of classes generates the annotated algebra up to ā with
occurrence identity: GeneratesAnnZ with GenRow.zeqRen in place of
GenRow.zeroNorm.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
Hitting the occurrences annotated y #
The bound behind the row: in a query with no apply, every ordinary token
holding an occurrence annotated y holds one whose identity lies in a set
Z whose size depends on the query and not on the instance.
Z hits the token's occurrences annotated y: if it holds one, it
holds one whose identity is in Z.
Equations
Instances For
Dependency graph
The same of a column value: every ordinary token it holds is hit.
Equations
- GenValue.TokHit y Z v = ā (a : AggValue T K), v = Sum.inr (AggTok.tok a) ā AggValue.HitBy y Z a
Instances For
Dependency graph
The bound, through every operator #
Without an apply, the ordinary tokens holding an occurrence
annotated y are hit by a set of identities of size bounded by the query,
uniformly over the instances whose relations are within a bound closed
under the operations (BdClosed), where a value bounded by y and not a
constant lies in V.
Dependency graph
The witness #
Boolean functions of two variables: y (true) and x (false).
Ī“ is the identity, and the two variables are incomparable.
Instances For
Dependency graph
Equations
- instHasAltLinearOrderBoolXY = { altOrder := linearOrderOfSTO WellOrderingRel }
Dependency graph
The variable annotating the one row of S.
Equations
Instances For
Dependency graph
The variable annotating every row of R.
Equations
Instances For
Dependency graph
The instance of size n: R holds 2 to n + 1, each annotated
x, and S holds 1, annotated y.
Equations
Instances For
Dependency graph
The right side: the count of the rows of S below the parameter.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Dependency graph
R Ⳡγ_ā
[count](Ļ_{#1 < u}(S)).
Equations
- applyWitness = (AggQueryIn.Rel 1 "R").Apply applyRight
Instances For
Dependency graph
The row #
The apply row, up to ā with occurrence identity: a set of classes
generating the annotated algebra up to ā, over Boolean functions of two
variables, holds the apply. The source R Ⳡγ_ā
[count](Ļ_{#1 < u}(S)) gives
each parameter its own occurrence of the row of S, annotated y; a query
without an apply hits all its occurrences annotated y with a set of
identities bounded by the query (AggQueryIn.exists_hit), so it cannot keep
n of them apart for n past that bound.
Dependency graph
The basis theorem up to ā with occurrence identity #
ā with occurrence identity is finer than ā by value, so the rows up to
ā transfer; the constructions agree with their source row by row,
identities included, so the positive half holds with no renaming; and the
apply row says that no set of classes does without the apply.
Generation up to ā with occurrence identity is generation up to ā
by value.
Dependency graph
The annotated basis theorem up to ā with occurrence identity, over
the class: the nine classes generate the annotated algebra up to ā with
occurrence identity over every semiring of AnnBasisClass, no proper subset
of them does over all of those semirings, and no set of classes does
without the apply.