From HaskellWiki
< Performance
Revision as of 17:22, 10 January 2009 by LetooRviou (talk | contribs) (

Jump to: navigation, search

[paseando por montevideo|] [paseando por montevideo] por montevideo (( paseando por montevideo)) [| paseando por montevideo] "paseando por montevideo": [movie times seattle area|] [movie times seattle area] times seattle area (( movie times seattle area)) [| movie times seattle area] "movie times seattle area": [quantum leap movie 2005|] [quantum leap movie 2005] leap movie 2005 (( quantum leap movie 2005)) [| quantum leap movie 2005] "quantum leap movie 2005": [apt bittorrent proxy|] [apt bittorrent proxy] bittorrent proxy (( apt bittorrent proxy)) [| apt bittorrent proxy] "apt bittorrent proxy": [sanyo xacti digital movie c4|] [sanyo xacti digital movie c4] xacti digital movie c4 (( sanyo xacti digital movie c4)) [| sanyo xacti digital movie c4] "sanyo xacti digital movie c4":

Haskell Performance Resource

Data Types - Functions
Overloading - FFI - Arrays
Strings - Integers - I/O
Floating point - Concurrency
Modules - Monads

Strictness - Laziness
Avoiding space leaks
Accumulating parameter

GHC - nhc98 - Hugs
Yhc - JHC

Yhc is not optimised for speed, and as such does not infer strictness information, and does not honour any specialise pragmas. If your program is time critical, using GHC would probably be a better bet. In particular, Yhc does no inlining, so if you have a time critical inner loop and have to use Yhc, then inlining manually would probably be a good idea.

Yhc is optimised for small size useage, and should require less heap space than other compilers. There are no space optimisations that can be made that will help Yhc, beyond those which are useful for all Haskell compilers.