% This LaTeX document was generated using the LaTeX backend of PlDoc,
% The SWI-Prolog documentation system



\begin{summarylist}{ll}
\predicatesummary{contains_term}{2}{Succeeds if Sub is contained in Term (=, deterministically).}
\predicatesummary{contains_var}{2}{Succeeds if Sub is contained in Term (==, deterministically).}
\predicatesummary{free_of_term}{2}{Succeeds of Sub does not unify to any subterm of Term.}
\predicatesummary{free_of_var}{2}{Succeeds of Sub is not equal (\Sequal{}) to any subterm of Term.}
\predicatesummary{occurrences_of_term}{3}{Count the number of SubTerms in Term that _unify_ with SubTerm.}
\predicatesummary{occurrences_of_var}{3}{Count the number of SubTerms in Term that are _equal_ to SubTerm.}
\predicatesummary{sub_term}{2}{Generates (on backtracking) all subterms of Term.}
\predicatesummary{sub_term_shared_variables}{3}{If Sub is a sub term of Term, Vars is bound to the list of variables in Sub that also appear outside Sub in Term.}
\predicatesummary{sub_var}{2}{Generates (on backtracking) all subterms (\Sequal{}) of Term.}
\end{summarylist}