[B! monad] oanusã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

oanus id:oanus

monadã«é–¢ã™ã‚‹oanusã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (9)

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

ãƒ¢ãƒŠãƒ‰ã¨ãƒ¢ãƒŠãƒ‰å¤‰æ›åã®ã‚¤ãƒ¡ãƒ¼ã‚¸ã‚’æã„ã¦ã¿ãŸ - melponæ—¥è¨˜ - Haskellã‚‚C++ã‚‚ã¾ã¨ã‚‚ã«æ‰±ãˆãªã„ã¸ãŸã‚Œã®ãƒšãƒ¼ã‚¸
æœ€åˆã«è¨€ã£ã¦ãŠãã¨ã€ãƒ¢ãƒŠãƒ‰ã£ã¦ä½•ãªã®ï¼Ÿã£ã¦ã„ã†ç”ãˆã¯ä¸€åˆ‡ãªã„ã§ã™ã€‚ è‡ªåˆ†ã«ã¨ã£ã¦ãƒ¢ãƒŠãƒ‰ã¯ã€Œã¨ã‚Šã‚ãˆãšåž‹ã•ãˆåˆã‚ã›ã¦ãŠã‘ã°ä½•ã‹ã„ã‚ã„ã‚ã—ã¦ãã‚Œã‚‹å¥´ã€ç¨‹åº¦ã¨ã—ã‹èªè˜ã§ãã¦ã„ãªã„ã®ã§ã€ãã‚“ãªèª¬æ˜Žã§ããªã„ã§ã™ã€‚ ã§ã€ãã‚“ãªè‡ªåˆ†ãŒè„³å†…ã§ã©ã†ã„ã†é¢¨ã«ã‚¤ãƒ¡ãƒ¼ã‚¸ã—ã¦ãƒ¢ãƒŠãƒ‰ã‚„ãƒ¢ãƒŠãƒ‰å¤‰æ›åã®æ··ã–ã£ãŸã‚³ãƒ¼ãƒ‰ã‚’æ›¸ã„ã¦ã„ã‚‹ã‹ã¨ã„ã†ã®ã‚’å›³ã«è¡¨ã—ã¦ã¿ã¾ã—ãŸã€‚ ã“ã“ã‚‰è¾ºã®è©±ã‚’å›³ã«ã—ãŸæ„Ÿã˜ã§ã™ã€‚ ãƒ¢ãƒŠãƒ‰ã‚’è§¦ã£ã¦ã¿ãŸ - melponæ—¥è¨˜ - Haskellã‚‚C++ã‚‚ã¾ã¨ã‚‚ã«æ‰±ãˆãªã„ã¸ãŸã‚Œã®ãƒšãƒ¼ã‚¸ ãƒ¢ãƒŠãƒ‰ ãƒ¢ãƒŠãƒ‰ã«ã¯ return é–¢æ•°ã¨ >>= é–¢æ•°ãŒã‚ã‚Šã¾ã™ã€‚ ã“ã‚“ãªã‚¤ãƒ¡ãƒ¼ã‚¸ã§ã™ã€‚ä¸‹å´ã®ç·šãŒæ™®é€šã®é–¢æ•°åž‹ã®ä¸–ç•Œã€ä¸Šå´ã®ç·šãŒãƒ¢ãƒŠãƒ‰ã®ä¸–ç•Œã§ã™ã€‚ ã©ã¡ã‚‰ã‚‚ãƒ¢ãƒŠãƒ‰å´ã®å‡ºåŠ›ã—ã‹ç„¡ã„ã®ã§ã€ã©ã¡ã‚‰ã‹ã®é–¢æ•°ã‚’ä½¿ã£ãŸã‚‰ã€ãƒ¢ãƒŠãƒ‰ã‹ã‚‰è„±å‡ºã™ã‚‹ã“ã¨ã¯ã§ãã¾ã›ã‚“ã€‚ ãŸã ã€>>= é–¢æ•°ã®å³å´ãŒç‚¹ç·šã®ç®±ã«ãªã£ã¦ã„ã‚‹ã“ã¨ãŒåˆ†ã‹ã‚‹ã§ã—ã‚‡ã†ã‹ã€‚ ã“ã“ã«ã¯ã€å¤ª
oanus 2011/10/28
haskell

functional.*

programming

monad
ãƒªãƒ³ã‚¯
Monads are Trees with Grafting
Monads are Trees with Grafting Dan Piponi A Neighborhood of Inï¬nity January 1, 2010 1 Goals and Prerequisites This article is intended to give an elementary introduction to an aspect of mon- ads not covered in most introductions. The reader is expected to know some basics of Haskell, for example what a type class is and what a lambda term is. They are also expected to be familiar with the usual n
oanus 2010/01/06
https://dl.dropbox.com/u/360784/Monads.ja/monads.ja.pdf

pdf

monad
ãƒªãƒ³ã‚¯
Generalising Monads to Arrows
UtbildningForskningSamarbeta med ossOm ChalmersAktuelltInstitutioner InstitutionenData- och informationsteknikVi bedriver forskning och utbildning inom AI, cybersÃ¤kerhet, interaktionsdesign, software engineering, computing science och datateknik - frÃ¥n grundforskning till direkta tillÃ¤mpningar. Vi utbildar fÃ¶r framtiden och bedriver forskning nÃ¤ra nÃ¤ringslivet, organisationer och akademin fÃ¶r att
oanus 2009/09/20
pdf

category_theory

functional.*

programming

computing

monad
ãƒªãƒ³ã‚¯
æ±ã®éš£äººã®ãƒ–ãƒã‚°ã‚’æ„›ã›ã‚ˆ | LOVELOG
au one netã®ãƒ–ãƒã‚°ã‚µãƒ¼ãƒ“ã‚¹ ã€ŽLOVELOGã€ã¯2014å¹´6æœˆ30æ—¥ã‚’ã‚‚ã¡ã¾ã—ã¦æä¾›ã‚’çµ‚äº†è‡´ã—ã¾ã—ãŸã€‚ æ°¸ã‚‰ãã®ã”åˆ©ç”¨ã€èª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã—ãŸã€‚ å¼•ãç¶šãau one netã‚’ã”æ„›é¡§ã„ãŸã ãã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚ â€»ãŠæ‰‹æ•°ã§ã¯ã”ã–ã„ã¾ã™ãŒã€æ–°ãƒ–ãƒã‚°ã«ã¦é–²è¦§ã®çš†ã•ã¾å‘ã‘ã«ãƒ–ãƒã‚°URLå¤‰æ›´ç‰ã‚’ã”å‘¨çŸ¥ã„ãŸã ã‘ã¾ã™ã‚ˆã†ã€ãŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚
oanus 2008/12/30
monad

haskell
ãƒªãƒ³ã‚¯
æ±ã®éš£äººã®ãƒ–ãƒã‚°ã‚’æ„›ã›ã‚ˆ | LOVELOG
au one netã®ãƒ–ãƒã‚°ã‚µãƒ¼ãƒ“ã‚¹ ã€ŽLOVELOGã€ã¯2014å¹´6æœˆ30æ—¥ã‚’ã‚‚ã¡ã¾ã—ã¦æä¾›ã‚’çµ‚äº†è‡´ã—ã¾ã—ãŸã€‚ æ°¸ã‚‰ãã®ã”åˆ©ç”¨ã€èª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã—ãŸã€‚ å¼•ãç¶šãau one netã‚’ã”æ„›é¡§ã„ãŸã ãã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚ â€»ãŠæ‰‹æ•°ã§ã¯ã”ã–ã„ã¾ã™ãŒã€æ–°ãƒ–ãƒã‚°ã«ã¦é–²è¦§ã®çš†ã•ã¾å‘ã‘ã«ãƒ–ãƒã‚°URLå¤‰æ›´ç‰ã‚’ã”å‘¨çŸ¥ã„ãŸã ã‘ã¾ã™ã‚ˆã†ã€ãŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚
oanus 2008/12/30
monad

haskell
ãƒªãƒ³ã‚¯
æ±ã®éš£äººã®ãƒ–ãƒã‚°ã‚’æ„›ã›ã‚ˆ | LOVELOG
au one netã®ãƒ–ãƒã‚°ã‚µãƒ¼ãƒ“ã‚¹ ã€ŽLOVELOGã€ã¯2014å¹´6æœˆ30æ—¥ã‚’ã‚‚ã¡ã¾ã—ã¦æä¾›ã‚’çµ‚äº†è‡´ã—ã¾ã—ãŸã€‚ æ°¸ã‚‰ãã®ã”åˆ©ç”¨ã€èª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã—ãŸã€‚ å¼•ãç¶šãau one netã‚’ã”æ„›é¡§ã„ãŸã ãã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚ â€»ãŠæ‰‹æ•°ã§ã¯ã”ã–ã„ã¾ã™ãŒã€æ–°ãƒ–ãƒã‚°ã«ã¦é–²è¦§ã®çš†ã•ã¾å‘ã‘ã«ãƒ–ãƒã‚°URLå¤‰æ›´ç‰ã‚’ã”å‘¨çŸ¥ã„ãŸã ã‘ã¾ã™ã‚ˆã†ã€ãŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚
oanus 2008/12/30
monad

haskell
ãƒªãƒ³ã‚¯
æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ - ä¸–ç•Œã§ä¸€ç•ªã‹äºŒç•ªãã‚‰ã„ã«ã‚„ã•ã—ã„ã€Œãƒ¢ãƒŠãƒ‰å…¥é–€ã€
æ°—ã¾ãã‚Œã¨å¶ç„¶ã¨ãªã‚Šã‚†ãã§ã€ã“ã“2,3å›žã¯ãƒ¢ãƒŠãƒ‰ã‚’è©±é¡Œã«ã—ã¾ã—ãŸã€‚googleã§ã€Œãƒ¢ãƒŠãƒ‰ã€ã‚’å¼•ã„ã¦ã‚¶ãƒƒã¨çœºã‚ã‚‹ã¨ã€ã€Œãƒ¢ãƒŠãƒ‰ã¯ã‚€ãšã‹ã—ã„ãƒ¼ã€ã¨ã‹ã€Œãƒ¢ãƒŠãƒ‰ã§æŒ«æŠ˜ã—ãŸã€ã¿ãŸã„ãªé›°å›²æ°—ãŒæ„Ÿã˜ã‚‰ã‚Œã¦ã€èª¬æ˜ŽèŠ¸äººã®è¡€ãŒå°‘ã—é¨’ãŽã¾ã—ãŸãã€‚ã€Œãªã‚‰ã€äºˆå‚™çŸ¥è˜ã‚¼ãƒã§ãƒ¢ãƒŠãƒ‰ã®èª¬æ˜Žã‚’ã—ã¦ã‚„ã‚ã†ã˜ã‚ƒããƒ¼ã‹ã€ã¨ã€‚ ã‚¿ã‚¤ãƒˆãƒ«ã¯ã ã„ã¶ç…½ã£ã¡ã‚ƒã£ãŸâ€¦â€¦ ã‘ã©ã€ãƒãƒƒã‚¿ãƒªã˜ã‚ƒãªã„ã¤ã‚‚ã‚Šâ€¦â€¦ ã‘ã©ã€å®Ÿéš›ã¯ã©ã†ã‹ãªï¼Ÿ â€»å°åˆ·ã®ã¨ãã¯ã‚µã‚¤ãƒ‰ãƒãƒ¼ãŒæ¶ˆãˆã¾ã™ã€‚ å†…å®¹ï¼š ã¨ã‚Šã‚ãˆãšã€ã‚ãŸã‚Šã•ã‚ã‚Šãªããƒ¢ãƒŠãƒ‰ã®æ¥æ´ã‚’ç´¹ä»‹ã™ã‚‹ ã“ã‚“ãªèª²é¡Œã‚’è€ƒãˆã¦ã¿ã‚ˆã†ï¼šå‰¯ä½œç”¨ä»˜ãè¨ˆç®— ã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã™ã‚‹é–¢æ•°é” ã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã—ãŸã„æ„å¿—ã‚’æˆ»ã‚Šå€¤ã§ä¼ãˆã‚‹ ãã‚Œã§ã¯ã€ã„ã£ãŸã„èª°ãŒã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã‚’ã™ã‚‹ã®ã é–¢æ•°ã®å¼•æ•°ã®åž‹ã‚’Countupåž‹ã«ã¾ã§æ‹¡å¼µã™ã‚‹ ãã—ã¦ã€ã“ã‚ŒãŒãƒ¢ãƒŠãƒ‰ã ã¨ã‚Šã‚ãˆãšã€ã‚ãŸã‚Šã•ã‚ã‚Šãªããƒ¢ãƒŠãƒ‰ã®æ¥æ´ã‚’ç´¹ä»‹ã™ã‚‹ ä»Šã‹ã‚‰ã“ã“ã§èª¬æ˜Žã™ã‚‹ã€Œãƒ¢ãƒŠãƒ‰ï¼ˆmonadï¼‰
oanus 2008/12/30
monad

haskell
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŠãƒ‰ã®ã™ã¹ã¦ - Enjoy Programming
ãƒ¢ãƒŠãƒ‰ã®ã™ã¹ã¦ã‚’èªã‚“ã§ã„ãã¾ã™ã€‚ ç¬¬ I éƒ¨ï¼šãƒ¢ãƒŠãƒ‰ã‚’ç†è§£ã™ã‚‹ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ ãƒ¢ãƒŠãƒ‰ã¨ã¯ä½•ã‹ ãªãœãƒ¢ãƒŠãƒ‰ã‚’ç†è§£ã—ã‚ˆã†ã¨ã™ã‚‹ã®ã‹ ãƒ¢ãƒŠãƒ‰ã«è§¦ã‚Œã‚‹ åž‹æ§‹ç¯‰å Maybe ã¨ã„ã†ãƒ¢ãƒŠãƒ‰ ä¾‹ ãƒªã‚¹ãƒˆã‚‚ãƒ¢ãƒŠãƒ‰ è¦ç´„ class ã§ä½¿ã† Haskell ã®åž‹ã‚¯ãƒ©ã‚¹ Monad ã‚¯ãƒ©ã‚¹ ä¾‹ã®ã¤ã¥ã do è¨˜æ³• è¦ç´„ ãƒ¢ãƒŠãƒ‰å‰‡ ä¸‰ã¤ã®åŸºæœ¬å‰‡ å¤±æ•—ã¯ä»˜ã‘ãŸã— å‡ºå£ã¯ãªã„ Zero ã¨ Plus è¦ç´„ ç·´ç¿’å•é¡Œ do è¨˜æ³• ãƒ¢ãƒŠãƒ‰å€¤ã®åˆæˆ List ãƒ¢ãƒŠãƒ‰ã‚’ä½¿ã† ãƒ¢ãƒŠãƒ‰ã‚¯ãƒ©ã‚¹åˆ¶ç´„ã‚’ä½¿ã† Haskell ã«ãŠã‘ã‚‹ãƒ¢ãƒŠãƒ‰ã®ã‚µãƒãƒ¼ãƒˆ æ¨™æº–ãƒ—ãƒ¬ãƒªãƒ¥ãƒ¼ãƒ‰ã§ã¯ Monadã‚¯ãƒ©ã‚¹ ç›´åˆ—åŒ–é–¢æ•° å†™åƒé–¢æ•° é€†æ–¹å‘æŸç¸›é–¢æ•° Monad ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã§ã¯ MonadPlus ã‚¯ãƒ©ã‚¹ ãƒªã‚¹ãƒˆé–¢æ•°ã®ãƒ¢ãƒŠãƒ‰ç‰ˆ foldM filterM zipWithM æ¡ä»¶å¼ã®ãƒ¢ãƒŠãƒ‰è¨ˆç®— ap ãŠã‚ˆã³ãƒªãƒ•ãƒˆé–¢æ•° ap allCombination
oanus 2008/12/30
monad

haskell
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŠãƒ‰ã®ã™ã¹ã¦ã€€Haskell ã«ãŠã‘ã‚‹ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…æ‹¬çš„ã‚¬ã‚¤ãƒ‰
ãƒ¢ãƒŠãƒ‰ã®ã™ã¹ã¦ Haskell ã«ãŠã‘ã‚‹ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…æ‹¬çš„ã‚¬ã‚¤ãƒ‰ Version 1.1.0 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚å¿µã¨ãã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹å¿œç”¨ã« ã¤ã„ã¦ã€åˆä¸ç´šã® Haskell ãƒ—ãƒã‚°ãƒ©ãƒžã«ã‚ã‹ã‚Šã‚„ã™ãã€åˆ©ç”¨ä¾¡å€¤ãŒã‚ã‚‹ã‚ˆã†ãª è§£èª¬ã‚’ã™ã‚‹ã“ã¨ã‚’æ—¨ã¨ã—ã¦ã„ã¾ã™ã€‚èªè€…ã¯ Haskell ã«ãªã‚Œã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ ã—ã¾ã™ãŒã€ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹çµŒé¨“ã¯è¦æ±‚ã—ã¦ã„ã¾ã›ã‚“ã€‚ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€å¤š ãã®é¡Œæã‚’ã‚«ãƒãƒ¼ã—ã¦ã„ã¾ã™ã€‚å¾ŒåŠã®ã‚»ã‚¯ã‚·ãƒ§ãƒ³ã§ã¯ã€å‰åŠã®é¡Œæã‚’ã‚ˆãç†è§£ã— ã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ã—ã¾ã™ã€‚é †ã‚’ãŠã£ã¦ã€ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’ä¾‹ç¤ºã™ã‚‹ãŸã‚ ã®ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ãŒãŸãã•ã‚“ç”¨æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚ä¸€èªã§ã€ã™ã¹ã¦ã®é¡Œæã‚’å¸åŽã— ã‚ˆã†ã¨ã„ã†ã®ã¯ãŠå‹§ã‚ã§ãã¾ã›ã‚“ã€‚ ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ 3 ã¤ã®éƒ¨åˆ†ã§æ§‹æˆã•ã‚Œã¦ã„ã¾ã™ã€‚æœ€åˆã®éƒ¨åˆ†ã¯ã€ é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹ãƒ¢ãƒŠãƒ‰ã®åŸºæœ¬çš„
oanus 2008/12/30
monad

haskell
ãƒªãƒ³ã‚¯
1