12.9. Inductive reasoning#
Determine the \(\theta\)-LGG of the following two clauses:
This is the recursive clause in the version with accumulator of the
reverse/3 predicate (Section 3.6), with one small difference: here, the third argument is required to be a non-empty list (which it always is). Notice that this clause is not strictly constrained, and cannot be inferred by the induction programs in Sections 9.2 and 9.3 (see also Exercise 9.4).