The partial clone of linear tree languages (Q2332072)

Here, a tree means a term. It is called linear if every variable occurs only once. The authors define a partial superposition operation on a set of linear trees of a given type and study properties of some many-sorted partial clones that have sets of linear trees as elements and partial superpositions as fundamental operations. They prove that endomorphisms of these algebras correspond to nondeterministic linear hypersubstitutions studied by the authors in a series of previous papers.