Brian Beckman: Don't fear the Monad
Cross posted from msdn's channel 9. Functional programming is increasing in popularity these days given the inherent problems with shared mutable state that is rife in the imperative world. As we march on to a world of multi and many-core chipsets, software engineering must evolve to better equip software engineers with the tools to exploit the vast power of multiple core processors as it won't c
モナドã¯ãƒ¡ã‚¿ãƒ•ã‚¡ãƒ¼ã§ã¯ãªã„ · eed3si9n
2011-05-28 Scalaç•Œã®é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ä¸€æ´¾ã‚’代表ã™ã‚‹è«–客ã®ä¸€äººã€@djspiewak ㌠2010å¹´ã«æ›¸ã„㟠“Monads Are Not Metaphors†を翻訳ã—ã¾ã—ãŸã€‚翻訳ã®å…¬é–‹ã¯æœ¬äººã‚ˆã‚Šè¨±è«¾æ¸ˆã¿ã§ã™ã€‚翻訳ã®é–“é•ã„ç‰ãŒã‚ã‚Œã°é æ…®ãªãã”指摘ãã ã•ã„。 2010å¹´12月27æ—¥ Daniel Spiewak è‘— 2011å¹´5月29æ—¥ e.e d3si9n 訳 僕ã¯ä»Šã€ç´„æŸã‚’ç ´ã‚‹ã¨ã“ã‚ã 。ãŠã‚ˆã三年å‰ã€åƒ•ã¯çµ¶å¯¾ã«ãƒ¢ãƒŠãƒ‰ã®è¨˜äº‹ã ã‘ã¯æ›¸ã‹ãªã„ã¨è‡ªåˆ†ã«ç´„æŸã—ãŸã€‚æ—¢ã«ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹è¨˜äº‹ã¯æœ‰ã‚Šä½™ã£ã¦ã„る。記事ã®æ•°ãŒå¤šã™ãŽã¦ãã®å¤šã•ã ã‘ã§å¤šãã®äººã¯æ··ä¹±ã—ã¦ã„る。ã—ã‹ã‚‚全員ãŒãƒ¢ãƒŠãƒ‰ã«å¯¾ã—ã¦ç•°ãªã‚‹æ‰±ã„方をã—ã¦ã„ã‚‹ãŸã‚ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚念をåˆã‚ã¦å¦ã¼ã†ã¨ã™ã‚‹è€…ã¯ã€ãƒ–リトーã€å®‡å®™æœã€è±¡ã€ç ‚æ¼ ã®ãƒ™ãƒ‰ã‚¦ã‚£ãƒ³ (訳注: アラブ系éŠç‰§æ°‘) ã®å…±é€šé …を探ã™åŠªåŠ›ã‚’ã™ã‚‹ãƒãƒ¡ã«ãªã£ã¦ã„る。 僕ã¯ã€ã“ã®æ··ä¹±ã—ãŸ
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
モナドãƒãƒ³ã‚ºã‚ªãƒ³å‰åº§
「å†ä»£å…¥ãªã‚“ã¦ã€ã‚ã‚‹ã‚ã‘ãªã„〠～ãµã¤ã†ã®ãƒ—ãƒã‚°ãƒ©ãƒžãŒé–¢æ•°åž‹è¨€èªžã‚’知るã¹ãç†ç”±ï½ž (Gunma.web #5 2011/05/14)parrotstudio
çµµã§è¦‹ã‚‹ãƒ¢ãƒŠãƒ‰ · eed3si9n
2012-08-21 John Wiegley ã•ã‚“㮠“Monads in Pictures†を翻訳ã—ã¾ã—ãŸã€‚翻訳ã®å…¬é–‹ã¯æœ¬äººã‚ˆã‚Šè¨±è«¾æ¸ˆã¿ã§ã™ã€‚翻訳ã®é–“é•ã„ç‰ãŒã‚ã‚Œã°é æ…®ãªãã”指摘ãã ã•ã„。 2012å¹´8月20æ—¥ John Wiegley è‘— 2012å¹´8月21æ—¥ e.e d3si9n 訳 ã“ã‚Œã¯ãƒ¢ãƒŠãƒ‰ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã§ã¯ãªã„ã—ã€ã“ã“ã«ã¯æ•°å¦ç”¨èªžã‚‚出ã¦ã“ãªã„。本稿ã¯ã€æ—¢ã«ãƒ¢ãƒŠãƒ‰ã‚’一応使ãˆã‚‹ãらã„ã«ã¯ç¿’ã£ãŸäººã‚’対象ã¨ã™ã‚‹ã€‚視覚化ã™ã‚‹ã“ã¨ã§ã€ä½•ã®ãŸã‚ã«ä½•ã‚’ã‚„ã£ã¦ã„ã‚‹ã‹ãŒæ˜Žã‚‰ã‹ã«ãªã‚‹ã¯ãšã 。 関数 モナドã«å¯¾ã™ã‚‹ç›´æ„Ÿã‚’得る一ã¤ã®æ–¹æ³•ã¨ã—ã¦é–¢æ•°ã‹ã‚‰ãƒ¢ãƒŠãƒ‰ã¸ã®æŠ½è±¡åŒ–ã‚’ãŸã©ã‚‹ã¨ã„ã†ã‚‚ã®ãŒã‚る。関数ãŒä½•ã‚’ã‚„ã£ã¦ã„ã‚‹ã®ã‹ã‚’ç°¡å˜ãªçµµã§è¡¨ã—ã¦ã¿ã‚ˆã†ã€‚Haskell ã®é–¢æ•°ã®å‘¼ã³å‡ºã—ã®æ§‹æ–‡ã‚’上ã«ã€åŒã˜æ¼”算を視覚化ã—ãŸã‚‚ã®ã‚’下ã«ç½®ã„ãŸ: 関数ã¯ã‚る値 a を投射 (map) ã—ã¦åˆ¥ã®å€¤ b を得る。ä¸ã§ä½•ãŒèµ·
Lost in Technopolis
This is not a tutoral on monads, nor will I use any math terms here. This is for people who have learned enough about monads to use them, but want to get a better picture of what they’re doing and why they exist. Functions One way to develop a first intuition about monads is to follow the progression of abstractions from functions to monads. Here is a simple picture of what a function does. I’ve p
Monad Transformers Step by Step
Information Martin Grabmüller: Monad Transformers Step by Step, draft paper, October 2006. 12 pages, A4 format, English. Abstract In this tutorial, we describe how to use monad transformers in order to incrementally add functionality to Haskell programs. It is not a paper about implementing transformers, but about using them to write elegant, clean and powerful programs in Haskell. Starting from a
モナドトランスフォーマーã¨monad-control - maoeã®ãƒ–ãƒã‚°
アドベントカレンダーã®ã„ã„ãƒã‚¿ãŒç„¡ã„ãªã‚ã¨æ€ã£ã¦ã„ãŸã¨ã“ã‚ã€ã¡ã‚‡ã†ã©é€±æœ«ã«ã‚ãŸã‚‰ã—ã„monad-controlãŒãƒªãƒªãƒ¼ã‚¹ã•ã‚ŒãŸã®ã§ã€ã“れを紹介ã—ãŸã„ãªã¨æ€ã„ã¾ã—ãŸã€‚ ãã®å‰ã«ã€ãƒ¢ãƒŠãƒ‰ãƒˆãƒ©ãƒ³ã‚¹ãƒ•ã‚©ãƒ¼ãƒžãƒ¼ã¨ã„ã†ã‹ã£ã“ã„ã„åå‰ã®ä»£ç‰©ã®è©±ã‚’ã¡ã‚‡ã£ã¨ã ã‘ã—ã¾ã—ょã†ã€‚ モナドトランスフォーマーã¨ä¾‹å¤–å‡¦ç† Haskellerã®çš†ã•ã‚“ã¯ãã£ã¨æ¯ã‚’ã™ã‚‹ã‹ã®ã‚ˆã†ã«è‡ªç„¶ã«ãƒ¢ãƒŠãƒ‰ã‚’使ã£ã¦ã„ã‚‹ã“ã¨ã¨æ€ã„ã¾ã™ã€‚標準ã§æä¾›ã•ã‚Œã¦ã„るモナドã¯å˜æ©Ÿèƒ½ãªã®ã§ã€çµ„ã¿åˆã‚ã›ãŸããªã£ã¦ãã¾ã™ã€‚必然的ã«çš†ãƒ¢ãƒŠãƒ‰ãƒˆãƒ©ãƒ³ã‚¹ãƒ•ã‚©ãƒ¼ãƒžãƒ¼ã«æ‰‹ã‚’伸ã°ã™ã‚ã‘ã§ã™ã€‚実際ã®ã‚¢ãƒ—リケーションã®ã‚³ãƒ¼ãƒ‰ã‚’書ãã¨ã€å¤šãã®ãƒ¢ãƒŠãƒ‰ã§ã¯ãƒ™ãƒ¼ã‚¹ãƒ¢ãƒŠãƒ‰ãŒIOã«ãªã‚‹ã§ã—ょã†ã‹ã‚‰ã€ä»Šåº¦ã¯è‡ªä½œã—ãŸã‚«ã‚¹ã‚¿ãƒ モナドスタックã§IOãŒæŠ•ã’る例外をãƒãƒ³ãƒ‰ãƒ«ã—ãŸããªã‚‹ã‚ã‘ã§ã™ã€‚ ã“ã“ã§ãµã¨Control.Exception.catchã®åž‹ã‚’ã¿ã‚‹ã¨ Prelude> :t Control
1 モナモナ言ã‚ãªã„ モナド入門 2011.12.3 山本和彦 2 ãŠå“書ã 統一ç†è«–ã¨å¤§çµ±ä¸€ç†è«– コンテナã®åŠ›ã®éšŽå±¤ 内包表記 3 Q) ãªãœãƒ¢ãƒŠãƒ‰ãŒç†è§£ã§ããªã„ã®ã‹ï¼Ÿ A) 抽象的ãªæ¦‚念ã ã‹ã‚‰ 4 Q) 抽象ã®å£ï¿½ï¿½
1 モナモナ言ã‚ãªã„ モナド入門 2011.12.3 山本和彦 2 ãŠå“書ã 統一ç†è«–ã¨å¤§çµ±ä¸€ç†è«– コンテナã®åŠ›ã®éšŽå±¤ 内包表記 3 Q) ãªãœãƒ¢ãƒŠãƒ‰ãŒç†è§£ã§ããªã„ã®ã‹ï¼Ÿ A) 抽象的ãªæ¦‚念ã ã‹ã‚‰ 4 Q) 抽象ã®å£ã‚’çªç ´ã™ã‚‹ã«ã¯ ã©ã†ã™ã‚Œã°ã„ã„ã®ã‹ï¼Ÿ A) ã¾ãšå…·ä½“例を見ã¦ã‹ã‚‰ 抽象化ã—ã¦ã„ãã—ã‹ãªã„ 5 統一ç†è«–ã¨å¤§çµ±ä¸€ç†è«– 6 物ç†å¦ã§ã®æŠ½è±¡åŒ– 7 Haskell ã§ã®æŠ½è±¡åŒ– 8 状態系統一ç†è«– 9 Parser データ定義 data Parser a = Parser (String -> [(a,String)]) Parser を生æˆã™ã‚‹é–¢æ•° pwrap :: a -> Parser a pwrap v = Parser $ \inp -> [(v,inp)] Parser ã‚’åˆæˆã™ã‚‹é–¢æ•° pbind :: Parser a -> (a -> Parser b) -> Par
モナドã®ã™ã¹ã¦ã€€Haskell ã«ãŠã‘るモナドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…括的ガイド
モナドã®ã™ã¹ã¦ Haskell ã«ãŠã‘るモナドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…括的ガイド Version 1.1.0 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚念ã¨ãã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘る応用㫠ã¤ã„ã¦ã€åˆä¸ç´šã® Haskell プãƒã‚°ãƒ©ãƒžã«ã‚ã‹ã‚Šã‚„ã™ãã€åˆ©ç”¨ä¾¡å€¤ãŒã‚るよã†ãª 解説をã™ã‚‹ã“ã¨ã‚’æ—¨ã¨ã—ã¦ã„ã¾ã™ã€‚èªè€…㯠Haskell ã«ãªã‚Œã¦ã„ã‚‹ã“ã¨ã‚’å‰æ㨠ã—ã¾ã™ãŒã€ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹çµŒé¨“ã¯è¦æ±‚ã—ã¦ã„ã¾ã›ã‚“。ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€å¤š ãã®é¡Œæã‚’ã‚«ãƒãƒ¼ã—ã¦ã„ã¾ã™ã€‚後åŠã®ã‚»ã‚¯ã‚·ãƒ§ãƒ³ã§ã¯ã€å‰åŠã®é¡Œæをよãç†è§£ã— ã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ã—ã¾ã™ã€‚é †ã‚’ãŠã£ã¦ã€ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’例示ã™ã‚‹ãŸã‚ ã®ã‚µãƒ³ãƒ—ルコードãŒãŸãã•ã‚“用æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚一èªã§ã€ã™ã¹ã¦ã®é¡Œæã‚’å¸åŽã— よã†ã¨ã„ã†ã®ã¯ãŠå‹§ã‚ã§ãã¾ã›ã‚“。 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ 3 ã¤ã®éƒ¨åˆ†ã§æ§‹æˆã•ã‚Œã¦ã„ã¾ã™ã€‚最åˆã®éƒ¨åˆ†ã¯ã€ 関数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘るモナドã®åŸºæœ¬çš„
Haskel モナドã®è§£èª¬ from 2ch - From a Far East Island
735 ：デフォルトã®åç„¡ã—ã•ã‚“ ：2007/02/15(木) 00:11:39 >>733 3è¡Œã§èª¬æ˜Žã™ã‚‹ã®ã¯ä¿ºã«ã¯ç„¡ç†ï¼Ž ã¾ãšå®šç¾©5．ã“ã‚Œã¯å®Ÿéš›ã«æ‰‹ã‚’å‹•ã‹ã™ã¨è¦‹ãˆã¦ãã‚‹ã®ã§ï¼Œ 具体例ã§ã‚„ã‚‹ã®ãŒè‰¯ã„ã¨æ€ã†ï¼Žä»¥ä¸‹ã¯ãã® pdf ã«ã‚‚ã‚る例． 1. リスト函手 ・型 A ã«å¯¾ã— T A 㯠A ã®ãƒªã‚¹ãƒˆã‚’作る： T A = [A] ・関数 f :: A -> B ã«å¯¾ã— T f :: [A] -> [B] ã¯æ¬¡ã®é–¢æ•°ã‚’作る： T f = map f ・μ_X 㯠X åž‹ã®ãƒªã‚¹ãƒˆã®ãƒªã‚¹ãƒˆã‚’ãªã‚‰ã—㦠X åž‹ã®ãƒªã‚¹ãƒˆã‚’作る： μ_X = concat ・η_X 㯠X åž‹ã®å€¤ x ã‹ã‚‰ãã‚Œã ã‘ã‹ã‚‰ãªã‚‹ [X} åž‹ã®ãƒªã‚¹ãƒˆ [x] を作る： η_X = singleton = (:[]) ã“れらを図ã«ä»£å…¥ã—ã¦ï¼Œã¡ã‚ƒã‚“ã¨å¯æ›ã«ãªã‚‹ã“ã¨ã‚’確èªã™ã‚‹ã‚ˆã‚ã—． 736 ：デフォルトã®åç„¡ã—ã•ã‚“ ：2007/0
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
Haskell ã® mapM_ – foldr 㨠(>>) ã‚’æ„è˜ã—ã¦
1. mapM_ 関数ã¯ã€ã©ã®ã‚ˆã†ã«å®šç¾©ã•ã‚Œã¦ã„ã‚‹ã®ã‹ï¼Ÿ Haskell ã® print 関数ã§æ–‡å—列を連続ã—ã¦å‡ºåŠ›ã•ã›ãŸã„å ´åˆã€æ¬¡ã®ã‚ˆã†ã«æ›¸ã。 main = do print "hoge" print "piyo" print "fuga" ã“れをçŸã‹ã書ããŸã„ãªã‚‰ã€ main = mapM_ print ["hoge", "piyo", "fuga"] 最åˆã€æ„味もã‚ã‹ã‚‰ãš mapM_ ã®å‹•ä½œã‚’覚ãˆã‚ˆã†ã¨ã—ãŸã€‚ ^^; ãªãœã“ã®ã‚ˆã†ã«æ›¸ã‘ã‚‹ã®ã ã‚ã†ï¼Ÿ 2. map, fold ç³»ã®å¾©ç¿’ã‹ã‚‰ ã¾ãšã¯ map, fold ç³»ã®å¾©ç¿’ã‹ã‚‰ã€‚ map 関数ã¯ã€Œå„è¦ç´ ã¸æŒ‡å®šã•ã‚ŒãŸé–¢æ•° f ã‚’é©ç”¨ã€ã™ã‚‹ã€‚ リストã®è¦ç´ ã‚’ 2 å€ã™ã‚‹ãªã‚‰ã€ *Main> map (*2) [0..5] [0,2,4,6,8,10] ã“ã‚Œã«å¯¾ã—ã¦ã€fold ç³» ã®é–¢æ•°ã¯å¤§é›‘把ãªã‚¤ãƒ¡ãƒ¼ã‚¸ã¨ã—ã¦ã€ã€Œå„è¦ç´ ã®é–“ã«äºŒé …演算å
Haskell ã® sequence 関数 - foldr をイメージã—ã¦
「Haskell ã® mapM_ – foldr 㨠(>>) ã‚’æ„è˜ã—ã¦ã€ã®ã¤ã¥ã 1. mapM_ 関数をç†è§£ã™ã‚‹ã«ã¯ã€sequence 関数ã®ç†è§£ãŒä¸å¯æ¬ å‰å›žã¯ã€ mapM_ 関数 ã®å‹•ä½œã«ã¤ã„ã¦è¦‹ãŸã€‚ã—ã‹ã—ã€ã©ã†ã‚‚感覚的ã«å…¨ç„¶èº«ã«ä»˜ã„ã¦ã„ãªã„。 mapM_ を使ãŠã†ã¨ã™ã‚‹ã¨ã€ 「ã‚れ？一体ã“れ何ã—ã¦ã‚‹ã‚“ã ã£ã‘〠ã¨è€ƒãˆè¾¼ã‚“ã§ã—ã¾ã†ã€‚返り値ã«é–¢å¿ƒã®ã‚ã‚‹ mapM ã«ã—ã¦ã‚‚åŒã˜ã€‚ 多分ã€ã“ã®é–¢æ•°ã®ãƒ™ãƒ¼ã‚¹ã¨ãªã£ã¦ã„ã‚‹ sequence 関数 ã‚’ã¡ã‚ƒã‚“ã¨ç†è§£ã—ã¦ãªã„ãŸã‚ã«ã€é ã®ä¸ã«ã‚¤ãƒ¡ãƒ¼ã‚¸ã‚’æã‘ãªã„ã¨æ€ã†ã€‚ (+_+) Prelude ã«ã¯ã€ sequence :: Monad m => [m a] -> m [a] Evaluate each action in the sequence from left to right, and collect the results. 型を見れ
Stateモナドを今度ã“ãç†è§£ã™ã‚‹ - Pixel Pedals of Tomakomai
3å¹´å‰ã«ç†è§£ã—よã†ã¨ã—ã¦æƒ¨æ•—ã—ãŸ*1Haskellã®Stateモナドã®è§£èª¬ã«ã€ãƒªãƒ™ãƒ³ã‚¸ã—よã†ã¨æ€ã„ã¾ã™ã€‚åœè«–ã‚’ã¡ã‚‡ã£ã¨ã¯ã‹ã˜ã£ãŸã®ã§ã€ä»Šåº¦ã“ãã¾ã¨ã‚‚ãªè§£èª¬ãŒã§ãã‚‹ã¯ãšã€‚ ã¨è¨€ã†ã“ã¨ã§ã€ä»Šå›žã¯å‰ç·¨ã§ã™ã€‚åœè«–ã®çŸ¥è˜ã¯å‰æã¨ã¯ã—ã¦ãªã„ã§ã™ãŒã€é›†åˆã¨å†™åƒã«ã‚¢ãƒ¬ãƒ«ã‚®ãƒ¼ãŒã‚ã‚‹ã¨ãã¤ã„ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“。 *1:3å¹´å‰ã®æ•—å› ã¯ã€åœã‚’Setsã ã¨æ€ã„込んã§ãŸä¸Šã«é–¢æ‰‹ã‚’「写åƒã‚’写åƒã«ç§»ã™å†™åƒã€ã ã¨èª¤è§£ã—ã¦ãŸã“ã¨ã§ã—ょã†ã‹ã€‚
Introduction to "How to Declare an Imperative"
論文紹介：How to Declare an Imperative Philip Wadler. ACM Computing Surveys, 29(3):240--263, September 1997.（WWW:Wadler: Monads） 1. å°Žå…¥ 2. 相互作用ã¸ã®monadアプãƒãƒ¼ãƒ 基本的ãªå‘½ä»¤ Equational reasoning 値をå—ã‘入れる命令 letã®é¡žä¼¼ç‰© monadã®æº€ãŸã™æ³•å‰‡ monadã¨å‘½ä»¤åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° C関数ã®ç›´æŽ¥å‘¼ã³å‡ºã— 3. 相互作用ã«å¯¾ã™ã‚‹ãã®ä»–ã®ã‚„ã‚Šæ–¹ åŒæœŸã•ã‚ŒãŸã‚¹ãƒˆãƒªãƒ¼ãƒ （synchronized stream） continuation 線形論ç†ï¼ˆlinear logic） 副作用（side effect） 4. é–¢é€£ç ”ç©¶ 5. çµè«– 一階ã¨é«˜éšŽ ãƒãƒƒã‚¯ãƒ»ãƒˆãƒ©ãƒƒã‚¯ 1.å°Žå…¥ 400年程å‰ãƒ‡ã‚«ãƒ«ãƒˆã®å•é¡Œ 心ã¯ç”Ÿä½“ã¨ã©ã†ç›¸äº’作用ã™ã‚‹ã®ã‹ï¼Ÿ
檜山æ£å¹¸ã®ã‚マイラ飼育記 - 世界ã§ä¸€ç•ªã‹äºŒç•ªãらã„ã«ã‚„ã•ã—ã„「モナド入門ã€
æ°—ã¾ãã‚Œã¨å¶ç„¶ã¨ãªã‚Šã‚†ãã§ã€ã“ã“2,3回ã¯ãƒ¢ãƒŠãƒ‰ã‚’話題ã«ã—ã¾ã—ãŸã€‚googleã§ã€Œãƒ¢ãƒŠãƒ‰ã€ã‚’引ã„ã¦ã‚¶ãƒƒã¨çœºã‚ã‚‹ã¨ã€ã€Œãƒ¢ãƒŠãƒ‰ã¯ã‚€ãšã‹ã—ã„ーã€ã¨ã‹ã€Œãƒ¢ãƒŠãƒ‰ã§æŒ«æŠ˜ã—ãŸã€ã¿ãŸã„ãªé›°å›²æ°—ãŒæ„Ÿã˜ã‚‰ã‚Œã¦ã€èª¬æ˜ŽèŠ¸äººã®è¡€ãŒå°‘ã—騒ãŽã¾ã—ãŸã。「ãªã‚‰ã€äºˆå‚™çŸ¥è˜ã‚¼ãƒã§ãƒ¢ãƒŠãƒ‰ã®èª¬æ˜Žã‚’ã—ã¦ã‚„ã‚ã†ã˜ã‚ƒãーã‹ã€ã¨ã€‚ タイトルã¯ã ã„ã¶ç…½ã£ã¡ã‚ƒã£ãŸâ€¦â€¦ ã‘ã©ã€ãƒãƒƒã‚¿ãƒªã˜ã‚ƒãªã„ã¤ã‚‚り…… ã‘ã©ã€å®Ÿéš›ã¯ã©ã†ã‹ãªï¼Ÿ ※å°åˆ·ã®ã¨ãã¯ã‚µã‚¤ãƒ‰ãƒãƒ¼ãŒæ¶ˆãˆã¾ã™ã€‚ 内容： ã¨ã‚Šã‚ãˆãšã€ã‚ãŸã‚Šã•ã‚ã‚Šãªãモナドã®æ¥æ´ã‚’紹介ã™ã‚‹ ã“ã‚“ãªèª²é¡Œã‚’考ãˆã¦ã¿ã‚ˆã†ï¼šå‰¯ä½œç”¨ä»˜ã計算 カウントアップã™ã‚‹é–¢æ•°é” カウントアップã—ãŸã„æ„志を戻り値ã§ä¼ãˆã‚‹ ãã‚Œã§ã¯ã€ã„ã£ãŸã„誰ãŒã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã‚’ã™ã‚‹ã®ã 関数ã®å¼•æ•°ã®åž‹ã‚’Countupåž‹ã«ã¾ã§æ‹¡å¼µã™ã‚‹ ãã—ã¦ã€ã“ã‚ŒãŒãƒ¢ãƒŠãƒ‰ã ã¨ã‚Šã‚ãˆãšã€ã‚ãŸã‚Šã•ã‚ã‚Šãªãモナドã®æ¥æ´ã‚’紹介ã™ã‚‹ 今ã‹ã‚‰ã“ã“ã§èª¬æ˜Žã™ã‚‹ã€Œãƒ¢ãƒŠãƒ‰ï¼ˆmonad）
Understanding Monads With JavaScript — igstan.ro
May 02, 2011 Update Nice people have translated this article into Portuguese and Russian. For the past weeks I've been working hard studying monads. I'm still learning Haskell, and to be honest I thought I knew what monads are all about, but when I wanted to write a little Haskell library, just to sharpen up my skills, I realized that while I understood the way monadic bind (>>=) and return work,
Translation from Haskell to JavaScript of selected portions of the best introduction to monads I've ever read – The If Works
(With apologies to John Gruber and A Neighborhood of Infinity.) I know, I know, the world does not need yet another introduction to monads (or yet another article complaining that world does not need yet another introduction to monads). So you’ll be glad to know this isn’t one of those, in the sense that it’s not new. I thought I’d write it because, first, monads are worth knowing about, and secon
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
BiwaSlide
{{#tags}}- {{label}}
{{/tags}}