First version of an immutable, linear list whitch has performace O(1)
for head, tail, isEmpty and prepend. For most other operations like
append, contains, get and reverse it has O(n).