The variables proven bound, which is what makes bound(?x) and sameTerm(?x, ?x) decidable.
The term the access is fixed to, or the variable that reads its value most directly.
OptionaltypeThe term types left to the access, when the access is proven bound - undefined otherwise, and absent
altogether for a view that decides no kinds of term at all.
Boundedness is what makes both directions of isIRI(a) foldable: it is false of a bound term of
another kind, but an error of an unbound one, and an error is not false in every context.
What an utils/assertionConjunction!AssertionConjunction decides about the expressions it is substituted into.
A view rather than a map of terms, because a conjunction knows things no map can hold:
SUBJECT(?o)may be decided where?ois not, and?omay be known to be a triple term without any term for it being known at all. It stays a view of terms though - an open shape may never be substituted into an expression (S3), the positions nobody named having no variable to write.