HashTables

Hash tables are actually implemented as a pair of arrays : one for keys, the other for values. Key lookup and insertion are in O(n), so it is very inefficient (as much as alists), but it should change in a few time.