[B! Haskell][å¾Œã§èªã‚€] r-westã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

r-west id:r-west

Haskellã¨å¾Œã§èªã‚€ã«é–¢ã™ã‚‹r-westã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (59)

${{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ã®çˆ¶Simon PJæ°ã€GHCã®å†…éƒ¨å®Ÿè£…ã«ã¤ã„ã¦æ—¥æœ¬ã®Haskellerã¨æ¿€è«–ã‚’äº¤ã‚ã™
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžHaskellã®å‡¦ç†ç³»ã€ŒGHCã€ï¼ˆGlasgow Haskell Compilerï¼‰ã®ãƒ¡ã‚¤ãƒ³é–‹ç™ºè€…ã§ã‚ã‚Šã€ŒHaskellã®çˆ¶ã€ã¨å‘¼ã°ã‚Œã‚‹Simon Peyton Jonesï¼ˆSimon PJï¼‰æ°ï¼ˆç¾åœ¨ã®æ‰€å±žã¯ç±³ãƒžã‚¤ã‚¯ãƒã‚½ãƒ•ãƒˆãƒªã‚µãƒ¼ãƒï¼‰ãŒ2016å¹´9æœˆ17æ—¥ã«æ¥æ—¥ã—ã€æ±äº¬ã§é–‹å‚¬ã•ã‚ŒãŸã‚¤ãƒ™ãƒ³ãƒˆã€ŒHaskell Day 2016ã€ã§è¬›æ¼”ã—ãŸã€‚ã“ã®ã‚¤ãƒ™ãƒ³ãƒˆã«ã¯Haskellã«èˆˆå‘³ãŒã‚ã‚‹ã€ã‚ã‚‹ã„ã¯æ¥å‹™ã§åˆ©ç”¨ã—ã¦ã„ã‚‹ã¨ã„ã£ãŸ100äººä»¥ä¸Šã®æŠ€è¡“è€…ãŒå‚åŠ ã—ã¦ãŠã‚Šã€åŒæ°ã¯ãã†ã—ãŸæŠ€è¡“è€…ã¨GHCã®å†…éƒ¨å®Ÿè£…ã‚„æœ€é©åŒ–ã«ã¤ã„ã¦ç†±ã„è°è«–ã‚’äº¤ã‚ã—ãŸï¼ˆåŒã‚¤ãƒ™ãƒ³ãƒˆã«é–¢ã™ã‚‹Twitterã®ç™ºè¨€ï¼‰ã€‚ åŒæ°ã¯é´ã‚‚é´ä¸‹ã‚‚å±¥ã„ã¦ã„ãªã„è£¸è¶³ã§ã€å¸¸ã«å¤§ããªèº«æŒ¯ã‚Šã§ç†±å¼ã‚’ãµã‚‹ã£ãŸã€‚å‚åŠ è€…ãŒé»™ã£ã¦èžã„ã¦ã„ã‚‹ã¨ã€Œè³ªå•ã¯ãªã„ã®ã‹ã€ã¨å‚¬ä¿ƒã€‚é€”ä¸ã‹ã‚‰ã¯å‚åŠ è€…ã‹ã‚‰æ´»ç™ºã«è³ªå•ãŒé£›ã³å‡ºã™ã‚ˆã†ã«ãªã‚Šã€2æ™‚é–“ãŸã£ã·ã‚Šç†±ã„è°è«–ãŒç¹°ã‚Šåºƒã’ã‚‰ã‚ŒãŸ
r-west 2016/09/21
haskell

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Implementing a JIT Compiler with Haskell and LLVM ( Stephen Diehl )
Implementing a JIT Compiled Language with Haskell and LLVM Adapted by Stephen Diehl ( @smdiehl ) This is an open source project hosted on Github. Corrections and feedback always welcome. Version 1: December 25, 2013 Version 2: May 8, 2017 The written text licensed under the LLVM License and is adapted from the original LLVM documentation. The new Haskell source is released under the MIT license. C
r-west 2014/07/13
haskell

llvm

tutorial

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
FP CompleteãŒãƒ–ãƒ©ã‚¦ã‚¶ãƒ™ãƒ¼ã‚¹ã®Haskellç”¨IDEã‚’ãƒªãƒªãƒ¼ã‚¹
Spring Bootã«ã‚ˆã‚‹APIãƒãƒƒã‚¯ã‚¨ãƒ³ãƒ‰æ§‹ç¯‰å®Ÿè·µã‚¬ã‚¤ãƒ‰ ç¬¬2ç‰ˆ ä½•åƒäººã‚‚ã®é–‹ç™ºè€…ãŒã€InfoQã®ãƒŸãƒ‹ãƒ–ãƒƒã‚¯ã€ŒPractical Guide to Building an API Back End with Spring Bootã€ã‹ã‚‰ã€Spring Bootã‚’ä½¿ã£ãŸREST APIæ§‹ç¯‰ã®åŸºç¤Žã‚’å¦ã‚“ã ã€‚ã“ã®æœ¬ã§ã¯ã€å‡ºç‰ˆæ™‚ã«æ–°ã—ããƒªãƒªãƒ¼ã‚¹ã•ã‚ŒãŸãƒãƒ¼ã‚¸ãƒ§ãƒ³ã§ã‚ã‚‹ Spring Boot 2 ã‚’ä½¿ç”¨ã—ã¦ã„ã‚‹ã€‚ã—ã‹ã—ã€Spring Boot3ãŒæœ€è¿‘ãƒªãƒªãƒ¼ã‚¹ã•ã‚Œã€é‡è¦ãªå¤‰...
r-west 2013/09/22
haskell

IDE

programming

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Idrisã®ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« - ã‚ã‚€ãƒã‚°
r-west 2013/08/24
monad

haskell

language

ä¾å˜åž‹

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Idris: A Language for Type-Driven Development
Idris: A Language for Type-Driven Development Idris is a programming language designed to encourage Type-Driven Development. In type-driven development, types are tools for constructing programs. We treat the type as the plan for a program, and use the compiler and type checker as our assistant, guiding us to a complete program that satisfies the type. The more expressive the type is that we give
r-west 2013/08/24
monad

haskell

language

ä¾å˜åž‹

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Lenses In Pictures - adit.io
Written July 22, 2013 You should know what a functor is before reading this post. Read this to learn about functors. Suppose you want to make a game: data Point = Point { _x, _y :: Double } data Mario = Mario { _location :: Point } player1 = Mario (Point 0 0)
r-west 2013/07/22
haskell

tutorial

lens

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Extensible Effects ã¯ãƒ¢ãƒŠãƒ‰å¤‰æ›åã«å¯¾ã™ã‚‹æ•‘ä¸–ä¸»ã«ãªã‚Šå¾—ã‚‹ã‹ï¼Ÿ
Extensible Effects ã¯ãƒ¢ãƒŠãƒ‰å¤‰æ›åã«å¯¾ã™ã‚‹æ•‘ä¸–ä¸»ã«ãªã‚Šå¾—ã‚‹ã‹ï¼Ÿ konn-san.com Oleg, Sabry and Swords ã‚‰ã«ã‚ˆã‚‹ Extensible Effects: An Alternative to Monad Transf ormers ã®è«–æ–‡ã‚’èªã‚“ã ãƒ¡ãƒ¢çš„ãªä½•ã‹ã§ã™ã€‚ãƒ¢ãƒŠãƒ‰å¤‰æ›åã«é–¢ã™ã‚‹ç°¡å˜ãªç¾çŠ¶ç¢ºèªã‹ã‚‰å…¥ã£ã¦ã¯ã„ã¾ã™ãŒã€æƒ³å®šèªè€…å±¤ã¯æ—¥å¸¸çš„ã«ãƒ¢ãƒŠãƒ‰ã‚„ãƒ¢ãƒŠãƒ‰å¤‰æ›åã‚’ç”¨ã„ãŸãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ã„ã¦ã„ã‚‹äººé”ã§ã™ã€‚ ã©ã¡ã‚‰ã‹ã¨ã„ã†ã¨è‡ªåˆ†å‘ã‘ã®ãƒ¡ãƒ¢ã®æ€§æ ¼ãŒå¼·ã„ã®ã§ã€è©³ã—ã„éƒ¨åˆ†ã¯è«–æ–‡ã‚’å‚ç…§ã—ã¦ã¿ã¦ãã ã•ã„ã€‚ èƒŒæ™¯ï¼šãƒ¢ãƒŠãƒ‰å¤‰æ›åã¨ãã®å•é¡Œ Haskell ã‚’ä¸å¿ƒã«ã€é–¢æ•°åž‹è¨€èªžã§ã¯å‰¯ä½œç”¨ã®ã‚ã‚‹å‡½æ•°ã‚’åˆæˆã™ã‚‹ãŸã‚ã®æ‰‹æ®µã¨ã—ã¦ãƒ¢ãƒŠãƒ‰ãŒåºƒãç”¨ã„ã‚‰ã‚Œã¦ã„ã‚‹ã€‚ãƒ¢ãƒŠãƒ‰ã¯éžå¸¸ã«å¼·åŠ›ãªæŠ½è±¡åŒ–ã§ã€ãŠã‚ˆãå‰¯ä½œç”¨ã¨å‘¼ã¹ã‚‹ã‚‚ã®ã¯ãƒ¢ãƒŠãƒ‰ã‚’ä½¿ã£ã¦å®šå¼åŒ–ã™ã‚‹ã“ã¨ãŒå‡ºæ¥ãŸã€‚ä¾‹ãˆã°ã€å¤§åŸŸçš„ãªç’°å¢ƒ r ã‚’
r-west 2013/07/22
haskell

monad

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŠãƒ‰ã®å…ã¤ã®ç³»çµ±[Functor x Functor] - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
ãƒ¢ãƒŠãƒ‰ã¯ã€Œã‚¢ã‚¯ã‚·ãƒ§ãƒ³ã€ã‚’è¡¨ã™æŠ½è±¡çš„ãªæ§‹é€ ã§ã‚ã‚‹ã€‚ãƒ¢ãƒŠãƒ‰ã¯ã€Haskellã«ã•ã¾ã–ã¾ãªæ¦‚å¿µã«å¯¾ã™ã‚‹è¨˜è¿°èƒ½åŠ›ã‚’ã‚‚ãŸã‚‰ã™ã€‚ ãƒ¢ãƒŠãƒ‰ã®åŸºç¤Ž return :: a -> m a: ç´”ç²‹ãªå€¤ã‚’ãƒ¢ãƒŠãƒ‰ã§åŒ…ã‚€ã€‚ m >>= f :: m a -> (a -> m b) -> m b: ãƒ¢ãƒŠãƒ‰mã«åŒ…ã¾ã‚ŒãŸå€¤ã‚’fã«æ¸¡ã—ã€ãã®çµæžœã¨ã—ã¦ç¾ã‚ŒãŸãƒ¢ãƒŠãƒ‰ã‚’çµåˆã™ã‚‹ã€‚ å›ºæœ‰ã‚¢ã‚¯ã‚·ãƒ§ãƒ³: ãã‚Œãžã‚Œã®ãƒ¢ãƒŠãƒ‰ã«å›ºæœ‰ã®æ–¹æ³•ã§ãƒ¢ãƒŠãƒ‰ã‚’ç”Ÿã¿å‡ºã™ã€‚ å®Ÿè¡Œ: ãƒ¢ãƒŠãƒ‰ã«åŒ…ã¾ã‚ŒãŸå€¤ã‚’ã€ã‚ˆã‚Šæ ¹æºçš„ãªå½¢ã«é‚„å…ƒã™ã‚‹ã€‚ ãƒ¢ãƒŠãƒ‰å‰‡ ãƒ¢ãƒŠãƒ‰ã«ä»¥ä¸‹ã®ä¸‰ã¤ã®åˆ¶ç´„ã‚’èª²ã™ã“ã¨ã«ã‚ˆã£ã¦ã€æœ€ä½Žé™åº¦ã®è¨˜è¿°èƒ½åŠ›ã‚’ä¿è¨¼ã—ã¦ã„ã‚‹ã€‚ return a >>= k == k a m >>= return == m m >>= (\x -> k x >>= h) == (m >>= k) >>= h ã‚ˆã‚Šå¼·ã„åˆ¶ç´„ã¯ã€ã‚ˆã‚Šå¼·ã„åŠ›ã‚’ç”Ÿã¿å‡ºã™ã€‚ ãƒ¢ãƒŠãƒ‰ã®åˆ†é¡ž ãƒ¢ãƒŠãƒ‰ã¯ã€ä»¥ä¸‹ã®6ã¤
r-west 2013/06/05
haskell

programming

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Functors, Applicatives, And Monads In Pictures - adit.io
Written April 17, 2013 updated: May 20, 2013 Here's a simple value: And we know how to apply a function to this value: Simple enough. Lets extend this by saying that any value can be in a context. For now you can think of a context as a box that you can put a value in: Now when you apply a function to this value, you'll get different results depending on the context. This is the idea that Functors
r-west 2013/04/22
haskell

functional

functor

monad

å¾Œã§èªã‚€

æ•™è‚²
ãƒªãƒ³ã‚¯
Google Code Archive - Long-term storage for Google Code Project Hosting.
Code Archive Skip to content Google About Google Privacy Terms
r-west 2013/03/03
haskell

tapl

type

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Haskellã®å˜ä½“ãƒ†ã‚¹ãƒˆæœ€å‰ç·š - ã‚ã©ã‘ãªã„è©±
ã“ã®è¨˜äº‹ã®æœ€æ–°ç‰ˆã¯ã€githubã§ç®¡ç†ã•ã‚Œã¦ã„ã¾ã™ã€‚ ã“ã‚Œã¯Haskell Advent Calendar 2012ã®5æ—¥ç›®ã®è¨˜äº‹ã§ã™ã€‚ Haskellã§ä½œæˆã—ãŸãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã«å¯¾ã—ã¦ã€å˜ä½“ãƒ†ã‚¹ãƒˆã‚’æ›¸ããŸã‚ã®æœ€æ–°æƒ…å ±ã‚’ãŠå±Šã‘ã—ã¾ã™ã€‚ è¦ç´„ è¦ç‚¹ã¯4ã¤ã§ã™ã€‚ åˆ©ç”¨è€…ã«è¦‹ã›ãŸã„æŒ¯ã‚‹èˆžã„ã¯ã€doctest ã§æ›¸ã åˆ©ç”¨è€…ã«è¦‹ã›ãŸããªã„æŒ¯ã‚‹èˆžã„ã¯ã€hspec ã§æ›¸ã ãƒ†ã‚¹ãƒˆã‚’è‡ªå‹•åŒ–ã™ã‚‹ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ã¨ã—ã¦ã¯ Cabal ã‚’ä½¿ã† doctest ã§ã‚‚ hspec ã§ã‚‚ã€ç´”ç²‹ãªã‚³ãƒ¼ãƒ‰ã«å¯¾ã—ã¦ã¯ã€ã§ãã‚‹ã ã‘ QuickCheck ãªã©ã®æ€§è³ªãƒ†ã‚¹ãƒˆã‚’æ›¸ã ã“ã®è¨˜äº‹ã§ä¸€ç•ªä¼ãˆãŸã„ã®ã¯ã€3) ã§ã™ã€‚ä¾‹é¡Œã¨ã—ã¦ã¯ã€Base64 ã¨ã„ã†ç¬¦å·åŒ–ã‚’å–ã‚Šä¸Šã’ã¾ã™ã€‚Base64 ã¯çŸ¥ã£ã¦ã„ã‚‹ã¨ä»®å®šã—ã¦è©±ã‚’é€²ã‚ã¾ã™ã®ã§ã€çŸ¥ã‚‰ãªã„äººã¯ã‚ã‚‰ã‹ã˜ã‚ Wikipedia ã® Base64 ã®èª¬æ˜Žã§ã‚‚èªã‚“ã§ä¸‹ã•ã„ã€‚ ã“ã®è¨˜äº‹ã§åˆ©ç”¨ã™ã‚‹ã‚³
r-west 2012/12/06
haskell

test

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
What's the status of current Functional Reactive Programming implementations?
I'm trying to visualize some simple automatic physical systems (such things as pendulum, robot arms,etc.) in Haskell. Often those systems can be described by equations like df/dt = c*f(t) + u(t) where u(t) represents some kind of 'intelligent control'. Those systems look to fit very nicely in the Functional Reactive Programming paradigm. So I grabbed the book "The Haskell School of Expression" by
r-west 2012/11/23
frp

functional

haskell

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
ãã‚ãã‚Freeãƒ¢ãƒŠãƒ‰ã«é–¢ã—ã¦ä¸€è¨€ã„ã£ã¨ãã‹ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
Freeãƒ¢ãƒŠãƒ‰ã¯ã™ã”ã„ã€‚ Haskellã‚’æ›¸ã„ã¦ã„ã¦ã€ã€Œç‰¹æ®ŠåŒ–ã•ã‚ŒãŸå‡¦ç†ã‚’è¨˜è¿°ã™ã‚‹ãƒ¢ãƒŠãƒ‰ãŒç°¡å˜ã«ä½œã‚ŒãŸã‚‰ä¾¿åˆ©ã ã‚ã†ãªãƒ¼ã€ã¨æ€ã£ãŸã“ã¨ã¯ãªã„ã ã‚ã†ã‹ï¼Ÿç°¡å˜ã«ä½œã‚Œã‚‹ã®ã§ã‚ã‚‹ã€ãã†ã€Haskellãªã‚‰ãã€‚ ã“ã‚ŒãŒã€ç´”ç²‹ãªFreeãƒ¢ãƒŠãƒ‰ã®å®šç¾©ã§ã‚ã‚‹ã€‚ data Free f a = Pure a | Free (f (Free f a)) instance Functor f => Monad (Free f) where return = Pure Pure a >>= k = k a Free fm >>= k = Free (fmap (>>=k) fm) (Functorã€Applicativeã®ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹å®£è¨€ã¯è‡ªæ˜Žãªã®ã§çœç•¥) ä¸Žãˆã‚‰ã‚ŒãŸFunctorã‚’ãŠäº’ã„ã«åŸ‹ã‚è¾¼ã¿åˆã£ã¦ã„ã‚‹ã€ã¨ã„ã†æ¼ ç„¶ã¨ã—ãŸå°è±¡ã§ã€ä½•ãŒå¬‰ã—ã„ã®ã‹ã‚ˆãã‚ã‹ã‚‰ãªã„ã‹ã‚‚ã—ã‚Œãªã„ã€‚ã ãŒã€ã“ã®å˜ç´”ã•ã“ãFreeãƒ¢ãƒŠãƒ‰ã®ä¾¿åˆ©
r-west 2012/11/11
å¾Œã§èªã‚€

programming

haskell

monad
ãƒªãƒ³ã‚¯
ãªãœ Haskell ã§ã¯ã‚ãƒ¥ãƒ¼ãŒè»½ã‚“ã˜ã‚‰ã‚Œã¦ã„ã‚‹ã‹ï¼Ÿ - ã‚ã©ã‘ãªã„è©±
Haskell ã§ã¯ã‚ãƒ¥ãƒ¼ãŒæ¬²ã—ããªã£ãŸã‚‰ Data.Sequence ã‚’ä½¿ãˆã¨è¨€ã‚ã‚Œã‚‹ã€‚Seq ã¯ä¸¡ç«¯ã‚ãƒ¥ãƒ¼ã ã—ã€ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã¨ã—ã¦ä½¿ãˆã°ã€é€£çµ(><)ã‚„åˆ†å‰²(splitAt)ãŒã€ãªã‚‰ã—è¨ˆç®—é‡ã§ O(log N) ã¨ã„ã†å„ªã‚Œã‚‚ã®ã§ã‚ã‚‹ã€‚ã—ã‹ã—ã€å†…éƒ¨ãŒfinger treeãªã®ã§ã‚³ãƒ¼ãƒ‰ãŒè¤‡é›‘ãªã®ã¨ã€è¨ˆç®—é‡ãŒã€Œãªã‚‰ã—ã€ãªã¨ã“ã‚ãŒçŽ‰ã«å‚·ã§ã‚ã‚‹ã€‚ ã‚‚ã£ã¨å˜ç´”ã§ã€æœ€æ‚ªè¨ˆç®—é‡ã‚’ä¿è¨¼ã™ã‚‹(ä¸¡ç«¯ã§ãªã„)ã‚ãƒ¥ãƒ¼ãŒæ¨™æº–ã§æä¾›ã•ã‚Œã¦ã‚‚ã„ã„æ°—ãŒã™ã‚‹ã€‚ãã®å€™è£œã«ã¯ã€ãƒªã‚¢ãƒ«ã‚¿ã‚¤ãƒ ã‚ãƒ¥ãƒ¼ãŒã‚ã‚‹ã€‚ã©ã†ã—ã¦æ¨™æº–ã§ã‚ãƒ¥ãƒ¼ãŒæä¾›ã•ã‚Œãªã„ã®ã ã‚ã†ï¼Ÿ åƒ•ãªã‚Šã®ç”ãˆã¯ã€Œéœ€è¦ãŒãªã„ã€ã ã€‚ å•é¡Œã‚’è§£ãã¨ãã«ã‚¹ã‚¿ãƒƒã‚¯ã¯ã‚ˆãä½¿ã†ãŒã€ã‚ãƒ¥ãƒ¼ãŒå¿…è¦ãªå•é¡Œã¯ãã‚“ãªã«æ€ã„ã¤ã‹ãªã„ã€‚åƒ•ã¯ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å±‹ãªã®ã§ã€ã‚‚ã¡ã‚ã‚“ãƒ«ãƒ¼ã‚¿ã«ã¯ã‚ãƒ¥ãƒ¼ãŒå¿…è¦ãªã“ã¨ã¯çŸ¥ã£ã¦ã„ã‚‹ãŒã€ãã‚Œä»¥å¤–ã§æœ‰åã©ã“ã‚ã¨è¨€ãˆã°å¹…å„ªå…ˆæŽ¢ç´¢ãã‚‰ã„ã ã€‚ å¹…å„ªå…ˆæŽ¢ç´¢ ã§ã‚‚ã€Haskellã§ã¯ã‚ãƒ¥ãƒ¼
r-west 2012/11/08
å¾Œã§èªã‚€

programming

haskell
ãƒªãƒ³ã‚¯
ã‚¤ãƒ™ãƒ³ãƒˆãƒ‰ãƒªãƒ–ãƒ³ãƒ—ãƒã‚°ãƒ©ãƒ ã®é–¢æ•°åž‹çš„æ›¸ãæ–¹
2012 9 1 CopyrightÂ© 2011 IT Planning,Inc All rights reserved. A B C A A B C ON (* 4 ON/OFF . *) let overwrite_mode = ref false let bar_graph = ref true let line_graph = ref false let scatter_diagram = ref false (OCaml) ( ) ON ON OFF OFF ON OFF ON OFF ON ON OFF OFF ON [ ON] ON[ OFF] let on_bargraph_click () = (* *) if !overwrite_mode then bar_graph := not !bar_graph (* *) else if !bar_graph then (
r-west 2012/10/08
programming

Haskell

PDF

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Why free monads matter
Interpreters Good programmers decompose data from the interpreter that processes that data. Compilers exemplify this approach, where they will typically represent the source code as an abstract syntax tree, and then pass that tree to one of many possible interpreters. We benefit from decoupling the interpreter and the syntax tree, because then we can interpret the syntax tree in multiple ways. For
r-west 2012/10/07
haskell

monad

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
é–¢æ•°ãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®å®Ÿè·µ
ãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã£ã¦ä½•ï¼Ÿ æ™‚åˆ»ã«ã‚ˆã£ã¦å¤‰åŒ–ã™ã‚‹å€¤ã‚’ä½¿ã£ã¦è¨ˆç®—ã™ã‚‹ x = mouse_position.x y = mouse_position.y sum = x + y printf("(%d, %d); sum=%d", x, y, sum) å…¥åŠ›ãŒå¤‰ã‚ã‚‹ãŸã³ã«å†è¨ˆç®— ç”¨é€”: UIã€ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³ãªã© Haskell/MLä¸Šã®ãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° Behavior a: æ™‚åˆ»ã«ã‚ˆã£ã¦å¤‰åŒ–ã™ã‚‹å€¤(ä¸èº«aåž‹) Event a: ç¹°ã‚Šè¿”ã—ç™ºç”Ÿã—å¾—ã‚‹ã‚¤ãƒ™ãƒ³ãƒˆ(aåž‹ã®å€¤ãŒä»˜å±ž) mousePosition :: Behavior (Int, Int) mouseClick :: Event () ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ mapB :: (a -> b) -> Behavior a -> Behavior b mapE :: (a -> b) -> Event a -> Event b
r-west 2012/09/03
programming

haskell

frp

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Haskellã«ã‚ˆã‚‹ãƒ©ã‚¤ãƒ–ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚’é…ä¿¡ã€ŽHaskell Liveã€ | 100SHIKI
ãƒžãƒ‹ã‚¢ãƒƒã‚¯ã ãŒã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãŒã‚‰ã¿ã¯ç´¹ä»‹ã›ã–ã‚‹ã‚’å¾—ã¾ã›ã‚“ãªãƒ»ãƒ»ãƒ»ã€‚ ã¨ã„ã†ã‚ã‘ã§Haskell Liveã§ã¯Haskellã®ãƒ©ã‚¤ãƒ–ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚’é…ä¿¡ã—ã¦ã„ã‚‹ã‚ˆã†ã ã€‚ ã¾ã ç¬¬ä¸€å›žãŒå§‹ã¾ã£ãŸã°ã‹ã‚Šã ãŒã€15åˆ†ã»ã©ã‚’ã‹ã‘ã¦ãƒã‚§ã‚¹ã®ã‚¨ãƒ³ã‚¸ãƒ³ã‚’é–‹ç™ºã™ã‚‹æ§˜åã‚’è¦‹ã›ã¦ãã‚Œã‚‹ã€‚ YouTubeã®å‹•ç”»ã§ã¯ã‚ã‚‹ãŒã€ã¡ã¨æ–‡å—ãŒå°ã•ã„ã®ã§ãƒ•ãƒ«ã‚¹ã‚¯ãƒªãƒ¼ãƒ³ï¼†æœ€é«˜ç”»è³ªã§è¦‹ã‚‹ã“ã¨ã‚’ãŠã™ã™ã‚ã™ã‚‹ã€‚ ã¾ãŸã‚½ãƒ¼ã‚¹è‡ªä½“ã¯Githubã«ã‚ã‚‹ã®ã§ã‚ã‚ã›ã¦è¦‹ã‚‹ã¨ã„ã„ã ã‚ã†ã€‚ ã“ã†ã—ãŸãƒ©ã‚¤ãƒ–ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã®ã‚µã‚¤ãƒˆã¯ã‚‚ã£ã¨å¢—ãˆã‚‹ã¨ã„ã„ã§ã™ãªã€‚
r-west 2012/08/01
haskell

å‹•ç”»

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
Conduitã¨Haskellã§ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ãƒ—ãƒã‚ã‚·ã‚µãƒ¼ãƒã‚’ä½œã‚‹ - ç´”ç²‹é–¢æ•°ç©ºé–“
ã“ã®è¨˜äº‹ã¯ http://www.yesodweb.com/blog/2012/06/conduit-0-5 ã®ç¿»è¨³ã§ã™ã€‚ conduit-0.5 ã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ conduitã¯ã‚¹ãƒˆãƒªãƒ¼ãƒ ãƒ‡ãƒ¼ã‚¿ã‚’æ‰±ã†ãŸã‚ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã™ã€‚ conduitã‚’ç”¨ã„ã‚‹ã¨ã€æ§˜ã€…ãªå½¢ã®ãƒ‡ãƒ¼ã‚¿ã‚’ç”Ÿæˆã€å¤‰å½¢ã€æ¶ˆè²»ã™ã‚‹ã‚ˆã†ãªå‡¦ç†ã‚’ã€ ç°¡å˜ã«çµ„ã¿åˆã‚ã›ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ enumerator/iterateeãƒ‘ãƒ©ãƒ€ã‚¤ãƒ ã¨åŒã˜å•é¡Œã‚’è§£æ±ºã™ã‚‹ã“ã¨ã‚’ç›®çš„ã«ä½œã‚‰ã‚Œã¾ã—ãŸãŒã€ ã‚¢ãƒ—ãƒãƒ¼ãƒã¯ã“ã‚Œã‚‰ã®ã‚‚ã®ã¨ã¯ç•°ãªã‚Šã¾ã™ã€‚ conduitã¯ç°¡å˜ã«ç†è§£ã—ã¦åˆ©ç”¨ã§ãã‚‹ã‚‚ã®ã«ãªã‚‹ã“ã¨ã‚’ä¸€ç•ªã®ç›®çš„ã¨ã—ã¦ã„ã¾ã™ã€‚ é…å»¶I/Oã¨ã¯ç•°ãªã‚Šã€ãƒªã‚½ãƒ¼ã‚¹ã®å³æ™‚é–‹æ”¾ã‚’ä¿è¨¼ã—ã€ ã¾ãŸã€ç´”ç²‹ãªã‚³ãƒ¼ãƒ‰ã«ä¾‹å¤–ã‚’æŒã¡è¾¼ã¿ã¾ã›ã‚“ã€‚ ä»Šå›žã®ãƒªãƒªãƒ¼ã‚¹ã§Sourceã€Sinkã€Conduitã®ãã‚Œãžã‚Œã‚’ä½œã‚‹ãŸã‚ã®ã€ ã‚·ãƒ³ãƒ—ãƒ«ã§åŠ¹çŽ‡ã®è‰¯ã„ã€é«˜ãƒ¬ãƒ™ãƒ«ã®ã‚¤ãƒ³ã‚¿ãƒ¼ãƒ•
r-west 2012/07/02
haskell

iteratee

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
How wonderful to be (statically) typed ã€œåž‹ãŒä»˜ãã£ã¦ã‚¹ãƒãƒ©ã‚·ã‚¤ã€œ
PFIç¤¾å†…ã‚»ãƒŸãƒŠãƒ¼ã§å¼·åŠ›ãªåž‹ã‚·ã‚¹ãƒ†ãƒ ãŒã‚‚ãŸã‚‰ã™æ§˜ã€…ãªæ©æµã«ã¤ã„ã¦ç™ºè¡¨ã—ãŸéš›ã®è³‡æ–™ã§ã™ã€‚ è£œè¶³çš„ãªè¨˜äº‹ã¯ã“ã¡ã‚‰ã‚’ã©ã†ãžï¼š http://blog.konn-san.com/article/20120412/how-wonderful-to-be-typed ã¾ãŸã€ç™ºè¡¨ã®æ¨¡æ§˜ã¯ä»¥ä¸‹ã® ustream ã‹ã‚‰ã”è¦§ã«ãªã‚Œã¾ã™ã€‚ http://www.ustream.tv/recorded/21781769 Read less
r-west 2012/04/13
ã“ã£ã¡ã‚‚desireã§è¦‹ã‚Œãªã„â€¦

haskell

type

å¾Œã§èªã‚€
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸