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

Daniel McAllansmith dm.maillists at gmail.com
Thu Oct 18 16:00:49 EDT 2007

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?


More information about the Haskell-Cafe mailing list