[Haskell-cafe] fast, strongly typed heterogeneous collections

[Serguey Zefirov]

2010/2/19 Khudyakov Alexey <alexey.skladnoy at gmail.com>:
>> And, actually, what looks like O(n) at the compile time is O(1) at
>> runtime. This is so because it is really hard to create types at
>> runtime. ;)
>
> What did you mean by "really hard"? One have to use black magic and ask demons
> for help or possible but very difficult.

You could create only certain kind of types in runtime< ones like Peano numbers.

I think that complexity of creating, managing and using those numbers
(or trees) in runtime with strong type checking at compile time
obviously makes creating types at runtime very hard.

At least it isn't convenient.