6.2 Define the procedure: add_to_tail( Item, List) to store a new element into a list. Assume that all of the elements that can be stored

Question

42 users unlocked this solution today!

6.2 Define the procedure: add_to_tail( Item, List) to store a new element into a list. Assume that all of the elements that can be stored are non-variables. List contains all the stored elements followed by a tail that is not instantiated and can thus accommodate new elements. For example, let the existing elements stored be

a, b and

c. Then List [a,

b, c | Tail] where Tail is a variable. The goal add_to_tail

(d, List) will cause the instantiation. Tail [d | NewTail] and List = [a,

b, c, d | NewTail] Thus the structure can, in effect, grow by accepting new items. Define also the corresponding membership relation.