[Haskell-cafe] Using type-level programming to tag functions with time and space complexity

[Daniel McAllansmith]

I was wondering if anyone had done work on tagging functions at the type level 
with their time or space complexity and, if it's even feasible, calculating 
the complexity of compound functions.

Any pointers?

Cheers
Daniel