[B! Haskell] mechairoiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

mechairoi id:mechairoi

Haskellã«é–¢ã™ã‚‹mechairoiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (20)

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

Haskell ã§ã¯ã˜ã‚ã‚‹ãµã‚ã¨ã‚ Cocoa ã‚¢ãƒ—ãƒªé–‹ç™º
ã“ã®è¨˜äº‹ã¯Haskell Advent Calendar 2014 ã® 13æ—¥ç›®ã®è¨˜äº‹ã§ã™1ã€‚å‰æ—¥ã¯arrowM ã•ã‚“ã®ã€ŒHaskell rest ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ã§REST APIè¨è¨ˆã‚’ã‚µãƒœã‚‹ã€ã€ç¿Œæ—¥ã¯solorabã•ã‚“ã®ã€ŒHaskellã®lensã®ä½¿ã„æ–¹ã€ã§ã™ã€‚ Haskellã§Cocoaã‚¢ãƒ—ãƒªé–‹ç™ºã€ã—ãŸã„ã§ã™ã‚ˆãï¼Ÿã—ãŸããªã„äººã¯å˜åœ¨ã—ãªã„ã¨ä»®å®šã—ã¦ã‚‚ä¸€èˆ¬æ€§ã‚’å¤±ã‚ãªã„çˆãªã®ã§ã€å˜åœ¨ã—ãªã„ã¨ã—ã¦ä»¥ä¸‹è°è«–ã—ã¾ã—ã‚‡ã†ã€‚ã¨ã„ã†ã‚ã‘ã§ã€å¯¾è±¡èªè€…ã¯ã€ã“ã‚Œã‹ã‚‰ Cocoa ã‚¢ãƒ—ãƒªé–‹ç™ºã§ Haskell ã‚’ä½¿ã„ãŸã„ã¨æ€ã£ã¦ã„ã‚‹ Haskell ãƒ—ãƒã‚°ãƒ©ãƒžã§ã™ã€‚Objective-C ï¼ˆä»¥ä¸‹ã€Obj-Cï¼‰ãŒãªã‚“ã¨ãªãèªã‚ã‚Œã°ã‚ˆã‚Šã‚ˆã„ã§ã—ã‚‡ã†ãŒã€ç§ã˜ã—ã‚“ãã“ã¾ã§ Obj-C ã¯å¾—æ„ã§ã¯ãªã„ã®ã§ã€ã¾ã‚èªã‚ãªãã¦ã‚‚ä½•ã¨ã‹ãªã‚‹ã§ã—ã‚‡ã†ã€‚ã¾ãŸã€æœ¬ç¨¿ã§ã¯ OS X å‘ã‘ã® Cocoa é–‹ç™ºã‚’å¯¾è±¡ã¨ã—ã€iOS ã‚¢ãƒ—ãƒªã®
mechairoi 2015/01/01
haskell

cocoa
ãƒªãƒ³ã‚¯
Haskellã®lensã®ä½¿ã„æ–¹ (åŸºæœ¬) - ã¿ã‚†ã£ãã®ã«ã£ã
ekmettå…ˆç”Ÿã®lensã«é–¢ã—ã¦ Lens'ã¯ä¾¿åˆ©ã«ä½¿ãˆã¯ã™ã‚‹ã‘ã©ã€Prism,Iso,Traversal,Foldã¿ãŸã„ãªã®ã¯è§¦ã£ãŸã“ã¨ãŒãªã‹ã£ãŸã®ã§èª¿ã¹ãŸã€‚ Lensã®åˆ©ç”¨ 1 import Control.Lens ã—ã¦ 1 2 3 4 5 6 >>> ("hello",("world","!!!")) ^. _2 . _1 "world" >>> ("hello",("world","!!!")) & _2 . _1 .~ 42 ("hello",(42,"!!!")) >>> ("hello",("world","!!!")) & _2 . _1 %~ map toUpper ("hello",("WORLD","!!!")) ã¿ãŸã„ã«ä½¿ã†ã€‚å„ªå…ˆé †ä½ã¯ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã£ã¦ã„ã‚‹: 1 2 3 >>> ("hello",("world","!!!")) ^. (_2 . _1) >>
mechairoi 2014/12/27
Haskell

Lens
ãƒªãƒ³ã‚¯
Hulk: A Haskell IRC server
Hulk is an working-and-work-in-progress IRC server. Github repo. Motivation Last Wednesday night I whipped up a simple IRC server in Haskell in about four hours. We have been long time sick of the poor quality of the Skype Linux implementation, which was, on the dev team, our main point of communication. We agreed something like IRC would be good, so I thought it would be easy in Haskell to make s
mechairoi 2013/02/25
haskell

irc
ãƒªãƒ³ã‚¯
Haskell vs. F# vs. Scala: A High-level Language Features and Parallelism Support Comparison
Haskell vs. F# vs. Scala: A High-level Language Features and Parallelism Support Comparison Prabhat Totoo, Pantazis Deligiannis, Hans-Wolfgang Loidl. To appear in FHPC'12, ACM SIGPLAN Workshop on Functional High-Performance Computing, Copenhagen, Denmark, 15 September 2012 This paper provides a performance and programmability comparison of high-level parallel programming support in Haskell, F# and
mechairoi 2012/10/11
ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãƒ»IT

fromgooglereader

Haskell

F#

Scala

scala
ãƒªãƒ³ã‚¯
Announcing esqueleto, a type-safe EDSL for SQL queries â€“ Felipe Lessa
Iâ€™m very pleased to announce a preview release of esqueleto, a bare bones, type-safe EDSL for SQL queries. On the first part of this blog post Iâ€™ll talk about persistent and HaskellDB. You may jump right into where I talk about esqueleto if you want, though. Background Yesod is very modular, and each of its components may be used separately. You may also take libraries from other web frameworks. H
mechairoi 2012/09/09
ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãƒ»IT

fromgooglereader

db

Haskell

sql

haskell

yesod
ãƒªãƒ³ã‚¯
Haskellã§CIã™ã‚‹ãªã‚‰ - maoeã®ãƒ–ãƒã‚°
å‡½æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®é›†ã„ã®ãƒ©ãƒ³ãƒã§èžã‹ã‚ŒãŸã®ã§Haskellã®ãƒ†ã‚¹ãƒˆç’°å¢ƒã«ã¤ã„ã¦ã¾ã¨ã‚ã¾ã™ã€‚ githubã«ç½®ã„ã¦ã„ã‚‹ã‚³ãƒ¼ãƒ‰ã‚’é¢å€’ãªè¨å®šãªã—ã«ãƒ†ã‚¹ãƒˆã—ãŸã„ â†’ cabal test + travis-ciãŒãŠã™ã™ã‚ ã‚¯ãƒãƒ¼ã‚ºãƒ‰ãªã‚³ãƒ¼ãƒ‰ãªã‚“ã ã‘ã©ã€ã©ã†ã—ã‚ˆã† â†’ jenkinsã§ã‚‚ã‚»ãƒƒãƒˆã‚¢ãƒƒãƒ—ã—ã¾ã—ã‚‡ã† ã‚‚ã†å°‘ã—ç´°ã‹ã„ãƒ¡ãƒˆãƒªã‚¯ã‚¹ã¨ã‹ã¨ã‚ŠãŸã„ â†’ test-framework + jenkins cabal test + travis-ci cabal testã«å¯¾å¿œã—ãŸã‚³ãƒ¼ãƒ‰ã‚’GitHubã«ç½®ã„ã¦ã„ã¦ã€ãŠæ‰‹è»½ã«æ¸ˆã¾ã›ãŸã„ãªã‚‰ã“ã‚ŒãŒä¸€ç•ªã§ã™ã€‚ç‰¹å¾´ã¯ã€ ã¨ã«ã‹ãã‚«ãƒ³ã‚¿ãƒ³ ã‚»ãƒƒãƒˆã‚¢ãƒƒãƒ—ã¯ãƒªãƒã‚¸ãƒˆãƒªã®ãƒˆãƒƒãƒ—ã«language: haskellã¨ã ã‘æ›¸ã„ãŸ.travis.ymlã¨ã„ã†ãƒ•ã‚¡ã‚¤ãƒ«ã‚’ç½®ã„ã¦ã€travis-ciã‹ã‚‰ONã«ã™ã‚‹ã ã‘ã€‚ http://about.travis-ci.org/docs
mechairoi 2012/09/09
haskell

fromgooglereader

Haskell

jenkins

CI

github

ci

TravisCI

Test

Jenkins
ãƒªãƒ³ã‚¯
Functional Reactive Programming - HaskellWiki
Functional Reactive Programming (FRP) integrates time flow and compositional events into functional programming. This provides an elegant way to express computation in domains such as interactive animations, robotics, computer vision, user interfaces, and simulation. Introduction The original formulation of Functional Reactive Programming can be found in the ICFP 97 paper Functional Reactive Anima
mechairoi 2012/09/08
Haskell

FRP
ãƒªãƒ³ã‚¯
Haskell ã§ã®ãƒ‡ãƒãƒƒã‚° - ã‚ã©ã‘ãªã„è©±
ã€Œç´”ç²‹é–¢æ•°åž‹è¨€èªžã¯ãƒ‡ãƒãƒƒã‚°ã—ã«ãã„ã€‚ã ã£ã¦ç´”ç²‹ãªé–¢æ•°ã§ printf ãƒ‡ãƒãƒƒã‚°ã§ããªã„ã‹ã‚‰ã€ã¨ã¤ã¶ã‚„ã„ã¦ã„ã‚‹äººã‚’ã‚ˆãè¦‹ã‹ã‘ã¾ã™ã€‚ã“ã‚Œã¾ã§æ”¾ç½®ã—ã¦ãã¾ã—ãŸãŒã€ãƒªãƒ„ã‚¤ãƒ¼ãƒˆãŒ50ã‚’è¶…ãˆãŸã®ã§ã€Haskellã§ã®ãƒ‡ãƒãƒƒã‚°ã«ã¤ã„ã¦æ›¸ãã¾ã™ã€‚ ä¾‹å¤–å‡¦ç†ã¨åŒã˜ã‚ˆã†ã«ã€Haskell ã§ã®ãƒ‡ãƒãƒƒã‚°ã§ã¯ã€ç´”ç²‹ãªé–¢æ•°ã¨ IO ã‚’åˆ†ã‘ã¦è€ƒãˆã‚‹å¿…è¦ã‚ã‚Šã¾ã™ã€‚ IO ã§ã® printf ãƒ‡ãƒãƒƒã‚° IO ã§ã¯ã€putStrLn ã‚„ print ãŒä½¿ãˆã‚‹ã‹ã‚‰å•é¡Œãªã„ã§ã™ã‚ˆãï¼Ÿ foo :: Int -> IO Bool foo i = do x <- ã‚ã‚Œã—ã¦ i putStrLn $ "x = " ++ show x ã“ã‚Œã—ã¦ putStrLn "ã“ã“ã‚‚é€šéŽ" -- ãã‚Œã‚‚ã™ã‚‹ y <- ãã‚Œã‚‚ã™ã‚‹ print y return y ã¡ãªã¿ã«ã€forkIO èµ·å‹•ã—ãŸè»½é‡ã‚¹ãƒ¬ãƒƒãƒ‰ã‹ã‚‰ putStrLn ã™ã‚‹å ´åˆã€è»½é‡ã‚¹
mechairoi 2012/07/06
fromgooglereader

haskell

debug

dev

Haskell

test

debugging

tips

kazu-yamamoto

2012-06-06
ãƒªãƒ³ã‚¯
Haskellã§ä½œã‚‹è¶…ã‚³ãƒ³ãƒ‘ã‚¯ãƒˆéŸ³å£°èªè˜ã‚·ã‚¹ãƒ†ãƒ
éŸ³å£°èªè˜ã¯äººå·¥çŸ¥èƒ½ã®åˆ†é‡Žã®ä¸ã§ã‚‚ç‹¬è‡ªã®é€²åŒ–ã‚’ã¨ã’ãŸåˆ†é‡Žã§ï¼Œè‰¯ãã‚‚æ‚ªãã‚‚ã‚¬ãƒ©ãƒ‘ã‚´ã‚¹çš„ã¨è¨€ã‚ã‚ŒãŸã‚Šã—ã¾ã™ï¼Ž ç‰¹ã«å¤§èªžå½™é€£ç¶šéŸ³å£°èªè˜ã‚’å®Ÿç¾ã™ã‚‹æ—¢å˜ã®ã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã¯å¤§è¦æ¨¡ã‹ã¤è¤‡é›‘ã§ï¼ŒéŸ³å£°èªè˜ã®å°‚é–€å®¶ã§ã•ãˆã‚‚å…¨ä½“ã‚’ç†è§£ã—ã¦æ”¹è‰¯ã‚’åŠ ãˆã‚‹ã“ã¨ã¯å¿…ãšã—ã‚‚å®¹æ˜“ã§ã¯ã‚ã‚Šã¾ã›ã‚“ï¼Žã“ã®ã“ã¨ã¯è¿‘éš£åˆ†é‡Žã¨éŸ³å£°èªè˜ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£ã‚’åˆ†æ–ã™ã‚‹éšœå£ã¨ã‚‚ãªã£ã¦ã„ã¾ã™ï¼Ž ã—ã‹ã—éŸ³å£°èªè˜ã‚’å®Ÿç¾ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è‡ªä½“ã¯ï¼ŒåŸºæœ¬çš„ã«ã¯å®Ÿã¯ãã‚Œã»ã©é›£è§£ãªã‚‚ã®ã§ã¯ã‚ã‚Šã¾ã›ã‚“ï¼Žã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ãŒè¤‡é›‘ãªã®ã¯ï¼Œå¤šåˆ†ã«è¨ˆç®—é‡ã‚„ãƒ¡ãƒ¢ãƒªé‡å‰Šæ¸›ã®ãŸã‚ã®æ§˜ã€…ãªå·¥å¤«ã‚„Cã«ä»£è¡¨ã•ã‚Œã‚‹æ‰‹ç¶šãåž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®æŠ½è±¡åŒ–èƒ½åŠ›ã®é™ç•Œã«èµ·å› ã—ã¦ã„ã¾ã™ï¼Ž ä»–æ–¹ï¼Œã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢å·¥å¦ã®åˆ†é‡Žã§ã¯è¤‡é›‘ãªå‡¦ç†ã‚’ã‚³ãƒ³ãƒ‘ã‚¯ãƒˆã«è¨˜è¿°å¯èƒ½ãªæ¬¡ä¸–ä»£ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ‘ãƒ©ãƒ€ã‚¤ãƒ ã¨ã—ã¦ï¼Œç´”ç²‹é–¢æ•°åž‹è¨€èªžãŒç ”ç©¶ã•ã‚Œã¦ã„ã¾ã™ï¼Žç´”ç²‹é–¢æ•°åž‹è¨€èªžã¯é•·ã‚‰ãç ”ç©¶æ®µéšŽã«ç•™ã¾ã£ã¦ã„ã¾ã—ãŸãŒï¼Œè¿‘å¹´ã¯Haskellãªã©å®Ÿç”¨æ€§ã®é«˜
mechairoi 2011/04/29
haskell

éŸ³å£°èªè˜

speech recognition
ãƒªãƒ³ã‚¯
persistent-sqlite
mechairoi 2011/03/07
haskell
ãƒªãƒ³ã‚¯
Lazy I/O must go! - Iteratee: åˆ—æŒ™ãƒ™ãƒ¼ã‚¹ã®I/O - ç´”ç²‹é–¢æ•°åž‹é›‘è¨˜å¸³
æœ€è¿‘ã¡ã‚‡ã£ã¨æ°—ã«ãªã‚‹iterateeã‚’å‹‰å¼·ã—ãŸã®ã§ã€æ—¥æœ¬èªžã®è§£èª¬ã‚’æ›¸ã„ã¦ã¿ã¾ã™ã€‚ã¨è¨€ã„ã¤ã¤ã€å¤§éƒ¨åˆ†ãŒ The Monad.Reader Issue 16 *1 ã‹ã‚‰ã®å¼•ç”¨ã§ã™ã€‚ ã¯ã˜ã‚ã« Iterateeã¨å‘¼ã°ã‚Œã‚‹æ–°ãŸãªI/Oã®æŠ½è±¡åŒ–æ‰‹æ³•ãŒã€æœ€è¿‘ã«ã‚ã‹ã«åºƒã¾ã‚Šã¤ã¤ã‚ã‚Šã¾ã™ã€‚æ—¢å˜ã®I/OãŒæŠ±ãˆã‚‹å•é¡Œã‚’è§£æ±ºã™ã‚‹ã¹ãOleg Kiselyovã«ã‚ˆã£ã¦2008å¹´é ƒã«æå”±ã•ã‚ŒãŸiterateeã¯ã€æ–°ã—ã„é«˜æ€§èƒ½webãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯snap *2 ã‚„ã€hyena *3 ã§åˆ©ç”¨ã•ã‚Œã¦ã„ã¾ã™ã€‚ã¾ãŸã€HackagDBä¸Šã«ã¦ã€iterateeãƒ‘ãƒƒã‚±ãƒ¼ã‚¸*4ã€ãŠã‚ˆã³iterateeã‚’åˆ©ç”¨ã§ãã‚‹æ§˜ã€…ãªãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ *5 *6 *7 *8 ãŒå…¬é–‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ ã—ã‹ã—ã€ãƒ‰ã‚ãƒ¥ãƒ¡ãƒ³ãƒˆã®å°‘ãªã•ãªã©ã‹ã‚‰iterateeãŒã©ã†ã„ã†ã‚‚ã®ãªã®ã‹ã‚ˆãåˆ†ã‹ã‚‰ãªã„ã¨ã„ã†äººã‚‚å¤šã„ã‚ˆã†ã§ã™ã€‚ãã†ã„ã†ã‚ã‘ãªã®ã§ã€iterateeã‚’æ˜“ã—ãè§£èª¬ã—
mechairoi 2010/09/25
haskell

iteratee
ãƒªãƒ³ã‚¯
é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æ¥½ã—ã¿ - ã‚ã©ã‘ãªã„è©±
ãƒ¬ãƒ“ãƒ¥ãƒ¼ã«å‚åŠ ã—ãŸã€Œé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æ¥½ã—ã¿ã€ãŒå±Šãã¾ã—ãŸã€‚ã“ã‚Œã¯ã€é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®å…¥é–€æ›¸ã‚’ã„ãã¤ã‹èªã‚“ã äººãŒã€ã‚‚ã£ã¨é«˜ã¿ã‚’ç›®æŒ‡ã™ãŸã‚ã®æœ¬ã§ã™ã€‚ é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æ¥½ã—ã¿ ä½œè€…: ï¼ªï½…ï½’ï½…ï½ï½™ã€€ï¼§ï½‰ï½‚ï½‚ï½ï½Žï½“ã€€ï½ï½Žï½„ã€€ï¼¯ï½…ï½‡ï½…ã€€ï½„ï½…ã€€ï¼ï½ï½ï½’,å±±ä¸‹ä¼¸å¤«å‡ºç‰ˆç¤¾/ãƒ¡ãƒ¼ã‚«ãƒ¼: ã‚ªãƒ¼ãƒ ç¤¾ç™ºå£²æ—¥: 2010/06/23ãƒ¡ãƒ‡ã‚£ã‚¢: å˜è¡Œæœ¬ï¼ˆã‚½ãƒ•ãƒˆã‚«ãƒãƒ¼ï¼‰è³¼å…¥: 3äºº ã‚¯ãƒªãƒƒã‚¯: 98å›žã“ã®å•†å“ã‚’å«ã‚€ãƒ–ãƒã‚° (17ä»¶) ã‚’è¦‹ã‚‹ ç›®æ¬¡ ã“ã®æœ¬ã¯ã€é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®çˆ¶ Richard Bird ãŒé‚„æš¦ã‚’è¿Žãˆã‚‹ã“ã¨ã‚’è¨˜å¿µã—ã¦ã€è‘—åäººãŒå„ç« ã‚’å¯„ç¨¿ã—ã€ç·¨é›†ã—ãŸæ§‹æˆã¨ãªã£ã¦ã„ã¾ã™ã€‚ã‚³ãƒ¼ãƒ‰ã¯ã™ã¹ã¦ Haskell ã§æ›¸ã‹ã‚Œã¦ã„ã¾ã™ã€‚ç›®æ¬¡ã¯ä»¥ä¸‹ã®é€šã‚Šã§ã™ã€‚ äºŒåˆ†ãƒ’ãƒ¼ãƒ—æœ¨ã®æ¥½ã—ã¿ ä»•æ§˜ã«åŸºã¥ããƒ†ã‚¹ãƒˆ -- QuickCheck ã‚’ä½¿ã£ã¦ ãŠã‚ŠãŒã¿ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° Haskellã§éŸ³æ¥½ã‚’è¨˜è¿°ã—è§£é‡ˆã™ã‚‹ èžåˆå¤‰æ›ã‚’è‡ª
mechairoi 2010/06/26
ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãƒ»IT

fromgooglereader

æ›¸ç±

Haskell

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

programming_language

haskell

book

programming

è¨€èªž
ãƒªãƒ³ã‚¯
ã‚„ã•ã—ã„Functional reactive programmingï¼ˆEventç·¨ï¼‰ - maoeã®ãƒ–ãƒã‚°
å‰å›žã¯FRPã®Behaviorã¨Eventã¨ã„ã†é‡è¦ãªæ¦‚å¿µã¨ã€Haskellã§ã®ä»£è¡¨çš„ãªãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’ç°¡å˜ã«ç´¹ä»‹ã—ã¾ã—ãŸã€‚ä»Šå›žã¯ç´¹ä»‹ã—ãŸã‚‚ã®ã®ä¸ã‹ã‚‰reactiveã¨ã„ã†ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’å–ã‚Šä¸Šã’ã¾ã™ã€‚ ãªãŠã€reactiveã‚’ç†è§£ã™ã‚‹ã«ã‚ãŸã£ã¦Less Sugar/More Meat Â» Blog Archive Â» Introducing Reactive: Eventsã¨ã„ã†ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ãŒã¨ã¦ã‚‚å½¹ã«ç«‹ã£ãŸã“ã¨ã‚’æ›¸ã„ã¦ãŠãã¾ã™ã€‚ã“ã®å¾Œå‡ºã¦ãã‚‹è§£èª¬ã‚‚å†’é éƒ¨åˆ†ã¯ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‹ã‚‰ã¨ã£ã¦ãã¦ã„ã¾ã™ã€‚ãã‚Œã¨ã€å‹•ä½œç’°å¢ƒã¯Linuxä¸Šã®GHC 6.12.1ã§ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã—ãŸreactive 0.11.4ã‚’ä½¿ã£ã¦ã„ã¾ã™ã€‚ reactiveã®ç‰¹å¾´ reactiveã¯Conal ElliottãŒä½œã£ãŸæœ€æ–°ã®FRPãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã€ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã®ãƒ¦ãƒ¼ã‚¶å´ã‹ã‚‰è¦‹ãŸå¤§ããªç‰¹å¾´ã¯ã€Arrowã‚’ä½¿ã‚ãªã„å¤å…¸çš„FRPã‚’Fun
mechairoi 2010/02/17
Haskell

FRP

fromgooglereader

haskell
ãƒªãƒ³ã‚¯
ã‚„ã•ã—ã„Functional reactive programmingï¼ˆæ¦‚è¦ç·¨ï¼‰ - maoeã®ãƒ–ãƒã‚°
ã‚ã¨ã€ã‚„ã¯ã‚Šãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å‘¨ã‚Šãªã©I/Oã®å¤šã„ãƒ—ãƒã‚°ãƒ©ãƒ ã®æ›¸ãã«ãã•ãŒèª²é¡Œã«ãªã£ã¦ã„ã‚‹å°è±¡ã€‚é–¢æ•°çš„ãªI/Oã¯FRPã§è§£æ±ºã§ããã†ãªæ°—ãŒã™ã‚‹ã‚“ã ã‘ã©èª¿ã¹ã¦ãªã„ã€‚ãã‚ãã‚FRPã‚’ã¡ã‚ƒã‚“ã¨ç†è§£ã—ãŸã„ãªãƒ¼ã€‚ Parsec 3æ´»ç”¨äº‹ä¾‹: Keepalivedæ§‹æ–‡ãƒã‚§ãƒƒã‚« - maoeã®ãƒ–ãƒã‚° ãªã‚“ã¦æ›¸ã„ã¦ã‹ã‚‰æ—©1ãƒ¶æœˆåŠã€ã‚ˆã†ã‚„ãFRPãŒæŽ´ã‚ã¦ããŸã®ã§ã‚ã‹ã£ãŸã“ã¨ã‚’ã¾ã¨ã‚ã¦ã¿ã¾ã™ã€‚ Reactive programmingã£ã¦ä½•ï¼Ÿ FRPã®å‰ã«ã€ä¸€èˆ¬çš„ã«wikipedia:en:Reactive programmingã¨å‘¼ã°ã‚Œã‚‹ãƒ‘ãƒ©ãƒ€ã‚¤ãƒ ã«ã¤ã„ã¦è§¦ã‚Œã¦ãŠãã¾ã™ã€‚reactive programmingã¨ã¯ç–‘ä¼¼è¨€èªžã‚’ä½¿ã£ã¦ã‹ãªãƒ¼ã‚Šå¤§é›‘æŠŠã«èª¬æ˜Žã™ã‚‹ã¨ã€ var a = 1 var b = a + 1 a = 10 // aã‚’æ›¸ãæ›ãˆã‚‹ print b // => 11print bã®å‡ºåŠ›ã¯2ã§ã¯ãªã11ã§ã™
mechairoi 2010/02/11
Haskell

FRP

fromgooglereader

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

programming

haskell

ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯

å¾Œã§èªã‚€

é–¢æ•°åž‹è¨€èªž

TwitterToHatena
ãƒªãƒ³ã‚¯
Red Black Trees - Here are three different implementations of red-black trees in Haskell.
mechairoi 2009/12/19
red black tree ã® haskell å®Ÿè£…

algorithm

haskell

rbtree

_todo
ãƒªãƒ³ã‚¯
Haskell ã§ãƒ’ãƒ¥ãƒ¼ãƒ¡ã‚¤ãƒ³ã‚¤ãƒ³ã‚¿ãƒ•ã‚§ãƒ¼ã‚¹ã€‚ãƒ¢ãƒŠãƒ‰è¨˜æ³•ã‚’ä½¿ã‚ãªã„ã§ IO ã—ã¦ã¿ã‚‹ - è¨€èªžã‚²ãƒ¼ãƒ
èª°ã«ã‚‚é ¼ã¾ã‚Œã¦ãªã„ã®ã« Haskell ã®å¾©ç¿’ã‚’ã—ã¦ã„ã¾ã™ã€‚å‰ã‹ã‚‰æ°—ã«ãã‚ãªã‹ã£ãŸã®ãŒ Haskell ã® do è¨˜æ³•ã§ã™ã€‚ä¾‹ãˆã°ã‚³ãƒ³ã‚½ãƒ¼ãƒ«ã‹ã‚‰äºŒã¤ã®æ–‡å—ã‚’å…¥åŠ›ã—ã¦çµæžœã‚’å‡ºã™ã ã‘ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ã“ã†ã„ã†é¢¨ã«æ›¸ãã¾ã™ã€‚ main' = do num1 <- getLine num2 <- getLine print $ read num1 + read num2 ã“ã‚Œã¯ã‹ã£ãŸã‚‹ã„ï¼ãã†æ€ã„ã¾ã›ã‚“ã‹ï¼Ÿä½•æ•…æ¬¡ã®ã‚ˆã†ã«æ›¸ã‘ãªã„ã®ã‹ï¼ã“ã‚Œã¯ãƒ¢ãƒŠãƒ‰ãŒæ‚ªã„ã®ã‹ï¼Ÿ main'' = print ( read getLine + read getLine ) ãã†ã„ã†ã‚ã‘ã§ã€ç´ äººãªãŒã‚‰ã‚‚ã†ã¡ã‚‡ã£ã¨ãƒžã‚·ã«æ›¸ã‘ã‚‹ã®ã§ã¯ç„¡ã„ã‹ã¨è©¦ã—ã¦ã¿ã¾ã—ãŸã€‚ ã¾ãšã€read getLine ã¨æ›¸ã‘ãªã„ä»¶ã€‚getLine ã¯ã‚³ãƒ³ã‚½ãƒ¼ãƒ«ã‹ã‚‰æ–‡å—åˆ—ã‚’å—ã‘å–ã‚‹ãƒ¢ãƒŠãƒ‰ã ã‘ã©ã€read ã¯æ–‡å—åˆ—è‡ªä½“ã‚’å—ã‘å–ã‚‹é–¢æ•°ãªã®ã§ã†ã¾ãåˆã‚ãªã„ã€‚ä¾‹ãˆã¦
mechairoi 2009/12/13
haskell

spreadsheets

ã™ã°ã‚‰ã—ã„æ´žå¯Ÿ

dataflow

Haskell

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

é–¢æ•°åž‹è¨€èªž

monad
ãƒªãƒ³ã‚¯
OMeta ã®é›»å“ã‚’ parsec ã§ä½œã‚‹ã€‚ - è¨€èªžã‚²ãƒ¼ãƒ
ã•ã¦ã€http://jarrett.cs.ucla.edu/ometa-js/#OMeta_Tutorial ã«ã‚ã‚‹ OMeta ã®é›»å“ã®ä¾‹ã‚’ãã®ã¾ã¾ parsec ã§ä½œã£ã¦ã¿ã¾ã™ã€‚OMeta ã¯è¨€èªžã«å¿…è¦ãªå‡¦ç†ã‚’ã€æ–‡å—è§£æžã«ç•™ã¾ã‚‰ãšå‡ºæ¥ã‚‹ã ã‘ OMeta ã§è¡Œã†ã®ãŒå£²ã‚Šã§ã™ã€‚ã¾ãŸé€†ã« parsec ã¯ãƒ‘ãƒ¼ã‚µç‰¹æœ‰ã®å‡¦ç†ã‚’ã€ç‰¹åˆ¥ãªè¨€èªžã‚’ä½¿ã‚ãš Haskell ã ã‘ã§è¡Œã†ã®ãŒå£²ã‚Šã§ã™ã€‚çœŸé€†ã§é¢ç™½ã„ã®ã§ã€OMeta ã¨ parsec ã‚’å¯¾æ¯”ã•ã›ã‚‹äº‹ã§ä¸¡è€…ã®ç‰¹å¾´ã‚’æµ®ãä¸ŠãŒã‚‰ã›ã¦ã¿ã¾ã™ã€‚ module Main where import Text.ParserCombinators.Parsec import Text.ParserCombinators.Parsec.Pos( updatePosChar, updatePosString ) run :: Show a => Parser a ->
mechairoi 2009/12/13
ometa

haskell

parsec

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
parsec - è¨€èªžã‚²ãƒ¼ãƒ
æœ€è¿‘ Haskell ã«è§¦ã£ã¦ãªãã¦å¯‚ã—ã„ãªã‚ã¨æ€ã„ã€ãƒ‘ãƒ¼ã‚µãƒ¼ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã¨è¨€ã†ã®ã‚’è©¦ã—ã¦ã¿ã¾ã—ãŸã€‚ã¾ãš import ã¯ã“ã®ã‚ˆã†ã«ã—ã¾ã™ã€‚ import Text.ParserCombinators.Parsec Parsec ã«ã¯ä¾¿åˆ©ãªãƒ‘ãƒ¼ã‚µã®éƒ¨å“ãŒæ²¢å±±ã‚ã‚Šã¾ã™ãŒã€å‹‰å¼·ã®ãŸã‚ã‚ãˆã¦è‡ªä½œã—ã¾ã™ã€‚ã¾ãšã‚ã‚‹æ–‡å—åˆ—ã®å…ˆé ãŒ a ã®æ™‚ã ã‘ãƒžãƒƒãƒã™ã‚‹ã‚„ã¤ã‚’ä½œã‚Šã¾ã™ã€‚ç‰¹å®šã®æ–‡å—ã«ãƒžãƒƒãƒã™ã‚‹ã«ã¯ char é–¢æ•°ã‚’ä½¿ã„ã¾ã™ã€‚char é–¢æ•°ä»¥å¤–ã¯ã€ãƒ‘ãƒ¼ã‚µã‚’é§†å‹•ã™ã‚‹ã ã‘ã®ãŸã‚ã®éƒ¨å“ã§ã™ã€‚ aParser :: String -> IO() aParser input = out (parse (char 'a') "error" input) where out (Right x) = print x out (Left err) = print err -- Main> aParser "abc" --
mechairoi 2009/12/13
haskell

parsec
ãƒªãƒ³ã‚¯
Haskell ã®æ§‹æ–‡ã«æƒ‘ã‚ã•ã‚Œã¦ã„ã‚‹ã - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãªBlog)
2æœˆ21æ—¥ã«ã€rst76ã•ã‚“ã‹ã‚‰ãƒˆãƒ©ãƒƒã‚¯ãƒãƒƒã‚¯ã‚’ã„ãŸã ãã¾ã—ãŸã€‚ ã€ŒæŠ€è¡“è€…ï¼ãƒ—ãƒã‚°ãƒ©ãƒžã®ãŸã‚ã®ãƒ©ãƒ ãƒ€è¨ˆç®—ã€è«–ç†ã€åœã€ã‚»ãƒŸãƒŠãƒ¼ç¬¬2å›ž ã ã„ã¶é…ããªã£ã¦ã—ã¾ã„ã¾ã—ãŸãŒã€å£èªžä½“ã€ã¤ã†ã‹ã‚ªã‚·ãƒ£ãƒ™ãƒªä½“ã§ãŠå¿œãˆã—ã¾ã™ã€‚ ã“ã‚Šã‚ƒã‚«ãƒªãƒ¼åŒ–ã¤ã†ã‚ˆã‚Šã€ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã®åˆ©ç”¨ã˜ã‚ƒã rst76ã•ã‚“æ›°ãï¼š Prelude> let g a b x = a * x + b Prelude> g 3 5 7 26 Prelude> let g1 a b = (+ b) . (* a) Prelude> g1 3 5 7 26 ã‚“ãƒ¼ã‚“ã¨ã€ã“ã‚Œã¯ã‚«ãƒªãƒ¼åŒ–ï¼ˆãƒ©ãƒ ãƒ€æŠ½è±¡ï¼‰ã¨é–¢ä¿‚ãªã„ãªãƒ¼ã€‚ç¢ºã‹ã«é–¢æ•°ã®å¤‰æ•°ï¼ˆå¼•æ•°ï¼‰ãŒæ¸›ã£ã¦ã„ã‚‹ã‚ˆã†ã«è¦‹ãˆã‚‹ã‚“ã ã‘ã©ã€ãã‚Œã¯å˜ã«gã¨g1ã§é•ã†æ›¸ãæ–¹ã‚’ã—ãŸã€ã£ã¦ã ã‘ã€‚g1ãŒgã®ã‚«ãƒªãƒ¼åŒ–ï¼ˆãƒ©ãƒ ãƒ€æŠ½è±¡ï¼‰ã¨ã„ã†ã“ã¨ã§ã¯ãªã„ã€‚ ã“ã‚Œã¯ã‚€ã—ã‚ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã«é–¢ä¿‚ã™ã‚‹ã‹ãªã€‚ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã‚’ä½¿ã†ã¨ãƒ©ãƒ ãƒ€å¤‰æ•°ï¼ˆæŸç¸›å¤‰æ•°ï¼‰ã‚’æ¸›
mechairoi 2009/12/13
é›‘è¨˜ï¼å‚™å¿˜

Haskell

Math
ãƒªãƒ³ã‚¯
ã‚ªãƒ€ãƒ³ã‚´å›³ã§è§£æ˜Žã™ã‚‹Haskellæ§‹æ–‡ã®å·§ã¿ã•ã¨è½ã¨ã—ç©´ - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãªBlog)
æ˜¨æ—¥ã®ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã€ŒHaskell ã®æ§‹æ–‡ã«æƒ‘ã‚ã•ã‚Œã¦ã„ã‚‹ãã€ã‚’å°‘ã—å¼•ã£å¼µã‚‹ã‚“ã ã‘ã©ï¼› Haskellã®é–¢æ•°å®šç¾©ï¼å‘¼ã³å‡ºã—*1æ§‹æ–‡ã¯ã€èª¤è§£ã‚„æ··ä¹±ã‚’æ‹›ãå±é™ºã‚‚ã‚ã‚‹ã«ã¯ã‚ã‚‹ã‘ã©ã€ã‚„ã£ã±ã‚Šå·§ã¿ã«å‡ºæ¥ã¦ã„ã‚‹ãªãƒ¼ã€‚èª¤è§£ã—ãŸã¾ã¾ä½¿ã£ã¦ã‚‚ãƒ„ã‚¸ãƒ„ãƒžãŒã‚ã†ã¨ã“ã‚ãŒç´ æ™´ã‚‰ã—ã„ã€‚ ãã®èª¤è§£ã¨ã¯ã€f x y ã®ã‚ˆã†ãªæ›¸ãæ–¹ã‚’2å¼•æ•°ï¼ˆ2å¤‰æ•°ï¼‰é–¢æ•°ã ã¨æ€ã†ã“ã¨ã€‚æ˜¨æ—¥ã®ä¾‹ g a b x = a*x + b ã‚’ä½¿ã†ã‘ã©ã€çµµã®æãã‚„ã™ã•ã®éƒ½åˆã‹ã‚‰ã€a*x + b ã‚’ b + a*x ã®å½¢ã«æ›¸ãã¾ã™ãã€‚ g b a x = b + a*x ã“ã‚Œã¯ã€æ¬¡ã®å›³1ã®ã‚ˆã†ã«æ€ã£ã¦ã‚‚å•é¡Œã‚ã‚Šã¾ã›ã‚“ã€‚ å›³1 g ã¨ã¯ã€ b a x ï½œ ï¼¼ ï¼ ï¼¼ ï¼Š ï¼¼ ï¼ ï¼‹ ï½œ ã‘ã©ã€ã‚ˆã‚Šç²¾å¯†ã«æã‘ã°ï¼ˆã‚¢ã‚¹ã‚ãƒ¼çµµã§ã¯ç„¡ç†ï¼‰ å›³2 æŽ›ã‘ç®—ã®ã¨ã“ã‚ã‹ã‚‰èª¬æ˜Žã™ã‚‹ã¨ï¼› a*x ã¨ã„ã†ç®—è¡“ã®å¼ã¯ã€(*) a x ã®ã“ã¨ã§ã™ã€‚(*)ã®æ£ä½“ã¯ Î»s.Î»t.(mul
mechairoi 2009/12/13
é›‘è¨˜ï¼å‚™å¿˜

Haskell
ãƒªãƒ³ã‚¯
1