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

odz id:odz

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

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

arrow_for_2ch
Arrowã®ç´¹ä»‹ for 2ch 2007å¹´7æœˆ1æ—¥ å‰å£ä¸Š Haskellã‚¹ãƒ¬ã§Arrowåˆ†ã‹ã‚‰ã‚“ã£ã¦ä½•å›žã‹æ›¸ã‹ã‚Œã¦ã‚‹ã‘ ã©Arrowã¯æ€–ããªã„ã‚ˆã€‚ Arrowã¯é¢ç™½ã„ã‚ˆã€‚ è¨ˆç®—ã‚’ g ã¨ã‹ f g è¦‹ãŸã„ãªå›³ã§è¡¨ã›ã¦é¢ç™½ã„ã€‚ å‰å£ä¸Š ã“ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã¯John Hughes(ã˜ã‚‡ã‚“ ã²ã‚…ãƒ¼ãš)ã® ãƒ» Generalising Monads to Arrows http://www.cs.chalmers.se/~rjmh/Papers/arrows.pdf ã£ã¦è¨€ã†Arrowã®å…ƒã«ãªã£ãŸè«–æ–‡ã‚’å…ƒã«ã—ãŸArrowã®ç´¹ ä»‹ã ã‚ˆã€‚ ã§ã‚‚è«–æ–‡ã¨ã¯çµæ§‹é•ã†èª¬æ˜Žã—ã¦ã‚‹ã‹ã‚‰æ³¨æ„ã€‚ Arrowã£ã¦ä½•ã‚ˆ Arrowã¯Monadã¨åŒã˜ã‚ˆã†ãªå½¹å‰²ã«ä½¿ã‚ã‚Œã‚‹ã€‚ Arrowã¯Monadã‚ˆã‚Šã‚‚ä¸€èˆ¬çš„ã€‚ Monad mã«å¯¾ã—ã¦ Arrow aãŒæ©Ÿæ¢°çš„ã«å®šç¾©ã§ãã‚‹ã€‚ Arrow aã«å¯¾ã—ã¦ Monad
odz 2007/07/19
haskell
ãƒªãƒ³ã‚¯
All About Monads ãƒ¢ãƒŠãƒ‰ã®ã™ã¹ã¦
ãƒ¢ãƒŠãƒ‰ã®ã™ã¹ã¦ Haskell ã«ãŠã‘ã‚‹ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…æ‹¬çš„ã‚¬ã‚¤ãƒ‰ Version 1.1.0 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚å¿µã¨ãã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹å¿œç”¨ã« ã¤ã„ã¦ã€åˆä¸ç´šã® Haskell ãƒ—ãƒã‚°ãƒ©ãƒžã«ã‚ã‹ã‚Šã‚„ã™ãã€åˆ©ç”¨ä¾¡å€¤ãŒã‚ã‚‹ã‚ˆã†ãª è§£èª¬ã‚’ã™ã‚‹ã“ã¨ã‚’æ—¨ã¨ã—ã¦ã„ã¾ã™ã€‚èªè€…ã¯ Haskell ã«ãªã‚Œã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ ã—ã¾ã™ãŒã€ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹çµŒé¨“ã¯è¦æ±‚ã—ã¦ã„ã¾ã›ã‚“ã€‚ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€å¤š ãã®é¡Œæã‚’ã‚«ãƒãƒ¼ã—ã¦ã„ã¾ã™ã€‚å¾ŒåŠã®ã‚»ã‚¯ã‚·ãƒ§ãƒ³ã§ã¯ã€å‰åŠã®é¡Œæã‚’ã‚ˆãç†è§£ã— ã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ã—ã¾ã™ã€‚é †ã‚’ãŠã£ã¦ã€ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’ä¾‹ç¤ºã™ã‚‹ãŸã‚ ã®ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ãŒãŸãã•ã‚“ç”¨æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚ä¸€èªã§ã€ã™ã¹ã¦ã®é¡Œæã‚’å¸åŽã— ã‚ˆã†ã¨ã„ã†ã®ã¯ãŠå‹§ã‚ã§ãã¾ã›ã‚“ã€‚ ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ 3 ã¤ã®éƒ¨åˆ†ã§æ§‹æˆã•ã‚Œã¦ã„ã¾ã™ã€‚æœ€åˆã®éƒ¨åˆ†ã¯ã€ é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹ãƒ¢ãƒŠãƒ‰ã®åŸºæœ¬çš„
odz 2007/02/13
haskell

monad
ãƒªãƒ³ã‚¯
Liskell - clemens.endorphin.org
New Liskell Site Liskell has a new home. Please go to http://liskell.org. Liskell - the language Liskell is a new syntax frontend for Haskell. Next to its syntax in the form of symbolic expressions â€” which is also known as Lisp â€” Liskell also features an extended meta-programming facility. Its aim is to get the best of both worlds: being pure and functional with type inference in the tradition of
odz 2007/02/08
Så¼ã§æ›¸ãHaskell

haskell

lisp
ãƒªãƒ³ã‚¯
JParsec - Home
What is jparsec? Jparsec is a recursive-desent parser combinator framework written for Java. It constructs parsers in native Java language only. Why yet another parser framework? Jparsec stands out for its combinator nature. It is no parser generator like YACC or ANTLR. No extra grammar file is required. Grammar is written in native Java /C# language, which also means you can utilize all the utili
odz 2006/10/21
Haskell ç”±æ¥ã®ãƒ‘ãƒ¼ã‚¶ãƒ©ã‚¤ãƒ–ãƒ©ãƒª

Java

haskell

parser
ãƒªãƒ³ã‚¯
C++ for Haskeller
http://haskell.g.hatena.ne.jp/mr_konn/20061006/1160138831 Haskellã‹ã‚‰å…¥ã£ãŸäººã«ã¯ã€cinã¨ã‹coutã¨ã‹å¾®å¦™ã™ãŽã¦ã‚ˆããªã„ã ã‚ã€ã¨ã€æ€ã£ãŸã®ã§ã€é©å½“ã«ã€‚ å¯¾è±¡èªè€…ã¯ã€Haskellã‚ã‹ã‚‹ã—ã€C++ã‚‚ã‚ã‹ã‚‹äººï¼ˆæ„å‘³ããƒ¼ï¼‰ã€‚ãƒã‚¿ã‚’ç†è§£ã§ãã‚‹äººã§ã™ã€‚ C++ã¨ã¯ C++ã¨ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ãªç‰¹å¾´ã‚’æŒã£ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã™ å‚ç…§é€æ˜Žï¼ˆï¼ï¼‰ å‡ºç¾è©•ä¾¡(occurrence evaluation) ï¼ˆãªã©ã¨ã„ã†ã„ã‹ãŒã‚ã—ã„å˜èªžã‚’ã¤ãã‚‹ï¼‰ ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã§ãã‚‹ å…¨ãç›´æ„Ÿçš„ã§ãªã„æ§‹æ–‡ IOãƒ¢ãƒŠãƒ‰ã‚’æ›¸ããŸã‚ã®å¤§é‡ã®syntax sugarãŒã‚ã‚‹ èª¬æ˜Žã—ã¦ã„ãã¨é•·ããªã‚‹ã®ã§ã€ãã‚Œãžã‚Œã€ãŠã„ãŠã„å¿…è¦ã«ãªã£ãŸã¨ãã«èª¬æ˜Žã™ã‚‹ã‚ˆã†ã«ã—ã¾ã™ã€‚ C++ã®åž‹ C++ã«ã¯ã€æ¬¡ã®åž‹ãŒã‚ã‚Šã¾ã™ã€‚ æ•´æ•° çœŸå½å€¤ é€£æƒ³é…åˆ— ã¾ã‚ã€ãŠã„ãŠã„èª¬æ˜Žã€‚ï¼ˆã¯ã‚„ãã‚‚é£½ãã¦ããŸï¼‰
odz 2006/10/09
c++

haskell

neta

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

haskell
ãƒªãƒ³ã‚¯
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ - ã¯ã¦ãªã®å‘ŠçŸ¥
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªã®é€šã‚Šã€ä»Šå¹´æœ«ã‚’ç›®å‡¦ã«ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã‚’çµ‚äº†äºˆå®šã§ã‚ã‚‹æ—¨ã‚’ãŠçŸ¥ã‚‰ã›ã—ã¦ãŠã‚Šã¾ã—ãŸã€‚ 2019å¹´æœ«ã‚’ç›®å‡¦ã«ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®æä¾›ã‚’çµ‚äº†ã™ã‚‹äºˆå®šã§ã™ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã“ã®ãŸã³ã€æ£å¼ã«çµ‚äº†æ—¥ã‚’æ±ºå®šã„ãŸã—ã¾ã—ãŸã®ã§ã€ä»¥ä¸‹ã®é€šã‚Šã”ç¢ºèªãã ã•ã„ã€‚ çµ‚äº†æ—¥: 2020å¹´1æœˆ31æ—¥(é‡‘) ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆå¸Œæœ›ç”³è«‹æœŸé™:2020å¹´1æœˆ31æ—¥(é‡‘) çµ‚äº†æ—¥ä»¥é™ã¯ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®é–²è¦§ãŠã‚ˆã³æŠ•ç¨¿ã¯è¡Œãˆã¾ã›ã‚“ã€‚æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãŒå¿…è¦ãªæ–¹ã¯ä»¥ä¸‹ã®è¨˜äº‹ã«ã—ãŸãŒã£ã¦æ‰‹ç¶šãã‚’ã—ã¦ãã ã•ã„ã€‚ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã«æŠ•ç¨¿ã•ã‚ŒãŸæ—¥è¨˜ãƒ‡ãƒ¼ã‚¿ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆã«ã¤ã„ã¦ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã”åˆ©ç”¨ã®ã¿ãªã•ã¾ã«ã¯ã”è¿·æƒ‘ã‚’ãŠã‹ã‘ã„ãŸã—ã¾ã™ãŒã€ã©ã†ãžã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ 2020-06-25 è¿½è¨˜ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãƒ‡ãƒ¼ã‚¿ã¯2020å¹´2æœˆ28
odz 2006/07/06
haskell
ãƒªãƒ³ã‚¯
å…¥é–€Haskell ã€œã¯ã˜ã‚ã¦å¦ã¶é–¢æ•°åž‹è¨€èªž - a-sanã®æ—¥è¨˜
æ£èª¤è¡¨ http://book.mycom.co.jp/support/e2/haskell/#ERRATA æ£èª¤è¡¨ã«è¼‰ã£ã¦ã„ãªã„ãƒžãƒã‚¬ã‚¤ã€‚ P72 ç·´ç¿’å•é¡Œ(2) æœ«å°¾ã®']'ãŒä¸è¦ èª¤ splitAt2 2 [1, 2, 3, 4] -- ([1, 2], [3, 4])] æ£ splitAt2 2 [1, 2, 3, 4] -- ([1, 2], [3, 4]) P107 å›³ [1]ã¨[2]ãŒé€†ã€‚ èª¤ [1] ï¼ ï¼¼ [2] [3] æ£ [2] ï¼ ï¼¼ [1] [3] P108 ï¼’è¡Œç›® Leafã§ã¯ãªãã€Node èª¤ Node 2 (Node 1 Leaf Leaf) (Leaf 3 Leaf Leaf) æ£ Node 2 (Node 1 Leaf Leaf) (Node 3 Leaf Leaf) P112 ä¸å¤®ã‚„ã‚„ä¸Š listToTree ã®æž å†… listToTreeã¯ä»¥ä¸‹ã®ã‚¨ãƒ©ãƒ¼
odz 2006/06/20
å…¥é–€Haskellã®æ£èª¤è¡¨

haskell
ãƒªãƒ³ã‚¯
æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ - ä¸–ç•Œã§ä¸€ç•ªã‹äºŒç•ªãã‚‰ã„ã«ã‚„ã•ã—ã„ã€Œãƒ¢ãƒŠãƒ‰å…¥é–€ã€
æ°—ã¾ãã‚Œã¨å¶ç„¶ã¨ãªã‚Šã‚†ãã§ã€ã“ã“2,3å›žã¯ãƒ¢ãƒŠãƒ‰ã‚’è©±é¡Œã«ã—ã¾ã—ãŸã€‚googleã§ã€Œãƒ¢ãƒŠãƒ‰ã€ã‚’å¼•ã„ã¦ã‚¶ãƒƒã¨çœºã‚ã‚‹ã¨ã€ã€Œãƒ¢ãƒŠãƒ‰ã¯ã‚€ãšã‹ã—ã„ãƒ¼ã€ã¨ã‹ã€Œãƒ¢ãƒŠãƒ‰ã§æŒ«æŠ˜ã—ãŸã€ã¿ãŸã„ãªé›°å›²æ°—ãŒæ„Ÿã˜ã‚‰ã‚Œã¦ã€èª¬æ˜ŽèŠ¸äººã®è¡€ãŒå°‘ã—é¨’ãŽã¾ã—ãŸãã€‚ã€Œãªã‚‰ã€äºˆå‚™çŸ¥è˜ã‚¼ãƒã§ãƒ¢ãƒŠãƒ‰ã®èª¬æ˜Žã‚’ã—ã¦ã‚„ã‚ã†ã˜ã‚ƒããƒ¼ã‹ã€ã¨ã€‚ ã‚¿ã‚¤ãƒˆãƒ«ã¯ã ã„ã¶ç…½ã£ã¡ã‚ƒã£ãŸâ€¦â€¦ ã‘ã©ã€ãƒãƒƒã‚¿ãƒªã˜ã‚ƒãªã„ã¤ã‚‚ã‚Šâ€¦â€¦ ã‘ã©ã€å®Ÿéš›ã¯ã©ã†ã‹ãªï¼Ÿ â€»å°åˆ·ã®ã¨ãã¯ã‚µã‚¤ãƒ‰ãƒãƒ¼ãŒæ¶ˆãˆã¾ã™ã€‚ å†…å®¹ï¼š ã¨ã‚Šã‚ãˆãšã€ã‚ãŸã‚Šã•ã‚ã‚Šãªããƒ¢ãƒŠãƒ‰ã®æ¥æ´ã‚’ç´¹ä»‹ã™ã‚‹ ã“ã‚“ãªèª²é¡Œã‚’è€ƒãˆã¦ã¿ã‚ˆã†ï¼šå‰¯ä½œç”¨ä»˜ãè¨ˆç®— ã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã™ã‚‹é–¢æ•°é” ã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã—ãŸã„æ„å¿—ã‚’æˆ»ã‚Šå€¤ã§ä¼ãˆã‚‹ ãã‚Œã§ã¯ã€ã„ã£ãŸã„èª°ãŒã‚«ã‚¦ãƒ³ãƒˆã‚¢ãƒƒãƒ—ã‚’ã™ã‚‹ã®ã é–¢æ•°ã®å¼•æ•°ã®åž‹ã‚’Countupåž‹ã«ã¾ã§æ‹¡å¼µã™ã‚‹ ãã—ã¦ã€ã“ã‚ŒãŒãƒ¢ãƒŠãƒ‰ã ã¨ã‚Šã‚ãˆãšã€ã‚ãŸã‚Šã•ã‚ã‚Šãªããƒ¢ãƒŠãƒ‰ã®æ¥æ´ã‚’ç´¹ä»‹ã™ã‚‹ ä»Šã‹ã‚‰ã“ã“ã§èª¬æ˜Žã™ã‚‹ã€Œãƒ¢ãƒŠãƒ‰ï¼ˆmonadï¼‰
odz 2006/04/24
haskell
ãƒªãƒ³ã‚¯
1