14We can represent a term t as a tree, and use strings of numbers to identify positions p in the tree, thus identifying subterms t|p. For example, for t = f(g(a),h(b)), we have t|nil = t, t|1 = g(a), t|11 = a, t|2 = h(b), and t|21 = b.