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

chuwb id:chuwb

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

${{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}}

ã‚†ã‚‹ãµã‚Haskell (Light & Airy Haskell) â€” laskell 0.0.1 documentation
ã¯ã˜ã‚ã«Â¶ å··ã«æº¢ã‚Œã¦ã„ã‚‹Haskellæœ¬ã¯ã„ããªã‚Šã®IOã‚’é¿ã‘ã¦ã„ã‚‹ã‚‚ã®ãŒå¤šã„ã§ã™ã‚ˆãã€‚ã“ ã‚Œã‚‰ã®æœ¬ã‚’èªã‚“ã§ã‚ã‹ã£ãŸæ°—ã«ãªã£ã¦ã‚‚ã€å®Ÿéš›ã«æ—¥ã€…ã®ã‚¿ã‚¹ã‚¯ã«ä½¿ãŠã†ã¨ã—ãŸ å ´åˆã«çµæ§‹ãƒãƒžã‚‹ã“ã¨ãŒå¤šã„ã‚“ã§ã™ã‚ˆãã€‚ ã€Œç¿’ã†ã‚ˆã‚Šæ…£ã‚Œã‚ã€ã¿ãŸã„ãªã‚¹ã‚¿ã‚¤ãƒ«ã§Haskellã®å¦ç¿’ã‚’ã™ã‚‹ã¨ã©ã†ã„ã†å¦ç¿’æ›² ç·šã‚’ãŸã©ã‚‹ã“ã¨ã«ãªã‚‹ã‚“ã ã‚ã†ã‹? phpã®ã‚ˆã†ã«å‹•ã‘ã°ã„ã„ã‚„(åè¦‹?)ã¨ã„ã†ã‚¹ ã‚¿ãƒ³ã‚¹ã§Haskellã®ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ãã“ã¨ã¯å¯èƒ½ãªã‚“ã ã‚ã†ã‹? ã¨ç–‘å•ã«æ€ã£ãŸã®ã§ã€ã‚ˆãã‚ã‚‹ã‚¹ã‚¯ãƒªãƒ—ãƒˆè¨€èªžã®å…¥é–€æ›¸(IOã‹ã‚‰å…¥ã‚‹ç³»)ã®ã‚ˆã† ãªè©±é¡Œã‚’å–ã‚Šæ‰±ã£ã¦ã¿ã‚ˆã†ã‹ãªã¨ã€‚ Sphinxã¨ã„ã†è‰¯ã„æ„Ÿã˜ã«æ–‡ç« ã‚’ã‹ã‘ã‚‹ãƒ„ãƒ¼ ãƒ«ã¨ã€æ›¸ã„ãŸæ–‡ç« ã‚’GitHub Pagesã§æ‰‹è»½ã«å…¬é–‹ã§ãã‚‹ã‚ˆã†ãªç’°å¢ƒã®å˜åœ¨ã‚‚ã€ã“ ã®è©¦ã¿ã‚’å¾ŒæŠ¼ã—ã—ã¾ã—ãŸã€‚ã¨ã„ã†ã‹æ›¸ã„ã¦ã„ã¦æ¥½ã—ã„ã®ã§ã€ã¿ãªã•ã‚“ã‚‚Sphinx ã¤ã‹ã†ã¨ãƒãƒƒãƒ”ãƒ¼ã«ãªã‚Œã‚‹ã¨æ€ã„ã¾ã™ã€‚ ãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ãª
chuwb 2012/08/09
haskell
ãƒªãƒ³ã‚¯
Enumerator Package - Yet Another Iteratee Tutorial - Preferred Networks Research & Development
ãƒãƒ¬ãƒ³ã‚¿ã‚¤ãƒ³ãƒãƒ§ã‚³æ¬²ã—ã„ï¼ ç”°ä¸ã§ã™ã€‚ Iterateeã®ç´ æ™´ã‚‰ã—ã„ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’è¦‹ã¤ã‘ãŸã®ã§ã€ä»Šå›žã¯ãã®ç¿»è¨³ã‚’ãŠå±Šã‘ã—ã‚ˆã†ã¨æ€ã„ã¾ã™ã€‚ä»¥å‰ã€The Monad Reader Issue 16 ã®iterateeã®è¨˜äº‹ã‚’ãƒ™ãƒ¼ã‚¹ã«ã—ãŸè§£èª¬è¨˜äº‹ã‚’æ›¸ã„ãŸã®ã§ã™ãŒã€ã“ã¡ã‚‰ã®è¨˜äº‹ã¯ã‹ãªã‚Šæ¦‚å¿µçš„ãªã¨ã“ã‚ã‹ã‚‰å§‹ã¾ã‚Šã€çµæ§‹å¤©ä¸‹ã‚Šçš„ã«iterateeã®å®šç¾©ã‚’å—ã‘å…¥ã‚Œã¦ã„ãŸã®ã«å¯¾ã—ã¦ã€ã“ã¡ã‚‰ã®è¨˜äº‹ã¯ã€ä¸€è²«ã—ã¦å…·ä½“ä¾‹ã‹ã‚‰ã®æŠ½è±¡åŒ–ã§è©±ãŒé€²ã¿ã€ã¾ãŸæ˜“ã—ãæ›¸ã‹ã‚Œã¦ã„ã‚‹ã®ã§ã€æ¯”è¼ƒçš„ç†è§£ã—ã‚„ã™ã„ã¨æ€ã„ã¾ã™ã€‚ã¾ãŸã€å®Ÿéš›ã®å®Ÿè£…ã«å³ã—ã¦è§£èª¬ã•ã‚Œã¦ã„ã¾ã™ã®ã§ã€èªã¿çµ‚ãˆã¦å³å®Ÿéš›ã«ä½¿ã£ã¦ã¿ã‚‹ã“ã¨ãŒå‡ºæ¥ã‚‹ã§ã—ã‚‡ã†ã€‚ ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’æ›¸ã‹ã‚ŒãŸMichael Snoymanã¨ã„ã†æ–¹ã¯ã€ç¾åœ¨Yesodã¨ã„ã†Haskellã®Webãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ã‚’ç²¾åŠ›çš„ã«é–‹ç™ºã•ã‚Œã¦ã„ã¾ã™ã€‚Yesodã«ã¯å®Ÿéš›ã«iterateeãŒãµã‚“ã ã‚“ã«ç”¨ã„ã‚‰ã‚Œã¦ãŠã‚Šã€ã
chuwb 2012/06/12
haskell

functional

iteratee
ãƒªãƒ³ã‚¯
Haskell Day2012 - å‚ç…§é€éŽæ€§ã¨ã¯ä½•ã ã£ãŸã®ã‹
3. è‡ªå·±ç´¹ä»‹ â€¢ @ruicc â€¢ Ruichi Kousuke â€¢ å¥½ããªä½œæ›²å®¶ï¼šA. Bruckner â€¢ å¥½ããªãƒã‚¤ã‚ªãƒªãƒ‹ã‚¹ãƒˆï¼šHilary Hahn â€¢ å¥½ããªè¨€èªžï¼šHaskell â€¢ çˆ†ç™ºã™ã‚Œã°ã„ã„è¨€èªžï¼šPHP
chuwb 2012/05/29
haskell
ãƒªãƒ³ã‚¯
The Typeclassopediaã‚’è¨³ã—ã¾ã—ãŸ, The Typeclassopedia - #3(2009-10-20)
â– [Haskell] The Typeclassopediaã‚’è¨³ã—ã¾ã—ãŸ The Monad.Readerã®Issue 13ã«æŽ²è¼‰ã•ã‚ŒãŸThe Typeclassopediaã¨ã„ã†è¨˜äº‹ãŒã€Functor, Monad, Monoid, Applicative, Foldable, Traversable, Arrowã¨ã„ã£ãŸã‚ˆã†ãªåž‹ã‚¯ãƒ©ã‚¹ã«ã¤ã„ã¦è‰¯ãã¾ã¨ã¾ã£ã¦ã„ã¦ã€ãã®ã‚ãŸã‚Šã‚’çŸ¥ã‚ŠãŸã„æ™‚ã®å–ã£æŽ›ã‹ã‚Šã«ãªã‚Šãã†ã ã£ãŸã®ã§ç¿»è¨³ã—ã¦ã¿ã¾ã—ãŸã€‚ ä½œè€…ã®Brent Yorgeyã•ã‚“ã‹ã‚‰ã‚‚è¨±å¯ãŒã„ãŸã ã‘ãŸã®ã§å…¬é–‹ã—ã¾ã™ã€‚ç¿»è¨³ã«æ…£ã‚Œã¦ã„ãªã„ã®ã§å¤‰ãªæ—¥æœ¬èªžï¼ˆç‰¹ã«å°‚é–€ç”¨èªžã®æ—¥æœ¬èªžè¨³ã¯ã‹ãªã‚Šæ€ªã—ã„ï¼‰ãŒã‚ã£ãŸã‚Šã€ãã‚‚ãã‚‚é–“é•ã£ã¦ã„ãŸã‚Šã™ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã®ã§ã€ä½•ã‹è¦‹ã¤ã‘ãŸã‚‰ã‚³ãƒ¡ãƒ³ãƒˆã‚’é ‚ã‘ã‚‹ã¨åŠ©ã‹ã‚Šã¾ã™ã€‚ â– [Haskell] The Typeclassopedia by Brent Yorgey <first
chuwb 2012/04/16
haskell

monad
ãƒªãƒ³ã‚¯
Applicative ã‚ˆã‚Šã‚‚ Monad ã®æ–¹ãŒåŠ›ãŒå¼·ã„ç†ç”± - ã‚ã©ã‘ãªã„è©±
Applicative ã‚ˆã‚Šã‚‚ Monad ã®æ–¹ãŒåŠ›ãŒå¼·ã„ç†ç”±ã‚’è€ƒãˆã‚‹ãŸã‚ã®ãƒ¡ãƒ¢ã€‚ã“ã‚Œã‹ã‚‰è°è«–ã™ã‚‹ãŸã‚ã®ãŸãŸãå°ãªã®ã§ã€ãã†æ€ã£ã¦èªã‚“ã§æ¬²ã—ã„ã€‚ ã‚³ãƒ³ãƒ†ãƒŠã§åŒ…ã‚€ return Monad ã¨ã¯ã€ã‚³ãƒ³ãƒ†ãƒŠã§ã‚ã‚‹ã€‚ã‚³ãƒ³ãƒ†ãƒŠã¯ã€æ–‡è„ˆã‚’è¡¨ã™ã€‚ãŸã¨ãˆã°ã€Maybe ã¨ã„ã†ã‚³ãƒ³ãƒ†ãƒŠã¯ã€å¤±æ•—ã™ã‚‹ã‹ã‚‚ã—ã‚Œãªã„è¨ˆç®—ã¨ã„ã†æ–‡è„ˆã‚’è¡¨ã™ã€‚ é€šå¸¸ã®å€¤ã‚„é–¢æ•°ã‚’æ–‡è„ˆã«å…¥ã‚Œã‚‹ãŸã‚ã® API ãŒ return ã§ã‚ã‚‹ã€‚ return :: a -> ma ã‚³ãƒ³ãƒ†ãƒŠå†…ã§ã®é–¢æ•°é©ç”¨ <*> ä»¥ä¸‹ã®ã‚ˆã†ãªåž‹ã‚’æŒã¤é–¢æ•°ã‚’è€ƒãˆã‚‹ã€‚ f :: a -> b ã“ã®é–¢æ•°ã‚’ return ã‚’ä½¿ã£ã¦æ–‡è„ˆã®ä¸ã«å…¥ã‚Œã¦ã‚„ã‚‹ã¨ã€åž‹ã¯æ¬¡ã®ã‚ˆã†ã«ãªã‚‹ã€‚ return f :: m (a -> b) ã“ã®é–¢æ•°ã‚’ã€ã‚³ãƒ³ãƒ†ãƒŠå†…ã«ã‚ã‚‹å€¤ã«é©å¿œã™ã‚‹ãŸã‚ã® API ãŒ (<*>) ã§ã‚ã‚‹ã€‚ (<*>) :: m (a -> b) -> m a -> m b ã‚³ãƒ³ãƒ†
chuwb 2012/04/15
haskell

monad
ãƒªãƒ³ã‚¯
QAã§å¦ã¶Monad - ã‚ã©ã‘ãªã„è©±
ã“ã®è¨˜äº‹ã¯ã€Monad ã§ã¤ã¾ã¥ã„ãŸ Haskeller ã®ãŸã‚ã® Monad å†å…¥é–€ã§ã™ã€‚ Monadã¨ã¯ä½•ã§ã™ã‹ï¼Ÿ Monad ã¨ã¯ã€å˜ãªã‚‹åž‹ã‚¯ãƒ©ã‚¹ã®ä¸€ã¤ã§ã™ã€‚é›£ã—ã„ã¨ã„ã†é¢¨è©•ã‚‚ã‚ã‚Šã¾ã™ãŒã€ãã‚Œä»¥ä¸Šã§ã‚‚ãã‚Œä»¥ä¸‹ã§ã‚‚ã‚ã‚Šã¾ã›ã‚“ã€‚ ã“ã®åž‹ã‚¯ãƒ©ã‚¹ã®ãƒ¡ã‚½ãƒƒãƒ‰ã¯ã€return ã¨ >>= ã§ã™ã€‚ class Monad m where (>>=) :: m a -> (a -> m b) -> m b return :: a -> m a ã¤ã¾ã‚Šã€ä»¥ä¸‹ã‚’æº€ãŸã™åž‹ã®é›†åˆãŒ Monad ã§ã™ã€‚ m a ã§è¡¨ç¾ã§ãã‚‹ã‚ˆã†ã«ä¸€ã¤ã®åž‹å¤‰æ•°ã‚’æ ¼ç´ã™ã‚‹ã‚³ãƒ³ãƒ†ãƒŠåž‹ >>= ã¨ return ã‚’å®Ÿè£… return ã¯æ–°ã—ã„ã‚³ãƒ³ãƒ†ãƒŠã‚’ä½œã‚Šã€>>= ã¯äºŒã¤ã®ã‚³ãƒ³ãƒ†ãƒŠã‚’åˆæˆã—ã¾ã™ã€‚ Monad ã®ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹ã¯å¤±æ•—ç³»ã¨çŠ¶æ…‹ç³»ã«å¤§åˆ¥ã§ãã¾ã™ã€‚ä»¥ä¸‹ã«ä»£è¡¨çš„ãªã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹ã‚’ç¤ºã—ã¾ã™ã€‚ å¤±æ•—ç³»: Maybeã€[] (ãƒªã‚¹ãƒˆ)
chuwb 2011/12/21
haskell

monad

functional
ãƒªãƒ³ã‚¯
Chapters - Learn You a Haskell for Great Good!
Introduction About this tutorial So what's Haskell? What you need to dive in Starting Out Ready, set, go! Baby's first functions An intro to lists Texas ranges I'm a list comprehension Tuples Types and Typeclasses Believe the type Type variables Typeclasses 101 Syntax in Functions Pattern matching Guards, guards! Where!? Let it be Case expressions Recursion Hello recursion! Maximum awesome A few m
chuwb 2011/12/21
haskell

tutorial

programming
ãƒªãƒ³ã‚¯
Haskell ç”¨ã® emacs ã‚«ã‚¹ã‚¿ãƒžã‚¤ã‚ºä¾‹ - ã‚ã‹ã‚‰ã‚“
Haskell Advent Calendar 2011 ã¸ã®å‚åŠ è¨˜äº‹ã§ã™ã€‚ãµã ã‚“ emacs ã§ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ã„ã¦ã„ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒžãŒ Haskell ã‚’ä½¿ã£ã¦ã¿ã‚ˆã†ã¨æ€ã£ãŸã¨ãã«ã€10 åˆ†ã§ãã‚Œãªã‚Šã®ç’°å¢ƒæ§‹ç¯‰ã™ã‚‹ãŸã‚ã®ã€ä¾¿åˆ©ãªæ‰‹é †æ›¸ã¨ãªã‚‹ã“ã¨ã‚’ç›®æŒ‡ã—ã¦æ›¸ãã¾ã—ãŸã€‚~/.emacs ã‚„ ~/.emacs.d/init.el ãªã©ã®è¨å®šãƒ•ã‚¡ã‚¤ãƒ«ã¯ã€dot.emacs ã¨è¡¨è¨˜ã—ã¦ã„ã¾ã™ã€‚ Haskell ã®ç’°å¢ƒæ§‹ç¯‰ Haskell è‡ªä½“ã®ç’°å¢ƒæ§‹ç¯‰ã®èª¬æ˜Žã¯ã“ã®è¨˜äº‹ã®ç¯„å›²å¤–ã§ã™ãŒã€å‰æã§ã™ã®ã§ã€ä¿¡é ¼ã§ããã†ãªèª¬æ˜Žã¸ã®ãƒªãƒ³ã‚¯ã‚’è¼‰ã›ã¦ãŠãã¾ã™ã€‚ ãƒˆãƒ©ãƒ“ã‚¹ã•ã‚“ã®ã€ŽHaskell Platform ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« Linuxç·¨ã€ shelarcy ã•ã‚“ã®ã€ŽHaskell Platform ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« Macç·¨ã€ tanakh ã•ã‚“ã®ã€ŽHaskell Platform ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« Windowsç·¨ã€ ãŸã ã—ã€ç§
chuwb 2011/12/20
emacs

haskell
ãƒªãƒ³ã‚¯
Haskellã®æ¥½ã—ã¿ï¼š<br>æ‰‹ç¶šãæ“ä½œåž‹ã¨ã„ã†ãƒ‘ãƒ©ãƒ€ã‚¤ãƒ
Haskellã®æ¥½ã—ã¿ï¼š æ‰‹ç¶šãæ“ä½œåž‹ã¨ã„ã†ãƒ‘ãƒ©ãƒ€ã‚¤ãƒ ç”°ä¸è‹±è¡ŒÂ tanakh@preferred.jp 2011/11/09Â æŠ€è¡“äº¤æµä¼šÂ @æ—¥æœ¬ãƒ¦ãƒ‹ã‚·ã‚¹ è‡ªå·±ç´¹ä»‹ ç”°ä¸è‹±è¡ŒÂ (@tanakh)(æ ª)PreferredÂ InfrastractureÂ ç ”ç©¶é–‹ç™ºéƒ¨é–€ç¤¾å†…ãƒ©ã‚¤ãƒ–ãƒ©ãƒªÂ pficommon https://github.com/pfi/pficommonåˆ†æ•£æ©Ÿæ¢°å¦ç¿’ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯Â jubatus http://jubat.us/Haskellæ„›å¥½å®¶2003ï½žLearnÂ YouÂ aÂ HaskellÂ forÂ GreatÂ Good!è¨³ã—ã¦ã¾ã™æœ¬æ—¥ã®æ¦‚è¦ ãƒ»Â Haskellã¯Â ç°¡å˜ ãƒ»Â Haskellã¯Â ã™ã”ã„ ãƒ»Â Haskellã¯Â é¢ç™½ã„ ãƒ»Â HaskellÂ ã¯ç°¡å˜ã§ã™ã”ãé¢ç™½ã„ ãƒ»Â HaskellÂ ã¯é¢ç™½ãã¦ã™ã”ã„ã‚‚ã®ãŒç°¡å˜ã«ä½œã‚Œã‚‹ ï¼ˆã‚ã¨ãƒ¢ãƒŠãƒ‰ã®è©±å°‘ã—ï¼‰ æœ€è¿‘ã®Haskellã®è©±é¡ŒYes
chuwb 2011/12/08
haskell
ãƒªãƒ³ã‚¯
ã€Œãƒ¢ãƒŠãƒ‰ã¯è±¡ã ã€ã®ç¿»è¨³ã¾ã¨ã‚ - Fight the Future
ã¨ã¦ã‚‚ã‚¨ãƒ³ãƒˆãƒªãŒå¤šãã®å›žã«ã‚ãŸã£ãŸã®ã§ã€ã¾ã¨ã‚ã¾ã™ã€‚ One Div Zero: Monads are Elephants Part 1 ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(7) - Fight the Future ã˜ã‚…ãã®blog ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(8) - Fight the Future ã˜ã‚…ãã®blog ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(9) - Fight the Future ã˜ã‚…ãã®blog ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(10) - Fight the Future ã˜ã‚…ãã®blog ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(11) - Fight the Future ã˜ã‚…ãã®blog ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(12) - Fight the Future ã˜ã‚…ãã®blog One Div Zero: Monads are Elephants Part 2 ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ã(14) - Fig
chuwb 2011/05/19
functional

monad

haskell
ãƒªãƒ³ã‚¯
Learn You a Haskell for Great Good!
Hey yo! This is Learn You a Haskell, the funkiest way to learn Haskell, which is the best functional programming language around. You may have heard of it. This guide is meant for people who have programmed already, but have yet to try functional programming. The whole thing is completely free to read online, but it's also available in print and I encourage you to buy as many copies as you can aff
chuwb 2011/04/13
haskell

tutorial
ãƒªãƒ³ã‚¯
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ - ã¯ã¦ãªã®å‘ŠçŸ¥
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªã®é€šã‚Šã€ä»Šå¹´æœ«ã‚’ç›®å‡¦ã«ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã‚’çµ‚äº†äºˆå®šã§ã‚ã‚‹æ—¨ã‚’ãŠçŸ¥ã‚‰ã›ã—ã¦ãŠã‚Šã¾ã—ãŸã€‚ 2019å¹´æœ«ã‚’ç›®å‡¦ã«ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®æä¾›ã‚’çµ‚äº†ã™ã‚‹äºˆå®šã§ã™ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã“ã®ãŸã³ã€æ£å¼ã«çµ‚äº†æ—¥ã‚’æ±ºå®šã„ãŸã—ã¾ã—ãŸã®ã§ã€ä»¥ä¸‹ã®é€šã‚Šã”ç¢ºèªãã ã•ã„ã€‚ çµ‚äº†æ—¥: 2020å¹´1æœˆ31æ—¥(é‡‘) ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆå¸Œæœ›ç”³è«‹æœŸé™:2020å¹´1æœˆ31æ—¥(é‡‘) çµ‚äº†æ—¥ä»¥é™ã¯ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®é–²è¦§ãŠã‚ˆã³æŠ•ç¨¿ã¯è¡Œãˆã¾ã›ã‚“ã€‚æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãŒå¿…è¦ãªæ–¹ã¯ä»¥ä¸‹ã®è¨˜äº‹ã«ã—ãŸãŒã£ã¦æ‰‹ç¶šãã‚’ã—ã¦ãã ã•ã„ã€‚ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã«æŠ•ç¨¿ã•ã‚ŒãŸæ—¥è¨˜ãƒ‡ãƒ¼ã‚¿ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆã«ã¤ã„ã¦ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã”åˆ©ç”¨ã®ã¿ãªã•ã¾ã«ã¯ã”è¿·æƒ‘ã‚’ãŠã‹ã‘ã„ãŸã—ã¾ã™ãŒã€ã©ã†ãžã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ 2020-06-25 è¿½è¨˜ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãƒ‡ãƒ¼ã‚¿ã¯2020å¹´2æœˆ28
chuwb 2011/01/17
programming

haskell

monad
ãƒªãƒ³ã‚¯
Monads are Elephants Part 1
Introductions to monads are bit of cottage industry on the Internet. So I figured, "why buck tradition?" But this article will present Scala's way of dealing with monads. An ancient parable goes that several blind men were experiencing their first elephant. "It's a tree," one said while wrapping his arms around its legs. "A large snake," another said while holding its trunk. A third said...um, som
chuwb 2010/12/15
ãƒ¢ãƒŠãƒ‰ã¯è±¡â€¦â€¦ã ã¨â€¦â€¦

haskell

monad
ãƒªãƒ³ã‚¯
Applicativeã®ã‚¹ã‚¹ãƒ¡ - ã‚ã©ã‘ãªã„è©±
ã“ã®è¨˜äº‹ã®ç›®çš„ã¯ã€Applicative ä¿¡è€…ã«ã‚ˆã‚‹ Applicative ã‚¹ã‚¿ã‚¤ãƒ«ã®å¸ƒæ•™ã§ã™ã€‚ ç°¡æ½”ã«çµè«–ã‚’è¿°ã¹ã‚‹ã¨ã€ foo = do a <- m1 b <- m2 return (f a b) ã®ã‚ˆã†ãªã‚³ãƒ¼ãƒ‰ã‚’æ›¸ããŸããªã£ãŸã‚‰ foo = f <$> m1 <*> m2 ã¨æ›¸ãã¾ã—ã‚‡ã†ã¨ã„ã†ã“ã¨ã€‚ åˆã„è¨€è‘‰ã¯ã€ã€Œdo ã¨ return ã‚’ãªãã›ï¼ã€ã§ã™ã€‚ Functorã¨Monadã®é–“ Functor ã‚’ç‰¹æ®ŠåŒ–ã—ãŸåž‹ã‚¯ãƒ©ã‚¹ãŒMonadã§ã€Monadã®æ–¹ãŒå¼·åŠ›ã§ã™ã€‚ãªãœãªã‚‰ã€ãƒ¡ã‚½ãƒƒãƒ‰ãŒå¢—ãˆã‚‹ã‹ã‚‰ã§ã™ã€‚ Functorã®ãƒ¡ã‚½ãƒƒãƒ‰ã¯fmapã§ã™ã€‚fmapã®åˆ¥åã‚’ (<$>) ã¨ã„ã„ã¾ã™ã€‚(ã“ã®è¨˜äº‹ã§ã¯ã€(<$>) ã¨ liftM ã‚’åŒä¸€è¦–ã—ã¾ã™ã€‚) ãã—ã¦ã€Monadã®ãƒ¡ã‚½ãƒƒãƒ‰ã¯ã€ã”å˜çŸ¥ã®é€šã‚Š (>>=) ã¨ return ã§ã™ã€‚ Functorã¨Monadã®é–“ã«Applicative
chuwb 2010/12/11
haskell
ãƒªãƒ³ã‚¯
A Gentle Introduction to Haskell, Version 98
Paul Hudak, Yale University John Peterson, Yale University Joseph Fasel, Los Alamos National Laboratory September 28, 1999 ç¿»è¨³ï¼šå±±ä¸‹ ä¼¸å¤« <nobs [email protected]> ã“ã‚Œã¯ã€ã€Œã‚„ã•ã—ã„ Haskell å…¥é–€ (ãƒãƒ¼ã‚¸ãƒ§ãƒ³98)ã€ã®HTMLãƒãƒ¼ã‚¸ãƒ§ãƒ³ã§ã™ã€‚ ç›®æ¬¡è¦ç´„ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ å€¤ã€åž‹ã€ãã®ä»–ã®æœ‰ç”¨ãªæ¦‚å¿µ é–¢æ•° case å¼ã¨ãƒ‘ã‚¿ãƒ¼ãƒ³ç…§åˆ åž‹ã‚¯ãƒ©ã‚¹ã¨ã‚ªãƒ¼ãƒãƒãƒ¼ãƒ‡ã‚£ãƒ³ã‚° å†ã³ã€åž‹ã«ã¤ã„ã¦ å…¥å‡ºåŠ› æ¨™æº–ã® Haskell ã‚¯ãƒ©ã‚¹ ãƒ¢ãƒŠãƒ‰ æ•° ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ« åž‹ä»˜ã‘ã®è½ã—ç©´ é…åˆ— ã“ã®å…ˆã®å¦ç¿’ å‚è€ƒæ–‡çŒ® ç›®æ¬¡ ã“ã®Haskell Tutorialã®ãƒžã‚¹ã‚¿ãƒ¼æ–‡æ›¸ã¯ã€ haskell.orgã«ã‚ã‚Šã¾ã™ã€‚ã“ã®ãƒ¬ãƒãƒ¼ ãƒˆã®è¨‚æ£ã‚„å¤‰æ›´ã¯ã™ã¹ã¦ãã“ã«åæ˜ ã•ã‚Œã‚‹ã‚ˆã†ã«ãªã£
chuwb 2010/12/04
Haskell

programming

tutorial
ãƒªãƒ³ã‚¯
The Haskell 98 Language Report
Simon Peyton Jones [editor], Microsoft Research, Cambridge Lennart Augustsson, Sandburst Corporation Dave Barton, Intermetrics Brian Boutel, Victoria University of Wellington Warren Burton, Simon Fraser University Joseph Fasel, Los Alamos National Laboratory Kevin Hammond, University of St. Andrews Ralf Hinze, University of Bonn Paul Hudak, Yale University John Hughes, Chalmers University of Techn
chuwb 2010/12/04
programing

haskell

reference
ãƒªãƒ³ã‚¯
Yet Another Haskell Tutorial (å’Œè¨³): 4.3 åž‹ã‚¯ãƒ©ã‚¹
å‰ç¯€ã§ã€5ã¨ã„ã†æ•°å€¤ã«å¯¾ã—ã¦å¥‡å¦™ãªåž‹å®šç¾©ã‚’ã—ãªã‘ã‚Œã°ãªã‚‰ãªã„ã“ã¨ãŒã‚ã‹ã£ãŸã€‚åž‹ã‚¯ãƒ©ã‚¹ã«ã¤ã„ã¦æ·±ãæŽ˜ã‚Šä¸‹ã’ã¦èª¿ã¹ã‚‹å‰ã«å°‘ã—è©±ã‚’æˆ»ã—ã€ãã‚‚ãã‚‚åž‹ã‚¯ãƒ©ã‚¹ã‚’å°Žå…¥ã™ã‚‹ã“ã¨ã«ãªã£ãŸå‹•æ©Ÿã«ã¤ã„ã¦å°‘ã—è€ƒå¯Ÿã—ã‚ˆã†ã€‚ å¤šãã®è¨€èªž (C++ã€Javaãªã©) ã§ã€ã‚ªãƒ¼ãƒãƒ¼ãƒãƒ¼ãƒ‰ã¨ã„ã†ä»•çµ„ã¿ãŒå˜åœ¨ã™ã‚‹ã€‚ã¤ã¾ã‚Šã€ã•ã¾ã–ã¾ãªãƒ‘ãƒ©ãƒ¡ãƒ¼ã‚¿åž‹ã‚’ã¨ã‚‹ã‚ˆã†ã«ã€é–¢æ•°ã‚’è¨˜è¿°ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ä»•çµ„ã¿ã ã€‚ãŸã¨ãˆã°ã€åŒå€¤é–¢æ•°ãŒãã®ã‚ˆã„ä¾‹ã ã€‚2ã¤ã®æ•´æ•°ã‚’æ¯”è¼ƒã™ã‚‹å ´åˆã¯æ•´æ•°ã®æ¯”è¼ƒé–¢æ•°ã‚’ä½¿ç”¨ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã€‚2ã¤ã®æµ®å‹•å°æ•°ç‚¹æ•°ã‚’æ¯”è¼ƒã™ã‚‹å ´åˆã¯æµ®å‹•å°æ•°ç‚¹æ•°ã®æ¯”è¼ƒé–¢æ•°ã‚’ä½¿ç”¨ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã€‚2ã¤ã®æ–‡å—ã‚’æ¯”è¼ƒã™ã‚‹å ´åˆã¯æ–‡å—ã®æ¯”è¼ƒé–¢æ•°ã‚’ä½¿ç”¨ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã€‚ä¸€èˆ¬ã«ã€åž‹Î±ã®ã‚‚ã®åŒå£«ã‚’æ¯”è¼ƒã™ã‚‹å ´åˆã¯ã€åž‹Î±ã®æ¯”è¼ƒé–¢æ•°ãŒå¿…è¦ã«ãªã‚‹ã®ã ã€‚ã“ã®Î±ã¯åž‹ã‚’å€¤ã¨ã™ã‚‹å¤‰æ•°ãªã®ã§ã€åž‹å¤‰æ•°ã¨å‘¼ã‚“ã§ã„ã‚‹ã€‚ ã¨ã“ã‚ãŒã“ã‚Œã¯ã€é™çš„åž‹ãƒã‚§ãƒƒã‚¯ã«ã¨ã£ã¦ã¯éƒ½åˆãŒæ‚ªã„ã€‚ã¨ã„ã†ã®ã‚‚ã€ã‚ã‚‹å‡¦ç† (ãŸã¨
chuwb 2010/11/06
*ã‚ã¨ã§èªã‚€

haskell
ãƒªãƒ³ã‚¯
Scala Implicits: åž‹ã‚¯ãƒ©ã‚¹ã€è¥²æ¥ Â· eed3si9n
2010-11-03 Debasish Ghosh ã•ã‚“ (@debasishg) ã® â€œScala Implicits : Type Classes Here I Comeâ€ ã‚’ç¿»è¨³ã—ã¾ã—ãŸï¼Ž å…ƒè¨˜äº‹ã¯ã“ã¡ã‚‰: http://debasishg.blogspot.com/2010/06/scala-implicits-type-classes-here-i.html (ç¿»è¨³ã®å…¬é–‹ã¯æœ¬äººã‚ˆã‚Šè¨±è«¾æ¸ˆã¿ã§ã™) ç¿»è¨³ã®é–“é•ã„ç‰ãŒã‚ã‚Œã°é æ…®ãªãã”æŒ‡æ‘˜ãã ã•ã„ï¼Ž å…ˆæ—¥ Twitter ä¸Šã§ Daniel ã¨ Scala ã§ã®åž‹ã‚¯ãƒ©ã‚¹ã«ã¤ã„ã¦è«–è°ã—ã¦ã„ã‚‹ã¨ï¼Œçªç„¶ã“ã®ãƒˆãƒ”ãƒƒã‚¯ã«é–¢ã™ã‚‹æ›¸ãã‹ã‘ã ã£ãŸè¨˜äº‹ã‚’ç™ºè¦‹ã—ãŸï¼Žã“ã‚Œã‚’èªã‚“ã§ã‚‚ã‚ãªãŸã¯ç‰¹ã«ç›®æ–°ã—ã„äº‹ã‚’ç™ºè¦‹ã™ã‚‹ã‚ã‘ã§ã¯ãªã„ãŒï¼Œåž‹ã‚¯ãƒ©ã‚¹ã«åŸºã¥ã„ãŸæ€è€ƒã¯ã‚ãªãŸã®è¨è¨ˆã®å¹…ã«ä¾¡å€¤ã‚’ä¸Žãˆã‚‹ã“ã¨ãŒã§ãã‚‹ã¨æ€ã†ï¼Žã“ã®è¨˜äº‹ã‚’æ›¸ãå§‹ã‚ãŸã®ã¯ã—ã°ã‚‰ãå‰ã«è¨è¨ˆã®ç›´äº¤æ€§ã«ã¤ã„ã¦ã®
chuwb 2010/11/06
haskell

scala
ãƒªãƒ³ã‚¯
Smalltalk ã®ã‚¯ãƒ©ã‚¹ã¨ Haskell ã®åž‹ã‚¯ãƒ©ã‚¹ã‚’æ¯”è¼ƒã—ã¾ã™ã€‚ - è¨€èªžã‚²ãƒ¼ãƒ
ç§ã¯ Haskell ã®ä¸€ç•ªã™ã”ã„æ‰€ã¯åž‹ã‚¯ãƒ©ã‚¹ã ã¨æ€ã£ã¦ã„ã‚‹ã‚“ã§ã™ãŒã€ã“ã“æ•°æ—¥ãã‚Œã‚’è¨€è‘‰ã«ã—ã‚ˆã†ã¨ãšã£ã¨æ‚©ã‚“ã§ã„ã¾ã—ãŸã€‚çµå±€ã€ã‚‚ã†ä¸€ã¤ã®å¥½ããªè¨€èªžãªSmalltalk ã¨æ¯”è¼ƒã—ã¦åž‹ã‚¯ãƒ©ã‚¹ãŒã©ã†ã„ã†ç‰©ã‹æ›¸ã„ã¦ã¿ã‚‹äº‹ã«ã—ã¾ã—ãŸã€‚ åž‹ã‚¯ãƒ©ã‚¹ã¨ã„ã†åå‰ã«ã¤ã„ã¦ Smalltalk ã«æŸ“ã¾ã£ã¦ã—ã¾ã£ãŸäººã«ã¨ã£ã¦ã€ã€Œåž‹ã‚¯ãƒ©ã‚¹ã€ã¨ã„ã†ã®ã¯æœ€æ‚ªãªãƒãƒ¼ãƒŸãƒ³ã‚°ã§ã™ã€‚ã‚ã¾ã‚Šã«ã‚‚ Smalltalk ã®ã‚¯ãƒ©ã‚¹ã¨é•ã„ã™ãŽã‚‹ã‹ã‚‰ã§ã™ã€‚æ©Ÿèƒ½çš„ã«ã¯ traits ã‚„ Java ã®ã‚¤ãƒ³ã‚¿ãƒ•ã‚§ãƒ¼ã‚¹ã‹ã‚‰ç¶™æ‰¿ã‚’é™¤ã„ãŸç‰©ã¨æ€ã£ãŸã‚‰è‰¯ã„ã§ã™ã€‚ã¾ãŸã€ã€Œç¶™æ‰¿ã€ã‚„ã€Œã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹ã€ãªã©ã€Smalltalk ã¨ Haskell ä¸¡æ–¹ã§ä½¿ã‚ã‚Œã‚‹è¨€è‘‰ã¯ã“ã¨ã”ã¨ãåˆ¥ã‚‚ã®ã¨æ€ã£ãŸæ–¹ãŒè‰¯ã„ã§ã™ã€‚ åž‹ã‚¯ãƒ©ã‚¹ã®ä½ç½®ã¥ã‘ Smalltalk ã‚’ã¯ã˜ã‚ã¨ã™ã‚‹ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘è¨€èªžã®æ©Ÿèƒ½ã‚’ãã®ã¾ã¾ Haskell ã§å®Ÿç¾ã—ã‚ˆã†ã¨ã™ã‚‹ã¨æœ€åˆã¯ã™ã”ãæˆ¸æƒ‘ã„ã¾ã™ã€‚æ—¥æœ¬èªž
chuwb 2010/11/06
haskell

smalltalk
ãƒªãƒ³ã‚¯
é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€
2. è‡ªå·±ç´¹ä»‹ â€¢ ç”°ä¸è‹±è¡Œ (@tanakh, id:tanakh) â€¢ TopCoder (id:haskell-master) â€¢ Haskell Loverï¼ˆnot master!ï¼‰ â€¢ ICPC2004-5 ä¸–ç•Œå¤§ä¼š â€¢ Preferred Infrastructureå‹¤å‹™ â€“ ICPC OBå¤šæ•°åœ¨ç± â€“ ã‚¢ãƒ«ãƒã‚¤ãƒˆãƒ»ã‚¤ãƒ³ã‚¿ãƒ¼ãƒ³ç‰ã€ èˆˆå‘³ã®ã‚ã‚‹æ–¹ã¯ã”é€£çµ¡ã‚’ï¼ 3. æœ¬æ—¥ã®å†…å®¹ â€¢ é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€ â€“ å‚ç…§é€æ˜Ž â€“ ã‚¯ãƒãƒ¼ã‚¸ãƒ£ â€“ é…å»¶è©•ä¾¡ â€“ ãƒªã‚¹ãƒˆå‡¦ç† â€“ etcâ€¦ â€¢ é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ã¾ã¤ã‚ã‚‹è©±é¡Œ â€“ æ°¸ç¶šãƒ‡ãƒ¼ã‚¿æ§‹é€ â€“ ä¸¦è¡Œè¨ˆç®— â€“ ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ãƒˆãƒ©ãƒ³ã‚¶ã‚¯ã‚·ãƒ§ãƒŠãƒ«ãƒ¡ãƒ¢ãƒªï¼ˆSTMï¼‰
chuwb 2010/10/04
programming

haskell

functional
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸