I’m just curious, but is there any practical guide or tutorial on this topic? I found it relatively hard to reason about the time complexity of Haskell programs.

— 
Xiaojun "Phil" Hu

On Friday, 6 June, 2014 at 21:05, Bob Ippolito wrote:

That declares those fields to be strict. See also http://www.haskell.org/haskellwiki/Performance/Data_types

On Friday, June 6, 2014, Song Zhang <vxanica@gmail.com> wrote:
This is about syntax of Haskell.
I am reading the source code of Yampa. I find that a definition like the following

data SF' a b where
    SFArr   :: !(DTime -> a -> Transition a b) -> !(FunDesc a b) -> SF' a b


in Yampa.hs.
_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://www.haskell.org/mailman/listinfo/beginners