The Cichelli program takes as input a list of keywords and
attempts to generate a perfect hash function for them.
The hash function uses the scheme:
   
hash k = h (head k) + length k + h (last k)

The output of the program is a suitable mapping h, expressed
as an association list, or a report of failure.
