[B! haskell] KGAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

KGA id:KGA

haskellã«é–¢ã™ã‚‹KGAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (47)

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

ã‚¢ãƒŠã‚°ãƒ©ãƒ - HaHaHa!
Haskellã‚‰ã—ã•ã£ã¦ãªã‚“ã ã‚ã†ã¨ã„ã†ã“ã¨ã‚’è€ƒãˆã¤ã¤ï¼Œ[id:yard:20091104]ã«ã‚ã‚‹èª²é¡Œã‚’è§£ããƒ—ãƒã‚°ãƒ©ãƒ ã‚’è€ƒãˆã‚‹éŽç¨‹ã‚’è¨˜éŒ²ã—ã¦ã¿ãŸï¼Žæ•´ç†ã—ã¦ã„ãªã„ã®ã§ã¨ã‚Šã¨ã‚ãŒãªã„ã§ã™ï¼Ž å˜èªžè¾žæ›¸ã‹ã‚‰ç›¸äº’ã«ã‚¢ãƒŠã‚°ãƒ©ãƒ ã«ãªã£ã¦ã„ã‚‹å˜èªžã‚’é›†ã‚ã‚‹ï¼Ž ã‚¢ãƒŠã‚°ãƒ©ãƒ ã¨ã¯ï¼Œ(æ„å‘³ã®ã‚ã‚‹)å˜èªžã®æ–‡å—ã‚’ãªã‚‰ã³å¤‰ãˆã¦ã§ããŸåˆ¥ã®(æ„å‘³ã®ã‚ã‚‹)å˜èªžã®ã“ã¨ï¼Ž ã•ã¦ï¼Œ2ã¤ã®å˜èªžãŒç›¸äº’ã«ã‚¢ãƒŠã‚°ãƒ©ãƒ ã«ãªã£ã¦ã„ã‚‹ã“ã¨ã¯ã©ã†åˆ¤å®šã™ã‚‹ï¼Ž2ã¤ã®å˜èªžãŒåŒã˜æ–‡å—ã‚’å«ã‚“ã§ã„ã‚Œã°ã‚ˆã„ï¼Žãªã‚‰ï¼Œãã‚Œãžã‚Œã®æ–‡å—åˆ—ã‚’æ–‡å—ã§ã‚½ãƒ¼ãƒˆã™ã‚Œã°åŒã˜ã«ãªã‚‹ï¼Ž ãã†ã‹ï¼Žå˜èªžã«å˜èªžã‚’æ–‡å—ã§ã‚½ãƒ¼ãƒˆã—ãŸã‚‚ã®ã‚’å±žæ€§ã¨ã—ã¦ä»˜åŠ ã—ã¦ãŠã„ã¦ï¼Œã“ã®å±žæ€§ã§å˜èªžè¾žæ›¸ã‚’ã‚½ãƒ¼ãƒˆã™ã‚Œã°ï¼Œã‚¢ãƒŠã‚°ãƒ©ãƒ ã«ãªã£ã¦ã„ã‚‹å˜èªžã¯éš£æŽ¥ã™ã‚‹ã“ã¨ã«ãªã‚‹ã‚ˆãªï¼Ž å±žæ€§ã®ä»˜åŠ ã¯ï¼Œã‚ˆãã‚ã‚‹ãƒ‘ã‚¿ãƒ¼ãƒ³ã ã‚ˆãªï¼Ž addAttr :: (a -> b) -> a -> (a, b) addAttr = ((,) <*>)
KGA 2009/11/14
programming

haskell
ãƒªãƒ³ã‚¯
ã‚¯ãƒ¬ã‚¸ãƒƒãƒˆã‚«ãƒ¼ãƒ‰ç•ªå·ã® Check Digit - HaHaHa!
ã‚¯ãƒ¬ã‚¸ãƒƒãƒˆã‚«ãƒ¼ãƒ‰ç•ªå·ã®æœ€å¾Œã®æ¡ã¯ãƒã‚§ãƒƒã‚¯ç”¨ã®æ¡ã§ã™ï¼Žãƒã‚§ãƒƒã‚¯ã¯ï¼Œã‚¯ãƒ¬ã‚¸ãƒƒãƒˆç•ªå·ã‚’ä¸€æ¡ãŠãã«å€ã«ã—ã¦ï¼ˆ10ä»¥ä¸Šã®å ´åˆã¯9ã‚’å¼•ã„ã¦ï¼‰è¶³ã—åˆã›ãã‚ŒãŒ10ã§å‰²ã‚Šåˆ‡ã‚Œã‚‹ã‹ã©ã†ã‹ã‚’çŸ¥ã‚‰ã¹ã‚‹ã‚‚ã®ã§ã™ï¼ŽãŸã ã—ï¼Œæœ€å¾Œã®ãƒã‚§ãƒƒã‚¯ç”¨ã®æ¡ã‚’å€ã«ã™ã‚‹ã“ã¨ãŒãªã„ã‚ˆã†ã«ï¼Œç•ªå·ã®æ¡æ•°ã«å¿œã˜ã¦(13ã€œ16æ¡)ã«å¿œã˜ã¦å¥‡æ•°æ¡ç›®ã‚’å€ã«ã™ã‚‹ã‹ï¼Œå¶æ•°æ¡ç›®ã‚’å€ã«ã™ã‚‹ã‹ã‚’æ±ºå®šã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã¨ã„ã†ã¨ã“ã‚ãŒãƒŸã‚½ï¼Žã•ã£ããHaskellã§æ›¸ã„ã¦ã¿ã¾ã™ï¼Ž isValid :: [Int] -> Bool isValid = (0==) . (`mod` 10) . checksum dbl :: Int -> Int -- å€ã™ã‚‹é–¢æ•° dbl x = let x2 = x * 2 in if x2 < 10 then x2 else x2 - 9 checksum :: [Int] -> Int checksum ã¯ã„ã‚ã„ã‚è€ƒãˆã‚‰ã‚Œã¦é¢ç™½ãã†
KGA 2009/05/28
haskell
ãƒªãƒ³ã‚¯
Former Staff - School of Computing - University of Kent
(You may have been redirected to this web page if you were trying to locate material published by a former member of the department.) Staff are asked to provide follow-on em ail address and web site details using this form so that they can be contacted once they have left the university. This information is listed below (where available). Former staff are encouraged to help us keep this information
KGA 2009/02/18
vim

haskell
ãƒªãƒ³ã‚¯
http://ja.doukaku.org/wiki/index.php/Haskell_Hackathon_2008
KGA 2008/10/16
haskell
ãƒªãƒ³ã‚¯
Haskell - Wikibooks, open books for an open world
This book has a collection for ordering a printed copy of this book for a fee. (edit) (help) Haskell is a featured book on Wikibooks because it contains substantial content, it is well-formatted, and the Wikibooks community has decided to feature it on the main page or in other places. Please continue to improve it and thanks for the great work so far! You can edit its advertisement template. Hask
KGA 2008/10/15
haskell
ãƒªãƒ³ã‚¯
[haskell] How To Arrow3 é¸æŠž - è¨€èªžã‚²ãƒ¼ãƒ
import Control.Arrow newtype SF a b = SF {runSF ::[a]->[b]} instance Arrow SF where arr f = SF (map f) SF f >>> SF g = SF (f >>> g) first (SF f) = SF (unzip >>> first f >>> uncurry zip) instance ArrowChoice SF where left (SF f) = SF(\xs -> combine xs (f [y | Left y <- xs])) where combine (Left y:xs) (z:zs) = Left z: combine xs zs combine (Right y:xs) zs = Right y: combine xs zs combine [] zs = []
KGA 2008/10/13
haskell

arrow
ãƒªãƒ³ã‚¯
[haskell] How To Arrow2 ä¸¦ç½® - è¨€èªžã‚²ãƒ¼ãƒ
import Control.Arrow newtype SF a b = SF {runSF ::[a]->[b]} instance Arrow SF where arr f = SF (map f) SF f >>> SF g = SF (f >>> g) first (SF f) = SF (unzip >>> first f >>> uncurry zip) -- ã§ã¯ã‚„ã‚„ã“ã—ã„è©±ã®å‰ã«ã€Arrow ã®åˆ©ç‚¹ã‚’å¼·èª¿ã™ã‚‹ä¾‹ã€‚å‘ã“ã†ã‹ã‚‰ã‚„ã£ã¦ -- æ¥ãŸæ•°å—ã®å€¤ã‚’äºŒå€ã—ãŸã„ã€‚ã‚„ã£ã¦ãã‚‹ã®ã¯æ•°å—ã¨åˆ†ã‹ã£ã¦ã„ã‚‹ãŒã€æ•°å— -- ã¯ä¸€ã¤ã‹ã‚‚çŸ¥ã‚Œãªã„ã—ã€ãƒªã‚¹ãƒˆã«å…¥ã£ã¦ã„ã‚‹ã‹ã‚‚çŸ¥ã‚Œãªã„ã—ã€IO æ“ä½œã«é–¢ -- ã™ã‚‹ç‰©ã‹ã‚‚çŸ¥ã‚Œãªã„ã€‚ãªã‚“ã¨ Arrow ã‚’ä½¿ã†ã¨ã€åŒã˜å®šç¾©ãŒã€ãƒªã‚¹ãƒˆã«ã‚‚ã‚¹ -- ã‚«ãƒ©ã«ã‚‚(å¤šåˆ†ãƒ¢ãƒŠãƒ‰ã«ã‚‚)ä½¿ãˆã‚‹ï¼ã“ã“æ„Ÿå‹•ã™ã‚‹æ‰€ã§ã™ï¼ double :: (Arrow a, Num b)
KGA 2008/10/13
haskell

arrow
ãƒªãƒ³ã‚¯
[haskell] How To Arrow åŸºæœ¬ - è¨€èªžã‚²ãƒ¼ãƒ
http://d.hatena.ne.jp/propella/20070807/p1 1:åŸºæœ¬ http://d.hatena.ne.jp/propella/20070807/p2 2:ä¸¦ç½® http://d.hatena.ne.jp/propella/20070808/p1 3:é¸æŠž -- ãªã‚“ã‹çŸ¥ã‚‰ã‚“ã†ã¡ã« Arrow æµè¡Œã£ã¦ã‚‹ã‚ˆã†ãªã®ã§è©¦ã—ã¦ã¿ã‚‹ã€‚ -- http://www.cs.chalmers.se/~rjmh/afp-arrows.pdf ã«ã‚ˆã‚‹ã¨ã€ãƒã‚¤ãƒ³ãƒˆãƒ• -- ãƒªãƒ¼ã‚¹ã‚¿ã‚¤ãƒ«ã« IO ã‚’æ··ãœã‚‹ã®ãŒ Arrow ã ã¨è€ƒãˆã‚Œã°ã‚ˆã„ã‚‰ã—ã„ã€‚ import Control.Arrow -- Arrow ã§ã¯é«˜éšŽåž‹ã‚’ä½¿ã„ã¾ãã‚‹ã®ã§æ…£ã‚Œãªã„ã¨ã¡ã‚‡ã£ã¨æã‚ã—ãè¦‹ãˆã‚‹ã€‚ -- Arrow ã¯ Monad ã¨åŒã˜ãã‚¯ãƒ©ã‚¹ã ãŒã€Haskell ã§è¨€ã†ã‚¯ãƒ©ã‚¹ã¨ã¯ä»–ã§ã„ã† -- ã‚¤ãƒ³ã‚¿ãƒ•ã‚§ãƒ¼ã‚¹
KGA 2008/10/13
haskell

arrow
ãƒªãƒ³ã‚¯
Haskell/Understanding arrows - Wikibooks, open books for an open world
We have permission to import material from the Haskell arrows page. See the talk page for details. Arrows, like monads, express computations that happen within a context. However, they are a more general abstraction than monads, and thus allow for contexts beyond what the Monad class makes possible. The essential difference between the abstractions can be summed up thus: Just as we think of a mona
KGA 2008/10/13
haskell

arrow
ãƒªãƒ³ã‚¯
Arrowã«ã‚ˆã‚‹Haskellãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®åŸºç¤Žã€‚â€¦ãƒ‘ã‚¤ãƒ—æ„Ÿè¦šã§é †æ¬¡/åˆ†å²/ç¹°è¿”ã— - ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“
Programming with Arrowsã‚’èªã‚“ã§ç†è§£ã—ãŸã¤ã‚‚ã‚Šã®ãƒ¡ãƒ¢ã€‚èª¤ã‚Šãªã©ä¹žã†ã”æŒ‡æ‘˜ã€‚ ï¼ˆå¾©ç¿’ï¼‰Arrowã£ã¦ãªã«ï¼Ÿ ã¨æ€ã£ã¦ä»¥å‰èª¿ã¹ãŸãƒ¡ãƒ¢ãŒ"3åˆ†ã§è§£ã‚‹Haskellã®Arrowã®åŸºæœ¬ãƒ¡ãƒ¢ - ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“"ã€‚ãã‚Œã«ã¡ã‚‡ã£ã¨è£œè¶³ã¨ã„ã†ã‹è¦³ç‚¹ã‚’å¤‰ãˆã¦ã¾ãšæ„Ÿè¦šã®æ•´ç†ã€‚ Monadã«è‰²ã‚“ãªç¨®é¡žãŒã‚ã‚‹ã‚ˆã†ã«ã€Arrowã‚‚è‰²ã‚“ãªç¨®é¡žãŒã‚ã‚‹ã€‚ Monad: IOã€Maybeã€â€¦ Arrow: é–¢æ•°ãã®ã¾ã‚“ã¾(->)ã€Kleisli mã€â€¦ ã‚ã‚‹ç¨®é¡žã®Monadã«è‰²ã‚“ãªåž‹ã®è‰²ã‚“ãªå€¤ã‚’å…¥ã‚Œã‚‰ã‚Œã‚‹ã‚ˆã†ã«ã€ã‚ã‚‹ç¨®é¡žã®Arrowã«è‰²ã‚“ãªåž‹ã®è‰²ã‚“ãªé–¢æ•°ã‚’å…¥ã‚Œã‚‰ã‚Œã‚‹ã€‚ Monad: Maybeã®ä¾‹â†’ ã€ŒMaybe Intã€ ã«return 0ã‚‚return 777ã‚‚ï¼¯ï¼«ã€‚ã€ŒMaybe Charã€ ã«return 'a'ã‚‚return ' 'ã‚‚ï¼¯ï¼«ã€‚ Arrow: (->)ã®ä¾‹â†’ ã€ŒInt -> In
KGA 2008/10/13
haskell

arrow
ãƒªãƒ³ã‚¯
3åˆ†ã§è§£ã‚‹Haskellã®Arrowã®åŸºæœ¬ãƒ¡ãƒ¢ - ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“
æ—¥æœ¬èªžã§Arrowã®èª¬æ˜ŽãŒã‚ã¾ã‚Šè¦‹ä»˜ã‹ã‚‰ãªã‹ã£ãŸã®ã§ã€Haskell/Understanding arrows - Wikibooks, open books for an open worldã‚’èªã‚“ã§ç†è§£ã—ãŸã¤ã‚‚ã‚Šã®ãƒ¡ãƒ¢ã€‚ã‚ªãƒªã‚¸ãƒŠãƒ«ã®å›³ã‚’è¦‹ãªãŒã‚‰ã ã¨åˆ†ã‹ã‚Šã‚„ã™ã„ã‹ã‚‚ã€‚èª¤ã‚Šãƒ»é–“é•ã„ãªã©ã€ä¹žã†ã”æŒ‡æ‘˜ã€‚ b->cãªé–¢æ•°ã‚’Arrowãªã‚‹ã‹ã‚‰ãã‚Šç®±ã«å…¥ã‚Œã‚‹ã¨ã€ (Arrow a) => a b c ã“ã‚“ãªåž‹ã«ãªã‚‹ã€‚åž‹ãƒ‘ãƒ©ãƒ¡ã‚¿ãŒã€å¼•æ•°ã®bã¨è¿”å€¤ã®cã®ãµãŸã¤ã€‚ Monadã¯ã€å€¤ã‚’ã‹ã‚‰ãã‚Šç®±ã«å…¥ã‚ŒãŸã‚‚ã®ã€‚ã‹ã‚‰ãã‚Šç®±ã¯åŸºæœ¬çš„ã«(ãƒ˜ãƒ³ãª)å€¤ã€‚ Arrowã¯ã€é–¢æ•°ã‚’ã‹ã‚‰ãã‚Šç®±ã«å…¥ã‚ŒãŸã‚‚ã®ã€‚ã‹ã‚‰ãã‚Šç®±ã¯åŸºæœ¬çš„ã«(ãƒ˜ãƒ³ãª)é–¢æ•°ã€‚ arr :: (b -> c) -> a b c Monadã§ã¯ã€å€¤ã‚’ã‹ã‚‰ãã‚Šç®±ã«å…¥ã‚Œã‚‹é–¢æ•°returnãŒã‚ã‚‹ã€‚ Arrowã§ã¯ã€é–¢æ•°ã‚’ã‹ã‚‰ãã‚Šç®±ã«å…¥ã‚Œã‚‹é–¢æ•°arrãŒã‚ã‚‹ã€‚ (>>>)
KGA 2008/10/13
haskell

arrow
ãƒªãƒ³ã‚¯
http://ja.doukaku.org/comment/7775/
KGA 2008/10/11
haskell

nobsun
ãƒªãƒ³ã‚¯
æœ‰åãªHaskellãƒ—ãƒã‚°ãƒ©ãƒ Top10 - Gemmaã®æ—¥è¨˜
1.Darcs Darcsã¯ã€subversionã‚„mercurialãƒ©ã‚¤ã‚¯ãªãƒãƒ¼ã‚¸ãƒ§ãƒ³ç®¡ç†ã‚·ã‚¹ãƒ†ãƒ ã§ã‚ã‚‹ã€‚ ä»–ã¨é•ã£ã¦ã€Darcsã¯é«˜åº¦ã§ãƒ¦ãƒ‹ãƒ¼ã‚¯ãªãƒ‘ãƒƒãƒä»£æ•°ã«åŸºã¥ã„ã¦ãŠã‚Šã€ãƒ–ãƒ©ãƒ³ãƒã®æ‰±ã„ãŒæ˜Žå¿«ã§ã‚ã‚‹ã¨ã„ã£ãŸç‰¹å¾´ãŒã‚ã‚‹ã€‚ 2.Hpodder Hpodderã¯ã€ã‚³ãƒžãƒ³ãƒ‰ãƒ©ã‚¤ãƒ³ã®podcastã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆ(podcastã‚’ã‚¹ã‚ãƒ£ãƒ³ã—ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã™ã‚‹ãŸã‚ã®ãƒ„ãƒ¼ãƒ«)ã§ã‚ã‚‹ã€‚ John Goerzenä½œã€‚ 3.dfsbuild dfsbuildã¯ã€Debian From Scratch(DFS)ã®CDã‚¤ãƒ¡ãƒ¼ã‚¸ã‚’ç”Ÿæˆã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã§ã‚ã‚‹ã€‚ ç´°ã‹ã„è¨å®šãŒã§ãã‚‹ã®ãŒç‰¹å¾´ã€‚John Goerzenä½œã€‚ 4.Pugs Pugsã¯Perl6ã®å®Ÿè£…ã§ã‚ã‚Šã€GHCæ‹¡å¼µã®Haskellã§æ›¸ã‹ã‚Œã¦ã„ã‚‹ã€‚ Perl6ã®å…¨ä»•æ§˜ã‚’å®Ÿè£…ã—ã‚ˆã†ã¨ã—ã¦ã„ã‚‹ã€‚ 5.srcinst srcinstã¯Debianã®ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã‚’ã™ã¹ã¦ã‚½
KGA 2008/10/06
haskell
ãƒªãƒ³ã‚¯
Haskell XML Toolbox 9.2.0
Contents Introduction Description Documentation Requirements Download Installation Known probl ems and limitations Portability HXT with Filters Related Work Feedback Introduction The Haskell XML Toolbox is a collection of tools for processing XML with Haskell. It is purely written in Haskell. The Haskell XML Toolbox is a project of the University of Applied Sciences Wedel, The main design goal of t
KGA 2008/10/06
haskell

xml
ãƒªãƒ³ã‚¯
æœ¬ç‰©ã®ãƒ—ãƒã‚°ãƒ©ãƒžã¯Haskellã‚’ä½¿ã†ï¼šITpro
ç†è€… shelarcy Haskellã¯ï¼Œé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã„ã†ã‚¸ãƒ£ãƒ³ãƒ«ã«å±žã™ã‚‹è¨€èªžã§ã™ã€‚Haskellã‚„é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’é¡Œæã«ç‰©äº‹ã‚’è¦‹ã¦ã„ãã“ã¨ã§ï¼Œä»Šã¾ã§æ€ã„ã‚‚ã‚ˆã‚‰ãªã‹ã£ãŸã‚ˆã†ãªæœªçŸ¥ã®ä¸–ç•Œã‚’çŸ¥ã‚‹ã“ã¨ãŒã§ãã‚‹ã§ã—ã‚‡ã†ã€‚ ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã‚’å¦ã¶ã¨ã„ã†è¡Œç‚ºã«ã¯ï¼Œ è¨€èªžã®åŸºæœ¬çš„ãªæ–‡æ³•ã‚„è€ƒãˆæ–¹ã‚’ç†è§£ã™ã‚‹ è¨€èªžã®æ–‡åŒ–åœã§åºƒãä½¿ã‚ã‚Œã¦ã„ã‚‹è€ƒãˆæ–¹ã«è¦ªã—ã‚“ã§ãã®è¨€èªžã‚‰ã—ã„æ›¸ãæ–¹ã‚’ç¿’å¾—ã™ã‚‹ å˜ã«è¨€èªžã‚’ä½¿ã£ã¦ã§ãã‚‹ã“ã¨ä»¥ä¸Šã®çŸ¥æµã‚’å¦ã¶ ã®3æ®µéšŽãŒã‚ã‚Šã¾ã™ã€‚ã“ã®é€£è¼‰ã§ã¯ï¼Œä¸‰ã¤ç›®ã®æ®µéšŽã‚’ç›®æ¨™ã«ï¼ŒHaskellãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ä¸–ç•Œã‚’ä¸€ã¤ã²ã¨ã¤ä¸å¯§ã«ç´¹ä»‹ã—ã¦ã„ãã¾ã™ã€‚ æ›´æ–°ã¯æ¯Žæœˆç¬¬1æ°´æ›œæ—¥ï¼ˆ1æœˆã®ã¿ç¬¬2æ°´æ›œæ—¥ï¼‰
KGA 2008/10/06
haskell
ãƒªãƒ³ã‚¯
ãƒ—ãƒã‚°ãƒ©ãƒ ãƒ»ãƒ—ãƒãƒ ãƒŠãƒ¼ãƒ‰
ä¼šèªŒã€Œæƒ…å ±å‡¦ç†ã€é€£è¼‰ã®ã€Œãƒ—ãƒã‚°ãƒ©ãƒ ãƒ»ãƒ—ãƒãƒ ãƒŠãƒ¼ãƒ‰ã€ï¼ˆ2002å¹´4æœˆã€œ2005å¹´3æœˆæŽ²è¼‰ï¼‰ã¨ã€ŒHaskellãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€ï¼ˆ2005å¹´4æœˆã€œ2006å¹´3æœˆæŽ²è¼‰ï¼‰ã¯ã©ãªãŸã§ã‚‚ã”è¦§ã«ãªã‚Œã¾ã™ã€‚ãƒ•ã‚¡ã‚¤ãƒ«ã¯ã™ã¹ã¦PDFå½¢å¼ã§ã™ã€‚ ã€ŒHaskellãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€ã«æŽ²è¼‰ã•ã‚ŒãŸãƒ—ãƒã‚°ãƒ©ãƒ ã¯ http://www.sampou.org/haskell/ipsj/ ã‹ã‚‰å–ã‚‹ã“ã¨ãŒã§ãã¾ã™.
KGA 2008/10/06
haskell
ãƒªãƒ³ã‚¯
Haskell: QuickCheckã®æ„å¤–ãªä½¿ã„æ–¹ - Accept Things
QuickCheckã¯æƒ³åƒä»¥ä¸Šã«ãƒ‘ãƒ¯ãƒ•ãƒ«ãªãƒ„ãƒ¼ãƒ«ã ã€‚å˜ã«ãƒ†ã‚¹ãƒˆã‚’ã—ã¦ãã‚Œã‚‹ã ã‘ã®ãƒ„ãƒ¼ãƒ«ã˜ã‚ƒãªã„ã€‚ ä»¥ä¸‹ã®æ–‡æ›¸ã‚’èªã‚€ã¨ã€QuickCheckã®æ„å¤–ãªä½¿ã„æ–¹ãŒæ›¸ã„ã¦ã‚ã£ãŸã€‚Haskellä»¥å¤–ã®ãƒ—ãƒã‚°ãƒ©ãƒžãƒ¼ã‚‚ç›®ã‚’é€šã™ã“ã¨ã‚’ãŠã™ã™ã‚ã™ã‚‹ã€‚ QuickCheck as a test set generator ã“ã®æ–‡æ›¸ã§èª¬æ˜Žã•ã‚Œã¦ã„ã‚‹ä¾‹ã¯å‡„ã„ã€‚ã‚ã‚‹ãƒ‘ãƒ¼ã‚µã«å…¥åŠ›ã™ã‚‹ãŸã‚ã®ãƒ†ã‚ã‚¹ãƒˆ(ã‚ã‚‹è¨€èªžã®ã‚¹ãƒ†ãƒ¼ãƒˆãƒ¡ãƒ³ãƒˆã®åˆ—)ã‚’è‡ªå‹•ç”Ÿæˆã•ã›ã‚‹ãŸã‚ã«ã€QuickCheckã‚’ä½¿ã£ã¦ã„ã‚‹ã€‚ã“ã®ä¾‹ã®å ´åˆã¯ã€ã¾ãšãƒ—ãƒã‚°ãƒ©ãƒžãŒã‚¿ãƒ¼ã‚²ãƒƒãƒˆã®è¨€èªžã®æ–‡æ³•ã®ä»•æ§˜ã‚’å®šç¾©ã—ã¦ãŠã„ã¦ã€å¾Œã¯QuickCheckãŒè†¨å¤§ãªçµ„ã¿åˆã‚ã›ã®ã‚¹ãƒ†ãƒ¼ãƒˆãƒ¡ãƒ³ãƒˆã‚’è‡ªå‹•ç”Ÿæˆã—ã¦ãã‚Œã¦ã„ã‚‹ã€‚ãƒ‘ãƒ¼ã‚µã®å‹•ä½œãƒã‚§ãƒƒã‚¯ã‚’ã™ã‚‹ãŸã‚ã«ã€è†¨å¤§ãªã‚¹ãƒ†ãƒ¼ãƒˆãƒ¡ãƒ³ãƒˆã®çµ„ã¿åˆã‚ã›ã‚’è€ƒãˆãªãŒã‚‰ã€ãƒ‘ãƒ¼ã‚µã«å…¥åŠ›ã™ã‚‹ãƒ†ã‚ã‚¹ãƒˆã‚’äººé–“ãŒä½œã£ã¦ã„ãŸã®ã§ã¯ã—ã‚“ã©ã™ãŽã‚‹ã€‚ã ã‹ã‚‰ã€ç¶²ç¾…çš„ãªãƒ†ã‚¹ãƒˆã‚’æ¥½ã«è¡Œã†ã«ã¯
KGA 2008/10/06
haskell

test
ãƒªãƒ³ã‚¯
æ „å…‰ã®ã‚°ãƒ©ã‚¹ã‚´ãƒ¼Haskellã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã‚·ã‚¹ãƒ†ãƒ åˆ©ç”¨ã®æ‰‹å¼•ãã€€ãƒãƒ¼ã‚¸ãƒ§ãƒ³7.8.2
æ „å…‰ã®ã‚°ãƒ©ã‚¹ã‚´ãƒ¼Haskellã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã‚·ã‚¹ãƒ†ãƒ åˆ©ç”¨ã®æ‰‹å¼•ãã€€ãƒãƒ¼ã‚¸ãƒ§ãƒ³7.8.2 The GHC Team ç›®æ¬¡ The Glasgow Haskell Compiler License 1. å‚è€ƒè¨³ 1. GHCã®ç´¹ä»‹ 1.1. GHCã‚’å…¥æ‰‹ã™ã‚‹ 1.2. ãƒ¡ã‚¿æƒ…å ±: ã‚¦ã‚§ãƒ–ã‚µã‚¤ãƒˆã€ãƒ¡ãƒ¼ãƒªãƒ³ã‚°ãƒªã‚¹ãƒˆãªã© 1.3. GHCã®ãƒã‚°ã‚’å ±å‘Šã™ã‚‹ 1.4. GHCã®ãƒãƒ¼ã‚¸ãƒ§ãƒ³ç•ªå·ä»˜ã‘è¦å‰‡ 1.5. Release notes for version 7.8.1 1.5.1. Highlights 1.5.2. Full details 1.5.2.1. Language 1.5.2.2. Compiler 1.5.2.3. GHCi 1.5.2.4. Template Haskell 1.5.2.5. Runtime system 1.5.2.6. Build system 1.5.3. Lib
KGA 2008/10/06
haskell

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

nobsun
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸