ruiccã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ / 2013å¹´3æœˆ31æ—¥ - ã¯ã¦ãªãƒ

ãƒ‰ãƒ»ãƒ–ãƒ©ã‚¦ãƒ³ãƒ»ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ - Wikipedia

ãƒ‰ãƒ»ãƒ–ãƒ©ã‚¦ãƒ³ãƒ»ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ï¼ˆè‹±èªž: de Bruijn Indexï¼‰ã¨ã¯ã€ãƒ©ãƒ ãƒ€è¨ˆç®—ã«ãŠã„ã¦ã€åå‰ã‚’ä½¿ã‚ãšã«å¼•æ•°ï¼ˆæŸç¸›å¤‰æ•°ï¼‰ã‚’å‚ç…§ã™ã‚‹ãŸã‚ã®è¨˜æ³•ã§ã‚ã‚‹ã€‚ã‚ªãƒ©ãƒ³ãƒ€äººæ•°å¦è€…ãƒ‹ã‚³ãƒ©ãƒ¼ã‚¹ãƒ»ãƒ›ãƒ¼ãƒ´ã‚¡ãƒ¼ãƒˆãƒ»ãƒ‰ãƒ»ãƒ–ãƒ©ã‚¦ãƒ³ã«ã‚ˆã£ã¦ç™ºæ˜Žã•ã‚ŒãŸã€‚ ã“ã®è¨˜æ³•ã§ã¯ã€ãã‚Œãžã‚Œã®Î»ã§ã¯å¼•æ•°ã®åå‰ã‚’æ›¸ã‹ãªã„ã€‚å¼•æ•°ã¯ã€é€šå¸¸ã®è¨˜æ³•ã§ãã®å¼•æ•°ã‚’å®£è¨€ã™ã‚‹Î»ãŒã€ä½•éšŽå±¤å¤–å´ã«ã‚ã‚‹ã‹ã‚’è¡¨ã™è‡ªç„¶æ•°ã®ç•ªå·ã§è¡¨è¨˜ã™ã‚‹ã€‚ ä¾‹ãˆã°ã€Î»z. (Î»y. y (Î»x. x)) (Î»x. z x) ã¯ Î» (Î» 1 (Î» 1)) (Î» 2 1) ã¨ãªã‚‹ã€‚ ãƒ‰ãƒ»ãƒ–ãƒ©ã‚¦ãƒ³ãƒ»ãƒ¬ãƒ™ãƒ«ã¯çµ¶å¯¾çš„ãªä½ç½®ã‚’è¡¨ã™ãŒã€ãƒ‰ãƒ»ãƒ–ãƒ©ã‚¦ãƒ³ãƒ»ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã¯ç›¸å¯¾çš„ãªä½ç½®ã‚’è¡¨ã™ã€‚

ruicc 2013/03/31

ãƒªãƒ³ã‚¯

parsers

ruicc 2013/03/31

ParserCombinatorã®APIã‚’çºã‚ãŸã‚‚ã® #ekmett_conf

ãƒªãƒ³ã‚¯

Haskell ã® machines ã«å…¥é–€ã—ã¦ã¿ãŸï¼Œã¨ã„ã†ãŠè©± - KrdLab's blog

ã¯ã˜ã‚ã« io-streams ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ãŒãƒªãƒªãƒ¼ã‚¹ã•ã‚ŒãŸæŠ˜ã«ãµã¨ã€Œconduitï¼Œpipesï¼Œio-streams ä»¥å¤–ã® streaming data ã‚’æ‰±ã†ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã«ã¯ä½•ãŒã‚ã‚‹ã‚“ã ã‚ã†ã‹ï¼Ÿã€ã¨ç–‘å•ã«æ€ã„ã¤ã¶ã‚„ã„ã¦ã¿ãŸã¨ã“ã‚ï¼Œ machines ãŒã‚ã‚‹ ã¨ã„ã†ã“ã¨ã‚’æ•™ãˆã¦ã„ãŸã ãã¾ã—ãŸï¼Ž æ°—ã«ãªã£ãŸã®ã§èª¿ã¹ã¦ã¿ãŸï¼Œã¨ã„ã†ã®ãŒä»Šå›žã®å†…å®¹ã§ã™ï¼Ž åŸºæœ¬çš„ãªä½¿ã„æ–¹ã«å§‹ã¾ã‚Šï¼Œä½•ã¨ã‹ attoparsec ã‚’çµ„ã¿è¾¼ã‚€ã‚ãŸã‚Šã¾ã§ã¯è¾¿ã‚Šç€ãã¾ã—ãŸï¼ŽãªãŠï¼ŒGHC 7.4.1 ã‚’ä½¿ç”¨ã—ã¦ã„ã¾ã™ï¼Ž è¦‹å‡ºã— ã“ã‚Œã¯ä½•ï¼Ÿ é›°å›²æ°— ã©ã†ä½¿ã†ã®ï¼Ÿ åŸºæœ¬å½¢ Source ã®ä½œæˆ Process ã®ä½œæˆ Transducer ã‚’çµ„ã¿è¾¼ã‚€ è¤‡æ•°å…¥åŠ›ã®å–ã‚Šæ‰±ã„ Parser ã‚’çµ„ã¿è¾¼ã‚€ ãŠã‚ã‚Šã« ã“ã‚Œã¯ä½•ï¼Ÿ ä»Šå›žã®å¯¾è±¡ã¯â†“ã“ã‚Œï¼Ž machines-0.2.3.1 http://hackage.haskell.org/pa

ruicc 2013/03/31

#ekmett_conf

haskell

ãƒªãƒ³ã‚¯

Type Equalities, Disequalities and obsoleting of Overlapping Instances

Type equality predicates: from OverlappingInstances to overcoming them Type equality predicates decide if two types are equal and return the result of the comparison as a type-level boolean. A type equality predicate ought to be total for ground types, that is, types with no free type variables. A more general type matching predicate compares the shape of two types, their top-level type constructo

ruicc 2013/03/31

type

ãƒªãƒ³ã‚¯

ãƒ¢ãƒŠãƒ‰å¤‰æ›åã®é€Ÿã•ã‚’æ¸¬ã£ã¦ã¿ã‚‹ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰

mtl(å®Ÿè£…ã¯transf ormers)ã§æä¾›ã•ã‚Œã¦ã„ã‚‹ãƒ¢ãƒŠãƒ‰å¤‰æ›åã®Lazyç‰ˆã¨Strictç‰ˆã§ã€ã©ã®ãã‚‰ã„ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ã®å·®ãŒå‡ºã‚‹ã‹èª¿ã¹ã¦ã¿ãŸã€‚ã¾ãŸã€ç§ãŒCPS(ç¶™ç¶šæ¸¡ã—ã‚¹ã‚¿ã‚¤ãƒ«)ã§å®Ÿè£…ã—ãŸã‚‚ã®ã¨ã‚‚æ¯”è¼ƒã—ã¦ã¿ãŸã€‚ æ¯”è¼ƒæ–¹æ³• {-# LANGUAGE FlexibleContexts #-} import Control.Monad.Reader.Class import Control.Monad.Reader as R import Control.Monad.Reader.CPS as RC import Control.Monad.Writer.Lazy as WL import Control.Monad.Writer.Strict as WS import Control.Monad.Writer.CPS as WC import Data.Monoid import Con

ruicc 2013/03/31

haskell
mtl

ãƒªãƒ³ã‚¯

The Comonad.Reader Â» Free Monads for Less (Part 1 of 3): Codensity

A couple of years back Janis VoigtlÃ¤nder wrote a nice paper on how one can use the codensity monad to improve the asymptotic complexity of algorithms using the free monads. He didn't use the name Codensity in the paper, but this is essentially the meaning of his type C. I just returned from running a workshop on domain-specific languages at McMaster University with the more than able assistance of

ruicc 2013/03/31

ekmettã®codensityã«ã¤ã„ã¦part1

haskell
free

ãƒªãƒ³ã‚¯

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ã‚¿ã‚°

2013å¹´3æœˆ31æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (6ä»¶)

ãƒ‰ãƒ»ãƒ–ãƒ©ã‚¦ãƒ³ãƒ»ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ - Wikipedia

parsers

Haskell ã® machines ã«å…¥é–€ã—ã¦ã¿ãŸï¼Œã¨ã„ã†ãŠè©± - KrdLab's blog

Type Equalities, Disequalities and obsoleting of Overlapping Instances

ãƒ¢ãƒŠãƒ‰å¤‰æ›åã®é€Ÿã•ã‚’æ¸¬ã£ã¦ã¿ã‚‹ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰

The Comonad.Reader Â» Free Monads for Less (Part 1 of 3): Codensity

ãŠçŸ¥ã‚‰ã›

æ—§ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã®Chromeæ‹¡å¼µæ©Ÿèƒ½ã«ã¤ã„ã¦ã®ãŠçŸ¥ã‚‰ã›ã¨æ–°ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã”åˆ©ç”¨ã®ãŠé¡˜ã„

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´3æœˆç¬¬1é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´2æœˆç¬¬4é€±ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

ã‚¿ã‚°

2013å¹´3æœˆ31æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (6ä»¶)

ãŠçŸ¥ã‚‰ã›

æ—§ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã®Chromeæ‹¡å¼µæ©Ÿèƒ½ã«ã¤ã„ã¦ã®ãŠçŸ¥ã‚‰ã›ã¨æ–°ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã”åˆ©ç”¨ã®ãŠé¡˜ã„

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2025å¹´3æœˆç¬¬1é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2025å¹´2æœˆç¬¬4é€±ï¼‰

å…¬å¼Twitter

ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

2013å¹´3æœˆ31æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (6ä»¶)

ãŠçŸ¥ã‚‰ã›

æ—§ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã®Chromeæ‹¡å¼µæ©Ÿèƒ½ã«ã¤ã„ã¦ã®ãŠçŸ¥ã‚‰ã›ã¨æ–°ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã”åˆ©ç”¨ã®ãŠé¡˜ã„

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´3æœˆç¬¬1é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´2æœˆç¬¬4é€±ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹