[B! Haskell] iaskellã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

iaskell id:iaskell

Haskellã«é–¢ã™ã‚‹iaskellã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (4)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

C++ for Haskeller
http://haskell.g.hatena.ne.jp/mr_konn/20061006/1160138831 Haskellã‹ã‚‰å…¥ã£ãŸäººã«ã¯ã€cinã¨ã‹coutã¨ã‹å¾®å¦™ã™ãŽã¦ã‚ˆããªã„ã ã‚ã€ã¨ã€æ€ã£ãŸã®ã§ã€é©å½“ã«ã€‚ å¯¾è±¡èªè€…ã¯ã€Haskellã‚ã‹ã‚‹ã—ã€C++ã‚‚ã‚ã‹ã‚‹äººï¼ˆæ„å‘³ããƒ¼ï¼‰ã€‚ãƒã‚¿ã‚’ç†è§£ã§ãã‚‹äººã§ã™ã€‚ C++ã¨ã¯ C++ã¨ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ãªç‰¹å¾´ã‚’æŒã£ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã™ å‚ç…§é€æ˜Žï¼ˆï¼ï¼‰ å‡ºç¾è©•ä¾¡(occurrence evaluation) ï¼ˆãªã©ã¨ã„ã†ã„ã‹ãŒã‚ã—ã„å˜èªžã‚’ã¤ãã‚‹ï¼‰ ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã§ãã‚‹ å…¨ãç›´æ„Ÿçš„ã§ãªã„æ§‹æ–‡ IOãƒ¢ãƒŠãƒ‰ã‚’æ›¸ããŸã‚ã®å¤§é‡ã®syntax sugarãŒã‚ã‚‹ èª¬æ˜Žã—ã¦ã„ãã¨é•·ããªã‚‹ã®ã§ã€ãã‚Œãžã‚Œã€ãŠã„ãŠã„å¿…è¦ã«ãªã£ãŸã¨ãã«èª¬æ˜Žã™ã‚‹ã‚ˆã†ã«ã—ã¾ã™ã€‚ C++ã®åž‹ C++ã«ã¯ã€æ¬¡ã®åž‹ãŒã‚ã‚Šã¾ã™ã€‚ æ•´æ•° çœŸå½å€¤ é€£æƒ³é…åˆ— ã¾ã‚ã€ãŠã„ãŠã„èª¬æ˜Žã€‚ï¼ˆã¯ã‚„ãã‚‚é£½ãã¦ããŸï¼‰
iaskell 2012/12/05
ãƒã‚¿

c++

Haskell

é»’é”è¡“
ãƒªãƒ³ã‚¯
ã‚¹ã‚¿ãƒ¼ãƒˆHaskell2 #1 ã«å‚åŠ ã—ã¦ãã¾ã—ãŸ - ãã®æ‰‹ã®å¹³ã¯å°»ã‚‚ã¤ã‹ã‚ã‚‹ã•
ç¬¬1å›žã‚¹ã‚¿ãƒ¼ãƒˆHaskell2ã«è¡Œã£ã¦ãã¾ã—ãŸã€‚ çµè«– Haskell ã¯é¢ç™½ã„ã€‚ãã—ã¦ã™ã”ã„ã€‚ä»¥ä¸Šï¼ èžã„ã¦ããŸã“ã¨ ã€Œã™ã”ã„Haskell æ¥½ã—ãå¦ã¼ã†ã€(ä»¥ä¸‹ã€Œã™ã”ã„Hæœ¬ã€)ã®ä¸èº«ã¯ã€ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ï¼š @Lost_dog_ ã•ã‚“ ç¬¬1ç« ï¼šã¯ã˜ã‚ã®ç¬¬ä¸€æ©ï¼š @Lost_dog_ ã•ã‚“ ç¬¬2ç« ï¼šåž‹ã‚’ä¿¡ã˜ã‚ï¼ï¼š @skoji ã•ã‚“ LT ã§ã¯ã€ Haskell ã«æ–¼ã‘ã‚‹ãƒ¦ãƒ‹ãƒƒãƒˆãƒ†ã‚¹ãƒˆã®æ–¹æ³•ï¼š @shokos ã•ã‚“ Haskell ã‚’ä¸Šæ‰‹ã„ã“ã¨èº«ã«ã¤ã‘ã‚‹æ–¹æ³•ï¼š @dekosuke ã•ã‚“ Yesod ã‚’ä½¿ã£ãŸHaskell ã«ã‚ˆã‚‹Web ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ä½œæˆã®ç´¹ä»‹ï¼š @seizans ã•ã‚“ ã¨ã„ã†å†…å®¹ã‚’æ‹è´ã—ã¦ãã¾ã—ãŸã€‚(ä¸Šã«æ›¸ã„ãŸLT ã®ã‚¿ã‚¤ãƒˆãƒ«ã¯åƒ•ãŒå‹æ‰‹ã«ä»˜ã‘ã¾ã—ãŸ(æ£ã—ã„ã‚¿ã‚¤ãƒˆãƒ«ã‚’å¤±å¿µã—ã¦ã—ã¾ã£ãŸã®ã§â€¦â€¦)ã€‚ã‚¹ãƒŸãƒžã‚»ãƒ³) èžã„ã¦ããŸäº‹ã®è©³ç´° Haskell ã¯lazy(non-st
iaskell 2012/09/07
haskell
ãƒªãƒ³ã‚¯
ã‚†ã‚‹ãµã‚Haskell (Light & Airy Haskell) â€” laskell 0.0.1 documentation
ã¯ã˜ã‚ã«Â¶ å··ã«æº¢ã‚Œã¦ã„ã‚‹Haskellæœ¬ã¯ã„ããªã‚Šã®IOã‚’é¿ã‘ã¦ã„ã‚‹ã‚‚ã®ãŒå¤šã„ã§ã™ã‚ˆãã€‚ã“ ã‚Œã‚‰ã®æœ¬ã‚’èªã‚“ã§ã‚ã‹ã£ãŸæ°—ã«ãªã£ã¦ã‚‚ã€å®Ÿéš›ã«æ—¥ã€…ã®ã‚¿ã‚¹ã‚¯ã«ä½¿ãŠã†ã¨ã—ãŸ å ´åˆã«çµæ§‹ãƒãƒžã‚‹ã“ã¨ãŒå¤šã„ã‚“ã§ã™ã‚ˆãã€‚ ã€Œç¿’ã†ã‚ˆã‚Šæ…£ã‚Œã‚ã€ã¿ãŸã„ãªã‚¹ã‚¿ã‚¤ãƒ«ã§Haskellã®å¦ç¿’ã‚’ã™ã‚‹ã¨ã©ã†ã„ã†å¦ç¿’æ›² ç·šã‚’ãŸã©ã‚‹ã“ã¨ã«ãªã‚‹ã‚“ã ã‚ã†ã‹? phpã®ã‚ˆã†ã«å‹•ã‘ã°ã„ã„ã‚„(åè¦‹?)ã¨ã„ã†ã‚¹ ã‚¿ãƒ³ã‚¹ã§Haskellã®ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ãã“ã¨ã¯å¯èƒ½ãªã‚“ã ã‚ã†ã‹? ã¨ç–‘å•ã«æ€ã£ãŸã®ã§ã€ã‚ˆãã‚ã‚‹ã‚¹ã‚¯ãƒªãƒ—ãƒˆè¨€èªžã®å…¥é–€æ›¸(IOã‹ã‚‰å…¥ã‚‹ç³»)ã®ã‚ˆã† ãªè©±é¡Œã‚’å–ã‚Šæ‰±ã£ã¦ã¿ã‚ˆã†ã‹ãªã¨ã€‚ Sphinxã¨ã„ã†è‰¯ã„æ„Ÿã˜ã«æ–‡ç« ã‚’ã‹ã‘ã‚‹ãƒ„ãƒ¼ ãƒ«ã¨ã€æ›¸ã„ãŸæ–‡ç« ã‚’GitHub Pagesã§æ‰‹è»½ã«å…¬é–‹ã§ãã‚‹ã‚ˆã†ãªç’°å¢ƒã®å˜åœ¨ã‚‚ã€ã“ ã®è©¦ã¿ã‚’å¾ŒæŠ¼ã—ã—ã¾ã—ãŸã€‚ã¨ã„ã†ã‹æ›¸ã„ã¦ã„ã¦æ¥½ã—ã„ã®ã§ã€ã¿ãªã•ã‚“ã‚‚Sphinx ã¤ã‹ã†ã¨ãƒãƒƒãƒ”ãƒ¼ã«ãªã‚Œã‚‹ã¨æ€ã„ã¾ã™ã€‚ ãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ãª
iaskell 2012/07/10
ã“ã‚“ãªåå‰ã ã—ãã‚ãã‚haskellã‚„ã£ã¦ã¿ã‚‹ã‹ãªãƒ¼

ten

haskell

dev

ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«
ãƒªãƒ³ã‚¯
induceBackwardã‚’é«˜é€ŸåŒ–ã—ã‚ˆã†ã¨ã—ãŸ - www.kotha.netã®è£
Haskell vs F# - Life Goes OnãŒæ°—ã«ãªã£ãŸã®ã§ã‚„ã£ã¦ã¿ãŸã€‚ æ‰‹å…ƒã«F#ã®å®Ÿè¡Œç’°å¢ƒãŒãªã„ã®ã§ã€å…ƒã®ã‚³ãƒ¼ãƒ‰ã‚’2å€é«˜é€ŸåŒ–ã™ã‚‹ã“ã¨ã‚’ç›®æ¨™ã«ã—ã¦ã¿ã‚‹ã€‚ç’°å¢ƒã¯Linux x64, GHC 7.0.4. æœ€åˆã®ã‚³ãƒ¼ãƒ‰ã€‚ import Data.Array.Unboxed data Node = Node { df :: Double, branch :: [(Int, Double)] } induceBackward :: Array Int Node -> UArray Int Double -> UArray Int Double induceBackward nodes values = accumArray (+) 0 (bounds nodes) [(j, p * values ! k * df) | (j, Node df branch) <- assocs no
iaskell 2012/02/07
haskell

ãƒãƒ¥ãƒ¼ãƒ‹ãƒ³ã‚°

Dev
ãƒªãƒ³ã‚¯
1