[B! Haskell][monad] r-westã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

r-west id:r-west

Haskellã¨monadã«é–¢ã™ã‚‹r-westã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (14)

${{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ã®ãƒ¢ãƒŠãƒ‰å®Œå…¨ã«ç†è§£ã—ãŸã€è©¦é¨“å•é¡Œ
Haskellã¯å‹‰å¼·ã—ãŸã‘ã©ãƒ¢ãƒŠãƒ‰ã‚’æœ¬å½“ã«ç†è§£ã—ãŸã£ã¦è¨€ãˆã‚‹ã®ã‹è‡ªä¿¡ãŒãªã„â€¦ ï¼¼ãã‚“ãªäººå‘ã‘ã®è©¦é¨“å•é¡Œã‚’ä½œã‚Šã¾ã—ãŸï¼ï¼ ã“ã‚Œã‹ã‚‰å®Ÿæ–½ã™ã‚‹è©¦é¨“å•é¡Œã‚’ã€10å•ä¸8å•æ£è§£ã™ã‚Œã°ã‚ãªãŸã¯Haskellã®ãƒ¢ãƒŠãƒ‰ã‚’å®Œå…¨ã«ç†è§£ã—ã¦ã„ã¾ã™ã€‚ç§ãŒä¿è¨¼ã—ã¾ã™ï¼ ãã‚Œã§ã¯ã•ã£ããã€œã€œ ç¬¬ä¸€å• ã¾ãšã¯ç·Šå¼µã‚’ã»ãã—ã¾ã—ã‚‡ã†ã€‚ Haskellã® Monad ã¯â—‹â—‹â—‹â—‹ã§ã‚ã‚‹ â—‹â—‹â—‹â—‹ã«å½“ã¦ã¯ã¾ã‚‹ã®ã¯ä»¥ä¸‹ã®é¸æŠžè‚¢ã®ã†ã¡ã©ã‚Œã§ã—ã‚‡ã†ï¼Ÿ åž‹ é–¢æ•° åž‹ã‚¯ãƒ©ã‚¹ åž‹ã‚·ãƒŽãƒ‹ãƒ ç”ãˆ
r-west 2021/06/14
haskell

monad

ãƒã‚¿

ä»•äº‹
ãƒªãƒ³ã‚¯
CPSã§å®Ÿè£…ã—ãŸãƒ¢ãƒŠãƒ‰ã¯ä½•æ•…é€Ÿã„ã®ã‹ - Mizon Dev Diary
2014-01-20 CPSã§å®Ÿè£…ã—ãŸãƒ¢ãƒŠãƒ‰ã¯ä½•æ•…é€Ÿã„ã®ã‹ãƒ¢ãƒŠãƒ‰å¤‰æ›åã®é€Ÿã•ã‚’æ¸¬ã£ã¦ã¿ã‚‹ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰CPSã§ãƒ¢ãƒŠãƒ‰ã‚’å®Ÿè£…ã™ã‚‹ã¨é€Ÿããªã‚‹ã‚‰ã—ã„ã€‚ä»¥å‰ã€ãã®ç†ç”±ã«ã¤ã„ã¦è€ƒãˆã¦ã¿ãŸã®ã ãŒã€çµè«–ã«é”ã—ãªã‹ã£ãŸã€‚ãã“ã§ã€ç¶šãã‚’æ›¸ãã€‚ã¾ãšã€Twitterã§ã‚ã‚‹æ–¹ã«æ•™ãˆã¦ã„ãŸã ã„ãŸã®ã ãŒã€CPSã§å®Ÿè£…ã—ãŸãƒ¢ãƒŠãƒ‰ã¯ã€éžCPSã§å®Ÿè£…ã—ãŸãƒ¢ãƒŠãƒ‰ã«æ¯”ã¹ã¦æ¬¡ã®2ç‚¹ã®ç†ç”±ã«ã‚ˆã‚Šé«˜é€Ÿã§ã‚ã‚‹ã¨ã„ã†ã€‚ãƒ‡ãƒ¼ã‚¿ã®ç”Ÿæˆ/åˆ†è§£ãŒæŠ‘ãˆã‚‰ã‚Œã‚‹ã‹ã‚‰åˆæˆæ™‚ã«ç¶™ç¶šã‚’ç ´æ£„ã§ãã‚‹ã‹ã‚‰ã©ã†ã„ã†ã“ã¨ãªã®ã ã‚ã†ã‹ã€‚Maybeãƒ¢ãƒŠãƒ‰ã‚’ä¾‹ã¨ã—ã¦ä»¥ä¸Šã®2ç‚¹ã‚’ç¢ºèªã—ãŸã„â€”â€”ã€‚ã¨ã€ç¢ºèªã—ãŸã‹ã£ãŸã®ã ãŒã€æ¤œè¨¼ã—ãŸã¨ã“ã‚ã€1ç‚¹ç›®ã«ã¤ã„ã¦ã¯çµè«–ã‚’å¾—ãŸã‚‚ã®ã®ã€2ç‚¹ç›®ã«ã¤ã„ã¦ã¯ã€Œé€Ÿããªã‚‰ãªã„ã€ã¨ã„ã†çŸ›ç›¾ã—ãŸçµè«–ãŒå‡ºã¦ã—ã¾ã£ãŸã€‚ãã“ã§ã€ä»¥ä¸Šã®1ç‚¹ç›®ã«ã¤ã„ã¦ã®ã¿æ¤œè¨¼ã—ãŸè¨˜éŒ²ã‚’ã¤ã‘ã‚‹ã€‚éžCPSç‰ˆMaybeãƒ¢ãƒŠãƒ‰ã¾ãšã€éžCPSç‰ˆã®Maybeãƒ¢ãƒŠãƒ‰ã®å®šç¾©ã¯ä»¥ä¸‹
r-west 2014/01/21
CPS

haskell

monad

continuation

programming
ãƒªãƒ³ã‚¯
Idrisã®ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« - ã‚ã‚€ãƒã‚°
r-west 2013/08/24
monad

haskell

language

ä¾å˜åž‹

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Idris: A Language for Type-Driven Development
Idris: A Language for Type-Driven Development Idris is a programming language designed to encourage Type-Driven Development. In type-driven development, types are tools for constructing programs. We treat the type as the plan for a program, and use the compiler and type checker as our assistant, guiding us to a complete program that satisfies the type. The more expressive the type is that we give
r-west 2013/08/24
monad

haskell

language

ä¾å˜åž‹

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Extensible Effects ã¯ãƒ¢ãƒŠãƒ‰å¤‰æ›åã«å¯¾ã™ã‚‹æ•‘ä¸–ä¸»ã«ãªã‚Šå¾—ã‚‹ã‹ï¼Ÿ
Extensible Effects ã¯ãƒ¢ãƒŠãƒ‰å¤‰æ›åã«å¯¾ã™ã‚‹æ•‘ä¸–ä¸»ã«ãªã‚Šå¾—ã‚‹ã‹ï¼Ÿ konn-san.com Oleg, Sabry and Swords ã‚‰ã«ã‚ˆã‚‹ Extensible Effects: An Alternative to Monad Transf ormers ã®è«–æ–‡ã‚’èªã‚“ã ãƒ¡ãƒ¢çš„ãªä½•ã‹ã§ã™ã€‚ãƒ¢ãƒŠãƒ‰å¤‰æ›åã«é–¢ã™ã‚‹ç°¡å˜ãªç¾çŠ¶ç¢ºèªã‹ã‚‰å…¥ã£ã¦ã¯ã„ã¾ã™ãŒã€æƒ³å®šèªè€…å±¤ã¯æ—¥å¸¸çš„ã«ãƒ¢ãƒŠãƒ‰ã‚„ãƒ¢ãƒŠãƒ‰å¤‰æ›åã‚’ç”¨ã„ãŸãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ã„ã¦ã„ã‚‹äººé”ã§ã™ã€‚ ã©ã¡ã‚‰ã‹ã¨ã„ã†ã¨è‡ªåˆ†å‘ã‘ã®ãƒ¡ãƒ¢ã®æ€§æ ¼ãŒå¼·ã„ã®ã§ã€è©³ã—ã„éƒ¨åˆ†ã¯è«–æ–‡ã‚’å‚ç…§ã—ã¦ã¿ã¦ãã ã•ã„ã€‚ èƒŒæ™¯ï¼šãƒ¢ãƒŠãƒ‰å¤‰æ›åã¨ãã®å•é¡Œ Haskell ã‚’ä¸å¿ƒã«ã€é–¢æ•°åž‹è¨€èªžã§ã¯å‰¯ä½œç”¨ã®ã‚ã‚‹å‡½æ•°ã‚’åˆæˆã™ã‚‹ãŸã‚ã®æ‰‹æ®µã¨ã—ã¦ãƒ¢ãƒŠãƒ‰ãŒåºƒãç”¨ã„ã‚‰ã‚Œã¦ã„ã‚‹ã€‚ãƒ¢ãƒŠãƒ‰ã¯éžå¸¸ã«å¼·åŠ›ãªæŠ½è±¡åŒ–ã§ã€ãŠã‚ˆãå‰¯ä½œç”¨ã¨å‘¼ã¹ã‚‹ã‚‚ã®ã¯ãƒ¢ãƒŠãƒ‰ã‚’ä½¿ã£ã¦å®šå¼åŒ–ã™ã‚‹ã“ã¨ãŒå‡ºæ¥ãŸã€‚ä¾‹ãˆã°ã€å¤§åŸŸçš„ãªç’°å¢ƒ r ã‚’
r-west 2013/07/22
haskell

monad

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Functors, Applicatives, And Monads In Pictures - adit.io
Written April 17, 2013 updated: May 20, 2013 Here's a simple value: And we know how to apply a function to this value: Simple enough. Lets extend this by saying that any value can be in a context. For now you can think of a context as a box that you can put a value in: Now when you apply a function to this value, you'll get different results depending on the context. This is the idea that Functors
r-west 2013/04/22
haskell

functional

functor

monad

å¾Œã§èªã‚€

æ•™è‚²
ãƒªãƒ³ã‚¯
Free Monadã‚’ä½¿ã£ã¦ã¿ã‚ˆã†ï¼ - Just $ A sandbox
ç¶šç·¨ï¼šFree Monadã‚’ä½¿ã£ã¦ã¿ã‚ˆã†ï¼(2) - ã¿ã‚‡ã‚“ã•ã‚“ã®ã€‚ Haskellæ¥½ã—ã„ã§ã™ã€‚ Haskellã¯ç´”ç²‹ãªã®ã§ã¨ã¦ã‚‚å¤§å¥½ãã§ã™ã€‚ ãŸã ã€Haskellã§ã¯å‰¯ä½œç”¨ã®ã‚ã‚‹ã‚ˆã†ã«è¦‹ãˆã‚‹(æ‰‹ç¶šãã£ã½ã„)æ›¸ãæ–¹ã‚’ã—ãŸããªã‚‹æ™‚ãŒã©ã†ã—ã¦ã‚‚ã‚ã‚Šã¾ã™ã®ã§ã€ãã†ã„ã†ã¨ã“ã‚ã§ã¯æ‰‹ç¶šãã£ã½ã„æ›¸ãæ–¹ã‚’ã™ã‚‹ã“ã¨ã«ãªã‚Šã¾ã™ã€‚ ã¤ã¾ã‚Šã€ A = do m <- BBB runSth m ã®ã‚ˆã†ãªã‚³ãƒ¼ãƒ‰ã‚’ã€ç‰¹ã«ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ãŒã—ã£ã‹ã‚Šã—ãŸå¤§è¦æ¨¡ãªãƒ—ãƒã‚°ãƒ©ãƒ ã§ã¯ã—ã‚‡ã£ã¡ã‚…ã†è¦‹ã‚‹ã“ã¨ã«ãªã‚‹ã¨æ€ã„ã¾ã™ã€‚ ã¯ã£ãã‚Šè¨€ã„ã¾ã™ãŒã€ç§ã¯ã“ã‚ŒãŒå«Œã„ã§ã™ã€‚ Haskell-likeã˜ã‚ƒãªã„ï¼ ãªã®ã§ã€ã‚‚ã£ã¨Haskell-likeãªæ›¸ãæ–¹ã‚’ã—ãŸã„ã§ã™*1ã€‚ ã¯ã„ã€ã•ã¦æœ¬é¡Œã§ã™ã€‚ Free Monadã‚’ä½¿ã„ã¾ã—ã‚‡ã†ã€‚ Free Monadãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã®ä¸ã§ã¯Freeã¨ã„ã†ãã®ã¾ã¾ã®åå‰ã®ãƒ‡ãƒ¼ã‚¿ãŒã‚ã£ã¦ã€ data Free f
r-west 2012/12/08
monad

Haskell
ãƒªãƒ³ã‚¯
ãã‚ãã‚Freeãƒ¢ãƒŠãƒ‰ã«é–¢ã—ã¦ä¸€è¨€ã„ã£ã¨ãã‹ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
Freeãƒ¢ãƒŠãƒ‰ã¯ã™ã”ã„ã€‚ Haskellã‚’æ›¸ã„ã¦ã„ã¦ã€ã€Œç‰¹æ®ŠåŒ–ã•ã‚ŒãŸå‡¦ç†ã‚’è¨˜è¿°ã™ã‚‹ãƒ¢ãƒŠãƒ‰ãŒç°¡å˜ã«ä½œã‚ŒãŸã‚‰ä¾¿åˆ©ã ã‚ã†ãªãƒ¼ã€ã¨æ€ã£ãŸã“ã¨ã¯ãªã„ã ã‚ã†ã‹ï¼Ÿç°¡å˜ã«ä½œã‚Œã‚‹ã®ã§ã‚ã‚‹ã€ãã†ã€Haskellãªã‚‰ãã€‚ ã“ã‚ŒãŒã€ç´”ç²‹ãªFreeãƒ¢ãƒŠãƒ‰ã®å®šç¾©ã§ã‚ã‚‹ã€‚ data Free f a = Pure a | Free (f (Free f a)) instance Functor f => Monad (Free f) where return = Pure Pure a >>= k = k a Free fm >>= k = Free (fmap (>>=k) fm) (Functorã€Applicativeã®ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹å®£è¨€ã¯è‡ªæ˜Žãªã®ã§çœç•¥) ä¸Žãˆã‚‰ã‚ŒãŸFunctorã‚’ãŠäº’ã„ã«åŸ‹ã‚è¾¼ã¿åˆã£ã¦ã„ã‚‹ã€ã¨ã„ã†æ¼ ç„¶ã¨ã—ãŸå°è±¡ã§ã€ä½•ãŒå¬‰ã—ã„ã®ã‹ã‚ˆãã‚ã‹ã‚‰ãªã„ã‹ã‚‚ã—ã‚Œãªã„ã€‚ã ãŒã€ã“ã®å˜ç´”ã•ã“ãFreeãƒ¢ãƒŠãƒ‰ã®ä¾¿åˆ©
r-west 2012/11/11
å¾Œã§èªã‚€

programming

haskell

monad
ãƒªãƒ³ã‚¯
Why free monads matter
Interpreters Good programmers decompose data from the interpreter that processes that data. Compilers exemplify this approach, where they will typically represent the source code as an abstract syntax tree, and then pass that tree to one of many possible interpreters. We benefit from decoupling the interpreter and the syntax tree, because then we can interpret the syntax tree in multiple ways. For
r-west 2012/10/07
haskell

monad

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

haskell
ãƒªãƒ³ã‚¯
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 ã‚³ãƒ³ãƒ†
r-west 2011/09/28
Haskell

monad

programming
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŠãƒ‰ã®ãŸã‚ã®åœè«–å…¥é–€ - é‡ã®ä¸Šã§processã¯å¹¾ã¤è¸Šã‚Œã‚‹ã‹ï¼Ÿ
ã€Œãƒ¢ãƒŠãƒ‰ã¯è‡ªå·±é–¢æ‰‹åœã®ãƒ¢ãƒŽã‚¤ãƒ‰å¯¾è±¡ã«ã™ãŽãªã„ã€ã¨ãƒ¯ãƒ‰ãƒ©ãƒ¼ã¯ã„ã£ãŸãŒãã®äº‹ã‚’èª¬æ˜Žã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ æ¬¡ã®ã‚‚ã®ã‚’èª¬æ˜Žã—ã¾ã™ã€‚ å¯¾è±¡ å°„ çµåˆå‰‡ æ’ç‰å°„ åœ é–¢æ‰‹ è‡ªç„¶å¤‰æ› åœã®åŸºç¤Ž åœã¯ä»¥ä¸‹ã®ã‚‚ã®ã‹ã‚‰æ§‹æˆã•ã‚Œã¾ã™ å°„ å¯¾è±¡ å°„ã¯ã‚½ãƒ¼ã‚¹ã¨ã‚¿ãƒ¼ã‚²ãƒƒãƒˆã‚’çµã¶çŸ¢å°ã¨ã•ã‚Œã¾ã™ XãŒã‚½ãƒ¼ã‚¹YãŒã‚¿ãƒ¼ã‚²ãƒƒãƒˆã®ç¤¾ã¯æ¬¡ã®é€šã‚Šã«è¨˜è¿°ã•ã‚Œã¾ã™ã€‚ å°„ã®çµåˆ ã®äºŒã¤ã®å°„ãŒå˜åœ¨ã—ãŸå ´åˆçµåˆã™ã‚‹äº‹ãŒã§ãã¾ã™ ã•ã‚‰ã«ä»¥ä¸‹ã®å…¬ç†ã‚’æº€ãŸã™å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ æ’ç‰å°„ çµåˆå‰‡ æ’ç‰å°„ ä»»æ„ã®å¯¾è±¡Xã«å¯¾ã—ã¦å°„ ãŒå˜åœ¨ã—æ’ç‰å°„ã¨ã„ã†ã€ã•ã‚‰ã«ä»»æ„ã®å°„ã«å¯¾ã—ã¦ ãŒæˆã‚Šç«‹ã¤ã€‚ çµåˆå‰‡ ãŒæˆã‚Šç«‹ã¡ã“ã‚Œã‚’çµåˆå‰‡ã¨ã„ã†ã€‚ é–¢æ‰‹ åœCã¨åœGãŒå˜åœ¨ã—ãŸã¨ã—ã¦ã€ Cã‹ã‚‰Gã«å¯¾ã—ã¦ å¯¾è±¡ å°„ ã‚’å¯¾å¿œã•ã›ã‚‹ã‚‚ã®ã§ã‚ã‚‹ã€‚ã“ã®æ™‚é–¢æ‰‹ã¯ä»¥ä¸‹ã®æ€§è³ªã‚’ä¿ã£ã¦ã„ãªã‘ã°ãªã‚‰ãªã„ã€‚ æ’ç‰å°„ å°„ã®åˆæˆ è‡ªç„¶å¤‰æ› åœCã¨åœDã®é–“ã«ã€Fã€Gã¨ã„ã†é–¢æ‰‹ãŒå˜åœ¨ã—ã€ Fã‹ã‚‰Gã¸ç§»ã™å°„ ãŒå˜
r-west 2011/07/24
ç°¡æ½”ã§ãƒ”ãƒ³ãƒã‚¤ãƒ³ãƒˆã§åŠ©ã‹ã‚‹ã€‚å¾Œã«ç¶šãã‚¨ãƒ³ãƒˆãƒªã‚‚ã€‚

haskell

monad

åœè«–

å¾Œã§èªã‚€

å¾Œã§æ›¸ã
ãƒªãƒ³ã‚¯
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
r-west 2010/05/23
ã€ŒFunctor, Monad, Monoid, Applicative, Foldable, Traversable, Arrow ã¨ã„ã£ãŸã‚ˆã†ãªåž‹ã‚¯ãƒ©ã‚¹ã€ã®ã¾ã¨ã‚

haskell

programming

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
å‚ç…§é€æ˜Žãª malloc ã¯å¯èƒ½ã‹ (ã‚ã‚‹ã„ã¯ IO ãƒ¢ãƒŠãƒ‰ã«ã¤ã„ã¦) @ val it: Î± â†’ Î± = fun
This entry was posted by Jun Mukai on Friday, 6 November, 2009 alohakun ãŒæ¬¡ã®ã‚ˆã†ãªã“ã¨ã‚’æ›¸ã„ã¦ã„ãŸã®ãŒé¢ç™½ã‹ã£ãŸã®ã§ã€ä»Šæ—¥ã¡ã‚‡ã£ã¨å¸°å®…é€”ä¸ã«ã¤ã‚‰ã¤ã‚‰è€ƒãˆãŸã‚“ã ã‘ã©ã€twitterã§ã¤ã¶ã‚„ãã«ã¯é•·ã™ãŽã‚‹ã®ã§ã¡ã‚‡ã£ã¨æ›¸ã„ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¾ã™ã€‚ malloc() ã£ã¦å‰¯ä½œç”¨ã‚ã‚‹ã® ? ã‚‚ã¡ã‚ã‚“å†…éƒ¨çš„ã«ã¯ã‚ã‚‹ã ã‚ã†ã‘ã©ã€å¤–éƒ¨çš„ãªæŒ¯ã‚‹èˆžã„ã ã‘ã‚’è¦‹ã‚‹ã¨ã€æœ‰åŠ¹ãªãƒ¡ãƒ¢ãƒªãƒªãƒ¼ã‚¸ãƒ§ãƒ³ã®å…ˆé ã‚¢ãƒ‰ãƒ¬ã‚¹ãŒè¿”ã£ã¦ãã‚‹ã ã‘ã ã‹ã‚‰ã€è¦³æ¸¬ã§ããªã„ã¨æ€ã†ã‚“ã ã‘ã©ã€‚ (http://twitter.com/alohakun/status/5433639881) Haskell ã§ä¹±æ•°ä½œã‚‹ã¨ãã£ã¦ã©ã†ã‚„ã£ã¦å‚ç…§é€æ˜Žã«ã—ã¦ã‚‹ã‚“ã ? ä¹±æ•°ã‚’ç›´æŽ¥ä½œã‚‹é–¢æ•°ã¯ç„¡ãã¦ã€ã‚·ãƒ¼ãƒ‰ã‚’å…ƒã«ã€ä¹±æ•°ã®ç„¡é™ãƒªã‚¹ãƒˆã‚’ä½œã‚‹ã¨ã‹ãªã®ã‹ãªã€‚ãªã‚‰ã°ã€ç¢ºä¿å¯èƒ½ã‚¢ãƒ‰ãƒ¬ã‚¹ã®ç„¡é™ãƒªã‚¹ãƒˆã‚’ä½œã‚Œã°ã€å‰¯ä½œ
r-west 2009/11/06
ã‚ˆãã‚ã‹ã‚‹IOãƒ¢ãƒŠãƒ‰ã®èª¬æ˜Žã€‚IO aã¯ã€ã€Œä¸–ç•Œã€ã‚’ä¸Žãˆã‚‰ã‚ŒãŸã‚‰aåž‹ã®å€¤ã¨ã€Œãã®å¾Œã®ä¸–ç•Œã€ã‚’è¿”ã™é–¢æ•°å€¤ã€‚

haskell

monad

functional
ãƒªãƒ³ã‚¯
1