IIJ Research Laboratory次世代インターãƒãƒƒãƒˆã® 地平を切り拓ã We are IIJ Research Laboratory. IIJæŠ€è¡“ç ”ç©¶æ‰€ã«ã¤ã„㦠トピックス PAGE TOP
第11回　Haskellã§å¦ã¶ä¸¦åˆ—プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ï¼ˆãã®2） 並列化手法
å‰å›žã¯ï¼ŒGHCã§ä¸¦åˆ—プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’è¡Œã†ãŸã‚ã®æ©Ÿèƒ½ã«ã¤ã„ã¦èª¬æ˜Žã—ã¾ã—ãŸã€‚今回ã¯ãれらを使ã£ãŸä¸¦åˆ—プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®å…·ä½“çš„ãªæ–¹æ³•ã«ã¤ã„ã¦ï¼Œã‚‚ã†å°‘ã—詳ã—ã説明ã—ã¦ã„ããŸã„ã¨æ€ã„ã¾ã™ã€‚ å‰å›žã®è£œè¶³ GHCã®ã‚µã‚¤ãƒˆã§ã¯ï¼ŒGHC6.6.1ã®Windows用ã®ãƒã‚¤ãƒŠãƒªãƒ»ãƒ‘ッケージãŒWindows Vistaã«å¯¾å¿œã—ã¦ã„ã‚‹ã¨æ›¸ã‹ã‚Œã¦ã„ã¾ã™ã€‚ã—ã‹ã—実際ã«ã¯ï¼Œè¨å®šä¸Šã®å•é¡ŒãŒã¾ã 残ã£ã¦ã„るよã†ã§ã™ã€‚GHCã‚’Windows Vistaã§ä½¿ç”¨ã™ã‚‹ã«ã¯ï¼Œã‚らã‹ã˜ã‚環境変数PATHã‚’ghc\ghc-<version>\gcc-libディレクトリã«å¯¾ã—ã¦è¨å®šã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ï¼ˆå‚考リンク1，å‚考リンク2）。 ã¾ãŸï¼ŒGHC6.8ã«å‘ã‘ã¦ï¼ŒGHCã®é–‹ç™ºç‰ˆã§ã¯baseパッケージãŒå¤§ããå†ç·¨æˆã•ã‚Œã¦ã„ã¾ã™ã€‚ãã®çµæžœï¼Œå‰å›žæ‰±ã£ãŸControl.Parallelモジュールや今回説明ã™ã‚‹Control.Parallel.Strateg
Haskellã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã¨STMã«ã¤ã„㦠ãã®1 — ã‚ã‚Šãˆã‚‹ãˆã‚Šã‚
æ¦‚è¦ Haskellã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã¨STMã«ã¤ã„ã¦èª¿ã¹ãŸã®ã§ã€ã“ã“ã«ã¾ã¨ã‚ã¾ã™ã€‚ Haskellã®ã‚¹ãƒ¬ãƒƒãƒ‰ã‚·ã‚¹ãƒ†ãƒ ã¯ã€äºˆæƒ³ã‚ˆã‚Šã‚‚複雑ã§ã—ãŸã€‚ Haskellã®ä¸–ç•Œã§é–‰ã˜ãŸå‡¦ç†ãªã‚‰ã°ã€æ¯”較的簡å˜ãªã®ã§ã™ãŒã€ FFI(Foreign Function Interface: 外部ã®Cã®é–¢æ•°ã‚’呼ã³å‡ºã™ä»•çµ„ã¿)を使ã†ã¨ã€ ã¨ãŸã‚“ã«è¤‡é›‘ã«ãªã£ã¦ã—ã¾ã„ã¾ã™ã€‚ 一度ã«æ›¸ãã¨ã€é‡ãŒå¤šã„ãŸã‚ã€æ•°å›žã«åˆ†ã‘ã¦æ›¸ã“ã†ã¨æ€ã£ã¦ã„ã¾ã™ã€‚
本物ã®ãƒ—ãƒã‚°ãƒ©ãƒžã¯Haskellを使ã†ï¼šITpro
ç†è€… shelarcy Haskellã¯ï¼Œé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã„ã†ã‚¸ãƒ£ãƒ³ãƒ«ã«å±žã™ã‚‹è¨€èªžã§ã™ã€‚Haskellや関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’é¡Œæã«ç‰©äº‹ã‚’見ã¦ã„ãã“ã¨ã§ï¼Œä»Šã¾ã§æ€ã„もよらãªã‹ã£ãŸã‚ˆã†ãªæœªçŸ¥ã®ä¸–界を知るã“ã¨ãŒã§ãã‚‹ã§ã—ょã†ã€‚ プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã‚’å¦ã¶ã¨ã„ã†è¡Œç‚ºã«ã¯ï¼Œ 言語ã®åŸºæœ¬çš„ãªæ–‡æ³•ã‚„考ãˆæ–¹ã‚’ç†è§£ã™ã‚‹ 言語ã®æ–‡åŒ–åœã§åºƒã使ã‚ã‚Œã¦ã„る考ãˆæ–¹ã«è¦ªã—ã‚“ã§ãã®è¨€èªžã‚‰ã—ã„書ã方を習得ã™ã‚‹ å˜ã«è¨€èªžã‚’使ã£ã¦ã§ãã‚‹ã“ã¨ä»¥ä¸Šã®çŸ¥æµã‚’å¦ã¶ ã®3段階ãŒã‚ã‚Šã¾ã™ã€‚ã“ã®é€£è¼‰ã§ã¯ï¼Œä¸‰ã¤ç›®ã®æ®µéšŽã‚’目標ã«ï¼ŒHaskellプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ä¸–界を一ã¤ã²ã¨ã¤ä¸å¯§ã«ç´¹ä»‹ã—ã¦ã„ãã¾ã™ã€‚ æ›´æ–°ã¯æ¯Žæœˆç¬¬1水曜日（1月ã®ã¿ç¬¬2水曜日）
ã€Œæ „å…‰ã®ã‚°ãƒ©ã‚¹ã‚´ãƒ¼Haskellコンパイルシステム利用ã®æ‰‹å¼•ãã€ã«ã¤ã„ã¦
ã“ã‚Œã¯ã€GHCã®ãƒžãƒ‹ãƒ¥ã‚¢ãƒ«ã§ã‚ã‚‹The Glorious Glasgow Haskell Compilation System User's Guideã®éžå…¬å¼ãªæ—¥æœ¬èªžè¨³ã§ã™ã€‚ 翻訳ã®æ£ç¢ºã•ã«ã¤ã„ã¦ã¯ç„¡ä¿è¨¼ã§ã‚ã‚Šã€å®Ÿéš›ã‚ã‚„ã—ã„ã¨ã“ã‚ãŒã„ãã¤ã‹ã‚ã‚Šã¾ã™ã€‚ã¾ãŸã€å†…容ãŒæœ€æ–°ç‰ˆã‚’åæ˜ ã—ã¦ã„ãªã„å¯èƒ½æ€§ãŒã‹ãªã‚Šã‚ã‚Šã¾ã™ã€‚ãƒãƒ¼ã‚¸ãƒ§ãƒ³ç•ªå·ã«æ³¨æ„ã—ã¦ãã ã•ã„。 ライセンスã¯åŽŸæ–‡ã®ã‚‚ã®ã¨åŒã˜ã¨ã—ã¾ã™ã€‚ã—ãŸãŒã£ã¦å†é…布ã«ã‚ãŸã£ã¦è¨³è€…ã®åå‰ã‚’æ·»ãˆã‚‹å¿…è¦ã¯ã‚ã‚Šã¾ã›ã‚“。 質å•ã€èª¤ã‚Šã®æŒ‡æ‘˜ã€ãŠã‚ˆã³ãれ以外ã®æ”¹å–„案をæ“è¿Žã—ã¾ã™ã€‚掲示æ¿ã«æ›¸ãã“ã‚“ã§ä¸‹ã•ã„。メールã§ã‚‚構ã„ã¾ã›ã‚“。 基本的ã«ã€èª¤ã‚Šã®ä¿®æ£ã‚„訳語ã®å¤‰æ›´ã¯æœ€æ–°ç‰ˆã®ã¿ã«è¡Œã„ã€ä»¥å‰ã®ç‰ˆã«é¡ã£ã¦ã¯ä¿®æ£ã—ã¾ã›ã‚“。 xmlã®åŽŸæ–‡ã¯githubã«ã‚ã‚Šã¾ã™ã€‚ www.kotha.net ãƒãƒ¼ã‚¸ãƒ§ãƒ³ 最新版置ãå ´ 7.8.2 7.6.2 7.6.1 7.4.2 7.4.1 7.2.
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ã€[] (リスト)
Chapters - Learn You a Haskell for Great Good!
Introduction About this tutorial So what's Haskell? What you need to dive in Starting Out Ready, set, go! Baby's first functions An intro to lists Texas ranges I'm a list comprehension Tuples Types and Typeclasses Believe the type Type variables Typeclasses 101 Syntax in Functions Pattern matching Guards, guards! Where!? Let it be Case expressions Recursion Hello recursion! Maximum awesome A few m
Haskell/Category theory - Wikibooks, open books for an open world
This article attempts to give an overview of category theory, insofar as it applies to Haskell. To this end, Haskell code will be given alongside the mathematical definitions. Absolute rigour is not followed; in its place, we seek to give the reader an intuitive feel for what the concepts of category theory are and how they relate to Haskell. A simple category, with three objects A, B and C, three
Applicative勉強ä¸ï¼šApplicativeã¨ãƒ¢ãƒŠãƒ‰ - å–り急ãŽãƒ–ãƒã‚°ã§ã™
昨日ã¯ãƒªã‚¹ãƒˆã¸ã®é–¢æ•°é©ç”¨ã‹ã‚‰Applicativeパターンを見ã¤ã‘ã‚‹ã¨ã“ã‚ã¾ã§ã‚„ã‚Šã¾ã—ãŸã€‚ã§ã‚‚ã€GoFã‚‚ã„ã†ã‚ˆã†ã«ã€ãƒ‘ターンã¨ã„ã‚れるã‹ã‚‰ã«ã¯ã€ã‚ã¡ã“ã¡ã§ä¼¼ãŸã‚ˆã†ãªç”¨ä¾‹ãŒè¦‹ã¤ã‹ã‚‰ãªã„ã¨ãŠã‹ã—ã„ã§ã™ã‚ˆã...è«–æ–‡ã§ã¯ã€ãƒªã‚¹ãƒˆã®ã»ã‹ã«ãƒ¢ãƒŠãƒ‰ã‚‚例ã¨ã—ã¦å–り上ã’ã¦ã„ã¾ã™ã€‚先日話ã—ãŸap関数ãŒãƒ¢ãƒŠãƒ‰ã§ã®<*>ã«ã‚ãŸã‚Šã¾ã™ï¼š ap :: Monad m => m (a -> b) -> m a -> m b ap :: (Monad m) => m (a -> b) -> m a -> m b ap = liftM2 id liftM2 :: (Monad m) => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r liftM2 f m1 m2 = do { x1 <- m1; x2 <- m2; return (f x1 x2) } ã¨ã„ã†ã®ãŒapã®å®šç¾©ã§ã—ãŸã€‚ ãã—ã¦
経験15å¹´ã®OCaml ユーザー㌠Haskell を仕事ã§åŠå¹´ä½¿ã£ã¦ã¿ãŸ - camlspotter’s blog
今ã®ä¼šç¤¾ã«ç§»ã£ã¦åŠå¹´çµŒã¡ã¾ã—ãŸã€‚ã‚ã§ãŸã試用期間終了ã§ã™ã€‚ã¨ã„ã£ã¦ã‚‚別ã«è©¦ç”¨æœŸé–“ä¸ã«å¯†ã‹ã«é¦–を切られるよã†ãªäº‹ã‚’ã—ãŸã¨ã‹ã€é€†ã«è©¦ç”¨æœŸé–“ãŒçµ‚ã‚ã£ãŸã‹ã‚‰ã¨è¨€ã£ã¦ã“ã‚Œã§å®šå¹´ã¾ã§ã®ã†ã®ã†ã¨åƒã‘ã‚‹ã€ã¨ã„ã†è¨³ã§ã¯ã‚ã‚Šã¾ã›ã‚“。未æ¥ã¯å…¨ã判りã¾ã›ã‚“。ã¾ã‚ã¨ã«ã‹ãã€ä¸€ã¤åŒºåˆ‡ã‚ŠãŒã‚„ã£ã¦ãã¾ã—ãŸã€‚ 金èžã‚’知らãªã„Quantsã®ä»•äº‹ ç§ã®è·æ¥ã®è‚©æ›¸ãã«ã¯ Quantitatitatitatitative ã¨ã„ã†å˜èªžãŒãã£ã¤ã„ã¦è¶…カッコよã•ãã†ã€‚普通㯠Quant ã¨ã„ã†ã¨ã€é‡‘èžå·¥å¦ã‚„統計数ç†ã«è©³ã—ã„夜もブイブイã„ã‚ã—ã¦ã„る超イケメン20代を想åƒã—ã¾ã™ãŒã€ç§ã¯é‡‘èžã¨ã‹å…¨ç„¶çŸ¥ã‚‰ãªã„アラフォーãŠçˆ¶ã•ã‚“ã§ã™ã€‚ãã‚Œã§ã‚‚ Quant ã§ã™ã€‚ãŠé¡˜ã„ã§ã™ã‹ã‚‰ã€ç§ã«ä½•ã‚’è²·ã£ãŸã‚‰ã„ã„ã‹ã¨ã‹ã€èžã‹ãªã„ã§ãã ã•ã„。金èžå•†å“ã¨ã‹è²·ã£ãŸäº‹ãªã„ã—。ã¨ã„ã†ã‹ã€é€†ã«æ•™ãˆã¦æ¬²ã—ã„ã§ã™ã€‚ ç§ã®ãƒãƒ¼ãƒ ã¯ã€æœ¬å½“ã® Quant ã•ã‚“é”ãŒé–‹ç™ºã—ãŸã€é‡‘èžæ´¾ç”Ÿå•†
perl & javascript - ã§å˜ãªã‚‹è‡ªå·±é–¢æ‰‹ã®åœã«ãŠã‘るモノイド対象(笑) : 404 Blog Not Found
2010å¹´05月19æ—¥20:00 カテゴリLightweight Languages perl & javascript - ã§å˜ãªã‚‹è‡ªå·±é–¢æ‰‹ã®åœã«ãŠã‘るモノイド対象(笑) å‚ç…§é€éŽæ€§ãµã„ãŸwww ä¸å®Œå…¨ã«ã—ã¦ãŠã‚ˆãæ£ã—ããªã„プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžå°å² 1990 ? サイモン・ペイトン・ジョーンズã€ãƒãƒ¼ãƒ«ãƒ»ãƒ•ãƒ€ãƒƒã‚¯ã€ãƒ•ã‚£ãƒªãƒƒãƒ—・ワドラーã€ãƒ‡ãƒŸãƒ»ãƒ ーアã®å¤«ã€ãªã‚‰ã³ã«å‹•ç‰©ã®å€«ç†çš„扱ã„を求ã‚る人々ã«ã‚ˆã£ã¦æ§‹æˆã•ã‚Œã‚‹å§”員会ã«ã‚ˆã‚Šã€é…延評価を行ã†ç´”粋ãªé–¢æ•°åž‹è¨€èªžHaskellãŒä½œã‚‰ã‚Œã‚‹ã€‚副作用ã®åˆ¶å¾¡ã«ä½¿ã‚れるモナドã®è¤‡é›‘ã•ã®ãŸã‚ã€Haskellã«ã¯æŠµæŠ—ã‚’æŒã¤äººã€…ãŒã„る。ワドラーã¯æ‰¹åˆ¤ã‚’和らã’ã‚‹ãŸã‚ã«ã€ã“ã†èªžã£ã¦ã„る。「モナドã¯å˜ãªã‚‹è‡ªå·±é–¢æ‰‹ã®åœã«ãŠã‘るモノイド対象ã よ。何ã‹å•é¡Œã§ã‚‚？〠「何ã‹å•é¡Œã§ã‚‚ã€ã¨è¨€ã‚ã‚ŒãŸå ´åˆã¯ã€è‡ªåˆ†ã®å•é¡Œã«ã—ã¦è§£ã„ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¦ã„る。 ã¨ã„ã†ã‚ã‘ã§IOモナドをJSã¨Perlã§
All About Monads モナドã®ã™ã¹ã¦
モナドã®ã™ã¹ã¦ Haskell ã«ãŠã‘るモナドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…括的ガイド Version 1.1.0 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚念ã¨ãã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘る応用㫠ã¤ã„ã¦ã€åˆä¸ç´šã® Haskell プãƒã‚°ãƒ©ãƒžã«ã‚ã‹ã‚Šã‚„ã™ãã€åˆ©ç”¨ä¾¡å€¤ãŒã‚るよã†ãª 解説をã™ã‚‹ã“ã¨ã‚’æ—¨ã¨ã—ã¦ã„ã¾ã™ã€‚èªè€…㯠Haskell ã«ãªã‚Œã¦ã„ã‚‹ã“ã¨ã‚’å‰æ㨠ã—ã¾ã™ãŒã€ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹çµŒé¨“ã¯è¦æ±‚ã—ã¦ã„ã¾ã›ã‚“。ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€å¤š ãã®é¡Œæã‚’ã‚«ãƒãƒ¼ã—ã¦ã„ã¾ã™ã€‚後åŠã®ã‚»ã‚¯ã‚·ãƒ§ãƒ³ã§ã¯ã€å‰åŠã®é¡Œæをよãç†è§£ã— ã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ã—ã¾ã™ã€‚é †ã‚’ãŠã£ã¦ã€ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’例示ã™ã‚‹ãŸã‚ ã®ã‚µãƒ³ãƒ—ルコードãŒãŸãã•ã‚“用æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚一èªã§ã€ã™ã¹ã¦ã®é¡Œæã‚’å¸åŽã— よã†ã¨ã„ã†ã®ã¯ãŠå‹§ã‚ã§ãã¾ã›ã‚“。 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ 3 ã¤ã®éƒ¨åˆ†ã§æ§‹æˆã•ã‚Œã¦ã„ã¾ã™ã€‚最åˆã®éƒ¨åˆ†ã¯ã€ 関数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘るモナドã®åŸºæœ¬çš„
Arrowã®å¿ƒ - 2007-08-16 - mad日記
昨日ã®ç¶šãã§ã™ã€‚記法ãŒã‚ˆã„ã¨ã‹Monadã¿ãŸã„ã«å‰¯ä½œç”¨ãŒæ‰±ãˆã‚‹ã¨ã‹è¨€ã£ãŸãƒ¡ãƒªãƒƒãƒˆã‚’ã¯ã‚‹ã‹ã«è¶ŠãˆãŸArrowã®ç´ 晴らã—ã•ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã™ã€‚ reverse.reverse == id ã‹? 自分ãŒæœ€åˆã«Arrowã£ã¦ã™ã”ã„ã¨æ°—ã¥ã„ãŸå•é¡ŒãŒã“ã‚Œã§ã™ã€‚大å¦ã§åŒç´šç”Ÿã¨è©±ã—ã¦ã„る時ã«æ°—ã¥ãã¾ã—ãŸã€‚大ã—ã¦å½¹ã«ç«‹ã¤ä¾‹ã§ã¯ç„¡ã„ã§ã™ãŒã€Arrowã®æ–°ã—ã„å´é¢ãŒè¦‹ãˆã¦ãる例ã§ã™ã€‚ 標準入力ã«å¯¾ã—ã¦reverse,reverse,headã‚’é †ã«å®Ÿè¡Œã—ã¦çµæžœã‚’出力ã™ã‚‹ã‚³ãƒ¼ãƒ‰ã¯ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚後ã®æ¯”較ã®ç‚ºã«æ•¢ãˆã¦Arrowã§æ›¸ã„ã¦ã„ã¾ã™ã€‚ import Control.Arrow main :: IO () main = getContents >>= print. (reverse >>> reverse >>> head) リストを２回ã²ã£ãã‚Šè¿”ã—ãŸã‚‰å…ƒã«æˆ»ã‚‹ã ã‘ãªã®ã§ã€ãã®headã‚’ã¨ã‚‹ã¨ã„ã†è¨ˆç®—ã¯ä¸€
Neil Mitchell - HLint
HLint (formerly Dr. Haskell) reads Haskell programs and suggests changes that hopefully make them easier to read. HLint also makes it easy to disable unwanted suggestions, and to add your own custom suggestions. Running the tool over the darcs source code, we can generate an interactive report with --report, or view the results in the console: $ hlint darcs-2.1.2 CommandLine.lhs:49:1: Warning, eta
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
Happy Haskell programming on Emacs
The ghc-mod command and ghc-modi command are backend commands to enrich Haskell programming on editors including Emacs, Vim, and Sublime. ghc-mod and ghc-modi are based on the ghc-mod library which is a wrapper of GHC API and Cabal. The ghc-mod package on Hackage includes the ghc-mod command, the ghc-modi command, the ghc-mod library, and Emacs front-end (for historical reasons). The source reposi
jQueryã¯ãƒ¢ãƒŠãƒ‰ã - id:anatooã®ãƒ–ãƒã‚°
ã“ã®è¨˜äº‹ã¯jQuery is a Monad | Important Shockã¨ã„ã†è¨˜äº‹ã®å‹æ‰‹è¨³ã§ã™ã€‚ 追記1: bonotakeã•ã‚“ãŒè£œè¶³è¨˜äº‹ã‚’書ã„ã¦ãã‚Œã¦ã„ã¾ã™ → JQueryãŒãƒ¢ãƒŠãƒ‰ã‹ã©ã†ã‹ã¨ã‹ - ãŸã‘ã‚’ã®æ—¥è¨˜ï¼ 天竺ã‹ã‚‰å¸°ã£ã¦ããŸã‚ˆ 追記2: hirataraã•ã‚“ãŒè£œè¶³è¨˜äº‹ã‚’書ã„ã¦ãã‚Œã¦ã„ã¾ã™ → jQueryã¯æœ¬å½“ã«ãƒ¢ãƒŠãƒ‰ã ã£ãŸ - 北海é“è‹«å°ç‰§å¸‚出身ã®PGãŒæ›¸ãブãƒã‚° Haskellプãƒã‚°ãƒ©ãƒžãƒ¼ã¯èª°ã—ã‚‚ãŒãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹å„々ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’書ãã¨è¨€ã‚れる。ã¨ã„ã†ã®ã‚‚ã€ä¸€åº¦ãƒ¢ãƒŠãƒ‰ã®å®šç¾©ã¨ãã®å¯èƒ½æ€§ã‚’ç†è§£ã™ã‚Œã°ã€ãƒ¢ãƒŠãƒ‰å…¨ä½“を囲む神秘性ã«æŒ‘戦ã—ã¦æ‰“ã¡ç ´ã‚‹ã®ãŒå®¹æ˜“ã«ãªã‚‹ã‹ã‚‰ã 。門外漢ã‹ã‚‰ã™ã‚Œã°ã€ãƒ¢ãƒŠãƒ‰ã¯Haskellを真ã«ç†è§£ã™ã‚‹ã“ã¨ã‚’妨ã’ã‚‹ä¸å¯è§£ãªéšœå£ã 。モナドã¯ã¨ã¦ã‚‚ä¸é©å½“ãªåå‰ã§å‘ªã‚ã‚Œã¦ã„ã¦ã€ä¸€é¢¨å¤‰ã‚ã£ãŸæ–‡æ³•ã‚’æŒã¡ã€ä¸€åº¦ã«ä½•ã‚‚ã‹ã‚‚ã‚„ã£ã¦ã—ã¾ã†æ§˜ã«è¦‹ãˆã‚‹ã€‚ã—ã‹ã—ãªãŒã‚‰ã€ãã®å‹•ã
メンテナンス
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GHC/GHCi - HaskellWiki
Comparing concurrent linked-list implementations in Haskell
mongoDB
{{#tags}}- {{label}}
{{/tags}}