16We 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 | n i l = t , t | 1 = g ( a ) , t | 1 1 = a , t | 2 = h ( b ) , and t | 2 1 = b .