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
Haskellã®ç¶™ç¶šãƒ¢ãƒŠãƒ‰(Continuation Monad)ã‚’ç†è§£ã™ã‚‹ãƒã‚¤ãƒ³ãƒˆ - よãã‚ã‹ã‚Šã¾ã›ã‚“
モナドã®ã™ã¹ã¦ã®ç¶™ç¶šãƒ¢ãƒŠãƒ‰ã®ã¨ã“ã‚ãŒç°¡æ½”ã§ã€æ¦‚念ã¨ã‹ã‚‚ã‚ã¾ã‚Šæ˜Žç¤ºçš„ã«èª¬æ˜Žã—ã¦ãªãã¦ç†è§£ã«è‹¦åŠ´ã—ãŸã®ã§ã€ãƒã‚¤ãƒ³ãƒˆã‚’メモ。誤りãªã©ã€ä¹žã†ã”指摘。 newtype Cont r a = Cont { runCont :: ((a -> r) -> r) } instance Monad (Cont r) where return a = Cont $ \k -> k a (Cont c) >>= f = Cont $ \k -> c (\a -> runCont (f a) k) 概è¦çš„ãªã“㨠継続ã¨ã„ã„ã¤ã¤ã€ContãŒè¡¨ã™ã®ã¯ç¶™ç¶šã¨ã„ã†ã‚ˆã‚Šã€CPSãªé–¢æ•°ã€‚*1 CPSãªé–¢æ•°ã¯ã€å¼•æ•°ã«é–¢æ•°ã‚’ã¨ã‚Šã€è‡ªåˆ†ã®ä»•äº‹ã®æœ€å¾Œã§ãã®é–¢æ•°(継続)を呼ã¶ã€‚ CPSãªé–¢æ•°ã«ã€ç¶™ç¶šã¨ã—ã¦åˆ¥ã®CPSãªé–¢æ•°ã‚’渡ã™ã€ãã®åˆ¥ã®CPSãªé–¢æ•°ã«ç¶™ç¶šã¨ã—ã¦ã•ã‚‰ã«åˆ¥ã®CPSãªé–¢æ•°ã‚’渡ã™ã€â€¦ã®é€£éŽ–（CPSãªé–¢æ•°ã®ãƒã‚¹ãƒˆï¼‰ãŒã€å…¨ä½“ã¨ã—ã¦
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
Haskell ã® State モナド (1) - 状態を模倣ã™ã‚‹
昔ã€ãƒ¢ãƒŠãƒ‰ãŒã‚ˆãã‚ã‹ã‚‰ãªã‹ã£ãŸã®ã§ã€ã•ã¾ã‚ˆã£ã¦ã„ãŸã‚‰ã€ … ãƒãƒƒãƒˆã§è¦‹ãŸMonadã®èª¬æ˜Žã§ä¸€ç•ªç§ãŒã‚ã‹ã‚Šã‚„ã™ã„ã¨æ€ã£ãŸã®ã¯ã€Wikibooksã®èª¬æ˜Žã€‚Hello World!ãŒãƒ–ラックボックスãªäººã¯ã€æ˜¯éžä¸€èªã‚’。 (404 Blog Not Found:Haskellã§ä¸€ç•ªé›£ã—ã„ã®ã¯ より) 最åˆã«ã“ã® Wikibooksã®èª¬æ˜Ž ã‚’èªã‚“ã ã®ã¯åŽ»å¹´ã® 11 æœˆé ƒã€‚ãã®ã¨ãã®æ–‡æ›¸ã®ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã¯Â 05:13, 27 October 2008 ã§ã€ä»Šã¯å†…容ãŒéšåˆ†å¢—ãˆã¦ã„る。å‰ã®æ–‡æ›¸ã¯ã€ç¾åœ¨ã® Haskell/Understanding monads/State ã«ç›¸å½“ã™ã‚‹ã‚ˆã†ã 。 ã¨ã“ã‚ã§ã€ä¸Šè¨˜ã®è§£èª¬ã‚’最åˆèªã‚“ã ã¨ãå…¨ãæ„味ãŒã‚ã‹ã‚‰ãªã‹ã£ãŸã€‚ (@_@;) 「3 Stateful Computations〠ã§ã¯ã€ã€Œãƒ©ãƒ³ãƒ€ãƒ ãªæ•°å—を生æˆã™ã‚‹é–¢æ•°ã€ã‚’例ã«æŒ™ã’ã¦ãƒ¢ãƒŠãƒ‰ã®èª¬æ˜ŽãŒã•ã‚Œã¦ã„ãŸã‘ã‚Œã©ã€ä½•ãŒè¨€
All About Monads モナドã®ã™ã¹ã¦
モナドã®ã™ã¹ã¦ Haskell ã«ãŠã‘るモナドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…括的ガイド Version 1.1.0 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚念ã¨ãã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘る応用㫠ã¤ã„ã¦ã€åˆä¸ç´šã® Haskell プãƒã‚°ãƒ©ãƒžã«ã‚ã‹ã‚Šã‚„ã™ãã€åˆ©ç”¨ä¾¡å€¤ãŒã‚るよã†ãª 解説をã™ã‚‹ã“ã¨ã‚’æ—¨ã¨ã—ã¦ã„ã¾ã™ã€‚èªè€…㯠Haskell ã«ãªã‚Œã¦ã„ã‚‹ã“ã¨ã‚’å‰æ㨠ã—ã¾ã™ãŒã€ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹çµŒé¨“ã¯è¦æ±‚ã—ã¦ã„ã¾ã›ã‚“。ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€å¤š ãã®é¡Œæã‚’ã‚«ãƒãƒ¼ã—ã¦ã„ã¾ã™ã€‚後åŠã®ã‚»ã‚¯ã‚·ãƒ§ãƒ³ã§ã¯ã€å‰åŠã®é¡Œæをよãç†è§£ã— ã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ã—ã¾ã™ã€‚é †ã‚’ãŠã£ã¦ã€ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’例示ã™ã‚‹ãŸã‚ ã®ã‚µãƒ³ãƒ—ルコードãŒãŸãã•ã‚“用æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚一èªã§ã€ã™ã¹ã¦ã®é¡Œæã‚’å¸åŽã— よã†ã¨ã„ã†ã®ã¯ãŠå‹§ã‚ã§ãã¾ã›ã‚“。 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ 3 ã¤ã®éƒ¨åˆ†ã§æ§‹æˆã•ã‚Œã¦ã„ã¾ã™ã€‚最åˆã®éƒ¨åˆ†ã¯ã€ 関数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘るモナドã®åŸºæœ¬çš„
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Martin's Programming Blog: The M Word
Map and Reduce Monad for Clojure... What about a Juxt Monad?
A Lazy Sequence: Welcome to the machine
onclojure.com - onclojure リソースãŠã‚ˆã³æƒ…å ±
onclojure.com - onclojure リソースãŠã‚ˆã³æƒ…å ±
{{#tags}}- {{label}}
{{/tags}}