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

daimatz id:daimatz

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

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

Indexed Monadã®ä¸–ç•Œ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
ã‚‚ã£ã¨ã€ãƒ¢ãƒŠãƒ‰ã®åŠ›ã‚’å¼•ãå‡ºã—ãŸãã¯ãªã„ã‹ï¼Ÿ ãˆï¼Ÿã‚¢ã‚¯ã‚·ãƒ§ãƒ³ã®å‰å¾Œã§åž‹ã‚’å¤‰ãˆãŸã„ï¼Ÿã„ã‚„ã„ã‚„ã„ã‚„ã€ãƒ¢ãƒŠãƒ‰ã¯è‡ªå·±é–¢æ‰‹ã®åœä¸Šã®å˜ãªã‚‹ãƒ¢ãƒŽã‚¤ãƒ‰ã ã‚ˆã€ãã‚“ãªã“ã¨ãŒã§ãâ€¦ã‚‹â€¦ï¼ï¼Ÿãˆã£ã€ã§ãã‚‹ã®â€¦ãƒžã‚¸ã§â€¦ï¼Ÿ ã§ãã‚‹ã€‚ãã†ã€Haskellãªã‚‰ãã€‚ {-# LANGUAGE QuasiQuotes #-} import Control.Monad.Indexed.State import Control.Monad.Indexed import Language.Haskell.IndexedDo hoge :: IxState Int [Int] () hoge = [ido|do imodify (*10) imodify show imodify reverse imodify (++"123") imodify $ map fromEnum |] *ghci> runIxState hoge 42 (
daimatz 2013/05/06
Haskell

monad
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŠãƒˆã‚™ã‹ã‚™ã„ã£ã¯ã‚šã„ï¼
YAPC::Asia 2014 - åŠç«¯ãªPHPDisã§PHPerã«é™°ã§ç¬‘ã‚ã‚Œãªã„ãŸã‚ã®Perl Mongerå‘ã‘æœ€æ–°PHPäº‹æƒ…Junichi Ishida
daimatz 2012/12/09
monad

Haskell
ãƒªãƒ³ã‚¯
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
daimatz 2012/10/17
monad

programming

haskell

applicative
ãƒªãƒ³ã‚¯
Comprehending Monads
What's a monad? What's a monad? trait Monad[A] { def map[B](f: A => B): Monad[B] def flatMap[B](f: A => Monad[B]): Monad[B] } Note: there is no single, special Monad base trait! Provides a standard interface for composing and sequencing operations on some contained value(s) map: Applies a "regular" function to the contained value(s) flatMap: Applies a "monadic" function to the contained value(s) T
daimatz 2012/10/04
scala

monad

programming
ãƒªãƒ³ã‚¯
çµµã§è¦‹ã‚‹ãƒ¢ãƒŠãƒ‰ Â· eed3si9n
2012-08-21 John Wiegley ã•ã‚“ã® â€œMonads in Picturesâ€ ã‚’ç¿»è¨³ã—ã¾ã—ãŸã€‚ç¿»è¨³ã®å…¬é–‹ã¯æœ¬äººã‚ˆã‚Šè¨±è«¾æ¸ˆã¿ã§ã™ã€‚ç¿»è¨³ã®é–“é•ã„ç‰ãŒã‚ã‚Œã°é æ…®ãªãã”æŒ‡æ‘˜ãã ã•ã„ã€‚ 2012å¹´8æœˆ20æ—¥ John Wiegley è‘— 2012å¹´8æœˆ21æ—¥ e.e d3si9n è¨³ ã“ã‚Œã¯ãƒ¢ãƒŠãƒ‰ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã§ã¯ãªã„ã—ã€ã“ã“ã«ã¯æ•°å¦ç”¨èªžã‚‚å‡ºã¦ã“ãªã„ã€‚æœ¬ç¨¿ã¯ã€æ—¢ã«ãƒ¢ãƒŠãƒ‰ã‚’ä¸€å¿œä½¿ãˆã‚‹ãã‚‰ã„ã«ã¯ç¿’ã£ãŸäººã‚’å¯¾è±¡ã¨ã™ã‚‹ã€‚è¦–è¦šåŒ–ã™ã‚‹ã“ã¨ã§ã€ä½•ã®ãŸã‚ã«ä½•ã‚’ã‚„ã£ã¦ã„ã‚‹ã‹ãŒæ˜Žã‚‰ã‹ã«ãªã‚‹ã¯ãšã ã€‚ é–¢æ•° ãƒ¢ãƒŠãƒ‰ã«å¯¾ã™ã‚‹ç›´æ„Ÿã‚’å¾—ã‚‹ä¸€ã¤ã®æ–¹æ³•ã¨ã—ã¦é–¢æ•°ã‹ã‚‰ãƒ¢ãƒŠãƒ‰ã¸ã®æŠ½è±¡åŒ–ã‚’ãŸã©ã‚‹ã¨ã„ã†ã‚‚ã®ãŒã‚ã‚‹ã€‚é–¢æ•°ãŒä½•ã‚’ã‚„ã£ã¦ã„ã‚‹ã®ã‹ã‚’ç°¡å˜ãªçµµã§è¡¨ã—ã¦ã¿ã‚ˆã†ã€‚Haskell ã®é–¢æ•°ã®å‘¼ã³å‡ºã—ã®æ§‹æ–‡ã‚’ä¸Šã«ã€åŒã˜æ¼”ç®—ã‚’è¦–è¦šåŒ–ã—ãŸã‚‚ã®ã‚’ä¸‹ã«ç½®ã„ãŸ: é–¢æ•°ã¯ã‚ã‚‹å€¤ a ã‚’æŠ•å°„ (map) ã—ã¦åˆ¥ã®å€¤ b ã‚’å¾—ã‚‹ã€‚ä¸ã§ä½•ãŒèµ·
daimatz 2012/08/23
Haskell

monad
ãƒªãƒ³ã‚¯
http://mew.org/~kazu/material/2011-monad.pdf
daimatz 2012/08/19
Haskell

Monad
ãƒªãƒ³ã‚¯
[Coq] Monads in Coq
Personal memorandum for studying functional languages, theorem proving, and formal verification. But other topics might be included. Written in Japanese (Shift-JIS Encoding). ç¤¾å†…å‹‰å¼·ä¼šã§Monadå…¥é–€ã®è©±ã‚’ã—ã¦ã€ãã®æ™‚ã«Coqã‚’ç”¨ã„ã¦èª¬æ˜Žã—ã¾ã—ãŸã€‚ ã‚ã¾ã‚ŠHaskellã«æ…£ã‚Œã¦ãªã„ã®ã§Coqä½¿ã£ãŸã‚“ã§ã™ãŒã€Coqã§ã¯Monadå‰‡ã‚’è¨¼æ˜Žã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã®ã§ã€å®Ÿã¯å¯§ã‚èª¬æ˜Žã«é©ã—ã¦ã„ã¾ã—ãŸã€‚ Haskellã ã¨Monadå‰‡ãŒãªãœå¿…è¦ãªã®ã‹ç¤ºã™ã®ãŒé¢å€’ãã†ï¼ˆä»»æ„ã®é–¢æ•°ã€ãªã‚“ã¦ã®ã¯QuickCheckã§ã‚‚ä½œã‚Œç„¡ã•ãã†ãªæ°—ãŒã™ã‚‹ï¼‰ã§ã™ãŒã€Coqã§ã¯ãã‚‚ãã‚‚Monadå‰‡ã‚’æº€ãŸã™ã“ã¨ã‚’ç¤ºã•ãªã„ã¨ã€Monadã‚’ä½¿ãˆã¾ã›ã‚“ã€‚ ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼
daimatz 2011/10/29
programming

Coq

Monad

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

programming

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
daimatz 2011/07/25
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ã€[] (ãƒªã‚¹ãƒˆ)
daimatz 2011/07/25
Haskell

Monad
ãƒªãƒ³ã‚¯
1