List notation [ ] notation for lists is syntactic sugar for function expressions  the dot functor combines the HEAD and TAIL of a list [foo] .(foo, []) [cityA, cityB, cityC] .(cityA,.(cityB,.(cityC, [])))  the dot notation highlights the recursive nature of lists a list is either 1.empty, OR 2.a structure with a HEAD (an item) and a TAIL (a list)  in Prolog, can use either notation ?- [a,b] =.(a,.(b, [])).
{}