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

On Thu, 18 Oct 2007, Daniel McAllansmith [EMAIL PROTECTED] wrote: 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? I have done

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

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 ___ Haskell-Cafe mailing list

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

Hello, Oleg, Chung-chieh Shan, and others have done some work close to this area. On this page, see the Monads parameterized by time section: http://okmij.org/ftp/Haskell/number-parameterized-types.html Also see this page: http://okmij.org/ftp/Haskell/types.html#ls-resources The new type