モナド: ãŠå‰ã¯ã‚‚ã†çŸ¥ã£ã¦ã„ã‚‹ | Webシステム開発ï¼æ•™è‚²ã‚½ãƒªãƒ¥ãƒ¼ã‚·ãƒ§ãƒ³ã®ã‚¿ã‚¤ãƒ インターメディア
ã¯ã˜ã‚ã« éŽåŽ»ã«ç§ãŒHaskellã‚’å¦ã³å§‹ã‚ãŸæ™‚〠真ã£å…ˆã«ç–‘å•ã«æ€ã£ãŸã“ã¨ã¯ãƒ¢ãƒŠãƒ‰ã®å˜åœ¨ã ã£ãŸã€‚ 当時ã¯å…¨ãã¨è¨€ã£ã¦ã„ã„ã»ã©ç†è§£ã§ããªã‹ã£ãŸãŒã€ 最近Haskellã‚’å¦ã³ç›´ã—㦠よã†ã‚„ãç†è§£ã™ã‚‹ã“ã¨ãŒã§ããŸ(ã¨æ€ã†)。 ã¨ã„ã†è¨³ã§ã€ç¾æ™‚点ã§ã®ç§ã®ãƒ¢ãƒŠãƒ‰ã¸ã®ç†è§£ã‚’示ã™ãŸã‚ã«ã“ã®è¨˜äº‹ã‚’書ã。 ã“ã“ã§ã¯ãƒ¢ãƒŠãƒ‰ã®æœ¬è³ªãŒä½•ãªã®ã‹æ¦‚è¦ã‚’示ã™ã€‚ æ£ç¢ºãªèª¬æ˜Žã¯æ•°å¤šã‚るモナドã«ã¤ã„ã¦ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’å‚ç…§ã•ã‚ŒãŸã„。 Hellow Worldå•é¡Œ: IO, Monad, fail æ–°ã—ã„言語をå¦ã¶æ™‚ã€ã¾ãšé–“é•ã„ãªãHello Worldを書ãã ã‚ã†ã€‚ Haskellã§Hello Worldを書ãã¨ã“ã†ãªã‚‹: ã“ã®1è¡Œã ã‘を見るã¨æ™®é€šã®å‘½ä»¤åž‹è¨€èªžã¨å¤§ã—ã¦å¤‰ã‚らãªã„よã†ã«æ€ãˆã‚‹ã€‚ ã¨ã“ã‚ã§Haskellã«ã¯å¼·åŠ›ãªåž‹æŽ¨è«–ãŒã‚る。 ãã®ãŸã‚型宣言をçœç•¥ã—ã¦ã‚‚処ç†ç³»ãŒã‚ˆã—ãªã«è§£é‡ˆã—ã¦ãれる。 ãŸã 普通ã¯ã‚³ãƒ¼ãƒ‰ã®æ„図ã™
Hoogle(the Haskell API Search Engine)
Welcome to Hoogle Links Haskell.org Hackage GHC Manual Libraries Hoogle is a Haskell API search engine, which allows you to search the Haskell libraries on Stackage by either function name, or by approximate type signature. Example searches: map (a -> b) -> [a] -> [b] Ord a => [a] -> [a] Data.Set.insert +bytestring concat Enter your own search at the top of the page. The Hoogle manual contains mor
[PDF] 純粋関数型言語 Haskellã®ç´¹ä»‹ ～ 制約プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ã‚¹ã‚¹ãƒ¡ ～
1 Haskell 2 3 4 Haskell ( ) 5 Haskell Lisper 6 Haskell = Haskell 7 Haskell Haskell ... 8 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 ‘div‘ 2 3 4 map even [1,2,3,4] [False,True,False,True] 9 not . even getLine >>= putStrLn 10 main = putStrLn "Hello, world!" average x y = (x + y) / 2 if collatz n = if even n then n ‘div‘ 2 else n * 3 + 1 subs [] = [[]] sub
Leftist Heap - 言語ゲーãƒ
Chris Okasaki ã® Purely Functional Data Structures ã¨ã„ã†æœ¬ã‚’è²·ã£ã¦ã¿ã¾ã—ãŸã€‚ã“ã‚Œã¯ã€å‰¯ä½œç”¨ã‚’使ã‚ãªã„ã§ã„ã‚ã„ã‚ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を実装ã™ã‚‹ã¨ã„ã†å¤§å¤‰é¢ç™½ã„本ã§ã€ã“れをèªã‚€ã¨ã€å‰¯ä½œç”¨ç„¡ã—ã§â—‹â—‹ãŒå‡ºæ¥ã‚‹ã‚ã‘ãŒãªã„ï¼ã¨ã„ã†æ™‚ã®â—‹â—‹ãŒã ã„ã¶æ¸›ã‚‹ã¨æ€ã„ã¾ã™ã€‚ サンプル㯠Standard ML ã§æ›¸ã‹ã‚Œã¦ã„ã‚‹ã®ã§ã™ãŒã€è‰¯ãã‚ã‹ã‚‰ãªã„ã®ã§Haskell ã§æ›¸ãç›´ã—ãªãŒã‚‰èªã‚“ã§ã¿ã¾ã™(巻末㫠Haskell ã§ã®å®Ÿè£…例ãŒè¼‰ã£ã¦ã‚‹ã‘ã©è¦‹ãªã„ãµã‚Š)。 17 ページ㫠Heap ã¨ã„ã†ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ãŒç´¹ä»‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ã“ã‚Œã¯æ¬¡ã®æ€§è³ªã‚’ã‚‚ã£ãŸã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ã§ã™ã€‚ è¦ç´ ã¯å¤§å°é–¢ä¿‚ã‚’æŒã¤ã‚ªãƒ–ジェクト。 最å°ã®è¦ç´ ã ã‘ã‚’å–り出ã™äº‹ãŒå‡ºæ¥ã‚‹ã€‚ よã†ã™ã‚‹ã«ã‚るリストをソートã—ã¦æœ€å°ã®å¥´ã‚’å–り出ã—ãŸã„ã¨ã„ã†å ´åˆã€å–り出ã™ç‰©ãŒæœ€å°ã®ç‰©ã ã‘ãªã‚‰ã°ã‚½ãƒ¼ãƒˆã™ã‚‹ã‚ˆã‚ŠåŠ¹çŽ‡ã®è‰¯ã„方法
Hoogle
Welcome to Hoogle Links Haskell.org Hackage GHC Manual Libraries Hoogle is a Haskell API search engine, which allows you to search the Haskell libraries on Stackage by either function name, or by approximate type signature. Example searches: map (a -> b) -> [a] -> [b] Ord a => [a] -> [a] Data.Set.insert +bytestring concat Enter your own search at the top of the page. The Hoogle manual contains mor
Monad ãŒã•ã£ã±ã‚Šãªã®ã§è©¦ã—ã«ãªã‚“ã‹æ›¸ã„ã¦ã¿ãŸ - æ°¸é ã«æœªå®Œæˆ
Monad ã‚€ãšã„ã§ã™ã€‚ã„ã¤ã¾ã§ãŸã£ã¦ã‚‚ã„ã¾ã„ã¡ã¡ã‚ƒã‚“ã¨ç†è§£ã§ããªã„ã®ã§ã€è©¦ã—ã«ãªã‚“ã‹æ›¸ã„ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸã€‚今回ã®é¡Œæã¯ä»¥ä¸‹ã€‚ Meet the Monads ã“ã®ãƒšãƒ¼ã‚¸ã§ä½¿ã‚ã‚Œã¦ã„るクãƒãƒ¼ãƒ³ç¾Šã•ã‚“ã®ä¾‹ã‚’書ã„ã¦ã¿ã‚ˆã†ã¨æ€ã„ã¾ã™ã€‚…Vimã§ã€‚ " Maybe Monad let Maybe = {} function! Maybe.return(m) return Just(a:m) endfunction " m(self) >>= f function! Maybe.bind(f) let Func = type(a:f) == type('') ? function(a:f) : a:f return self['bind_' . self.type](Func) endfunction function! Maybe.bind_Just(f) return a:f(self.m)
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Vim-users.jp - Hack #211: Haskellã§importã™ã‚‹ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚„関数をãã®å ´ã§èª¿ã¹ã¤ã¤å…¥åŠ›ã™ã‚‹
{{#tags}}- {{label}}
{{/tags}}