y”ŠwŽÒzHaskell‚̓ ..
240:ƒfƒtƒHƒ‹ƒg‚Ì–¼–³‚µ‚³‚ñ
06/07/01 06:30:18
>>232
>‚Ç‚¤‚µ‚Ä‚»‚Ì‘O’ñ‚ª“ǂݎæ‚ê‚é‚Ì‚©•ª‚©‚ç‚ñ‚¯‚ÇB
>uHaskell‚Í•›ì—p‚ð(•\–Êã)’Ç‚¢o‚µ‚½ˆ×‚ÉIOƒ‚ƒiƒh‚Æ‚¢‚¤‚â‚₱‚µ‚¢Œ`‚Å‚µ‚©ˆµ‚¦‚È‚¢B‚µ‚©‚µ•›ì—p‚ÍŒø—¦“I‚ȃvƒƒOƒ‰ƒ€‚ðˆµ‚¤ã‚Å•K—vˆ«‚¾‚æ‚ÈB‚à‚Á‚ÆŠÈ’P‚ɂȂç‚ñ‚Ì‚©Hv
>‚Æ‚¢‚¤•—‚ɓǂñ‚¾B
‚»‚¤“ǂ߂é‚̂ɋC•t‚©‚È‚©‚Á‚½B
“üo—͂̂±‚Æ‚ð•›ì—p‚ƌĂñ‚ł邿‚¤‚¾‚ªA•›ì—p‚Ƃ͎®‚ÌŠÈ–ñ‚̉ߒö‚Å“üo—Í‚ðs‚¤‚±‚Ƃł ‚Á‚ÄA
“üo—Í‚»‚Ì‚à‚̂̂±‚Ƃł͂Ȃ¢‚¾‚ëB
‚»‚ê‚Æ‚àAu•›ì—pv‚Æ‚¢‚¤Œ¾—t‚ð‚»‚¤‚¢‚¤ˆÓ–¡‚ÅŽg‚¤‚±‚Æ‚ðŽxŽ‚·‚é“T‹’‚ª‚ ‚Á‚½‚è‚·‚é‚Ì‚©H
‘½‚‚ÌŒ¾Œê‚Å‚ÍA“üo—Í‚ðˆµ‚¤—Bˆê‚Ì•û–@‚ª•›ì—p‚Ȃ킯‚ÅA“üo—͂ƕ›ì—p‚𬓯‚µ‚Ä‚à‚³‚µ‚Ä–â‘è‚͂Ȃ¢‚¾‚낤‚ªA
‚»‚¤‚łȂ¢Œ¾Œê(‚½‚Æ‚¦‚ÎHaskell‚âClean)‚̘b‚ð‚·‚é‚Æ‚«‚Í‚¿‚á‚ñ‚Æ‹æ•Ê‚µ‚Ęb‚µ‚½‚Ù‚¤‚ª—Ç‚¢‚ÆŽv‚¤B
>‚Æ‚¢‚¤‚©–¾‚ç‚©‚É IOƒ‚ƒiƒh‚ð•›ì—p‚ðˆµ‚¤ƒ‚ƒiƒh‚Å‚»B
>>231‚É‘‚¢‚½‚悤‚Éu•›ì—p‚È‚µ‚ÅvIO‚ðˆµ‚¤‚½‚߂̃‚ƒiƒhA‚Æ‚·‚é‚Ì‚ª•’Ê‚¾‚ÆŽv‚¤B
How to declare an imperative‚©‚çˆø—p
>This section relates the monad approach to input-output to four other widely used
>approaches: synchronised streams, as used in earlier versions of Haskell; continua-
>tions, as used in Hope; linear types, as used in Clean; and side effects, as used in
>SML.
ŽŸƒy[ƒWÅVƒŒƒX•\ަƒXƒŒƒbƒh‚ÌŒŸõ—ÞŽ—ƒXƒŒˆê——˜b‘è‚̃jƒ…[ƒX‚¨‚Ü‚©‚¹ƒŠƒXƒg¥ƒIƒvƒVƒ‡ƒ“‚ð•\ަ‰É‚‚Ԃµ2ch
5390“ú‘O‚ÉXV/244 KB
’S“–:undef