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

mrkn id:mrkn

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

${{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 è§£èª¬æœ¬ å°å² - golden-luckyã®æ—¥è¨˜
æ—¥æœ¬èªžåœã«ãŠã‘ã‚‹Haskellã®è§£èª¬æœ¬ã«ã¯ã€ã“ã‚Œã¾ã§4å›žã®æ³¢ãŒã‚ã‚Šã¾ã—ãŸã€‚ ãã‚Œã‚’æ€ã„å‡ºã—ãªãŒã‚‰ã€æœ€å¾Œã«ã€Žãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°Haskell ç¬¬2ç‰ˆã€ã®ç´¹ä»‹ã‚’ã—ã¾ã™ã€‚ ç¬¬1æ³¢ ç¬¬2æ³¢ ç¬¬3æ³¢ ç¬¬4æ³¢ ã€Žãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°Haskellã€ãŒæ”¹è¨‚ã•ã‚Œã¾ã™ ç¬¬2ç‰ˆã§ã¯ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹åž‹ã®ç†è§£ãŒæ·±ã¾ã‚‹ã¨æ€ã† ã“ã“ã§è²·ãˆã¾ã™ ç¬¬1æ³¢ Haskellè§£èª¬æœ¬ã®1ã¤ã‚ã®æ³¢ã¯ã€2006å¹´ã€ã€Žå…¥é–€Haskellã€ã¨ã€Žãµã¤ã†ã®Haskellã€ãŒå‡ºç‰ˆã•ã‚ŒãŸé ƒã«ã‚ã‚Šã¾ã—ãŸã€‚ ã“ã®ã†ã¡ã€ã€Žå…¥é–€Haskellã€ã¯ï¼ˆãŠãã‚‰ãï¼‰æ—¥æœ¬åˆã®Haskellæœ¬ã§ã™ã€‚ ã€Žå…¥é–€Haskellã€ï¼ˆ2006å¹´ï¼‰ ã€Žãµã¤ã†ã®Haskellã€ï¼ˆ2006å¹´ï¼‰ ã€Žãµã¤ã†ã®Haskellã€ã¯ã€æ›¸åã ã‘ã‚’è¦‹ã‚‹ã¨ã€Œç‰¹æ®Šãªè¨€èªžã€ã§ã‚ã‚‹Haskellã‚’ã€Œãµã¤ã†ã€ã«èª¬æ˜Žã—ã¦ã„ã‚‹æœ¬ã§ã‚ã‚‹ã‚ˆã†ã«æ€ãˆã‚‹ã®ã§ã™ãŒã€å®Ÿã¯ãã†ã§ã‚‚ãªãã¦ã€æ·¡ã€…ã¨éƒ¨å“ã®èª¬æ˜Žã‚’ã—ã¦ã„ãæ„Ÿã˜ã®å†…å®¹
mrkn 2019/08/03
ãŠã‚‚ã—ã‚ã„ã¾ã¨ã‚ã ã£ãŸ

haskell
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŠãƒ‰ã£ã¦çµå±€ä½•ãªã®ã‚ˆ? â€” join to Monad v0.1.3 documentation
ãƒ¢ãƒŠãƒ‰ã£ã¦çµå±€ä½•ãªã®ã‚ˆ?Â¶ Haskell ã‚’å‹‰å¼·ã—ã‚ˆã†ã¨ã™ã‚‹ã¨å¿…ãšã€Œãƒ¢ãƒŠãƒ‰ã€ã£ã¦ã®ãŒå‡ºã¦ãã¾ã™ã€‚å›°ã£ãŸã‚‚ã®ã§ã™ã€‚æ•°å¦ã¨ã‹åœè«–ã¨ã‹é–¢ä¿‚ãŒã‚ã‚‹ã‚‰ã—ãã£ã¦ã€ä½•ãŒæ›¸ã„ã¦ã‚ã‚‹ã‚“ã ã‹åˆ†ã‹ã‚‰ãªãã£ã¦å«Œã«ãªã£ã¦ã—ã¾ã„ã¾ã™ã€‚ã§ã‚‚ãã€Haskell ã£ã¦å‡„ã„ã‚‰ã—ã„ã˜ã‚ƒãªã„ã§ã™ã‹ã€æ ¼å¥½è‰¯ã„ã‚‰ã—ã„ã˜ã‚ƒãªã„ã§ã™ã‹ã€‚ã“ã“ã¯ã¡ã‚‡ã£ã¨ãŒã‚“ã°ã£ã¦è‰²ã€…è€ƒãˆã¦ã¿ã¾ã—ã‚‡ã†ã€‚ ãã‚‚ãã‚‚ Haskell ã£ã¦ä½•ãªã®ã‚ˆ?Â¶ ä½•ãªã‚“ã§ã—ã‚‡ã†ãã€Haskell ã£ã¦ã€‚ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿è¨€èªžã‚‰ã—ã„ã‚“ã§ã™ã€ã‚ã€ãã‚Œã¯åˆ†ã‹ã£ã¦ã‚‹ã¨ã€‚è‰¯ãæŒ™ã’ã‚‰ã‚Œã‚‹æ€§è³ªã¯æ¬¡ãªæ„Ÿã˜?: é–¢æ•°åž‹è¨€èªž å¼·ã„åž‹ä»˜ã‘ é…å»¶è©•ä¾¡ å‚ç…§é€éŽ ã“ã“ã§ã¡ã‚‡ã£ã¨åž‹ã«é–¢ã—ã¦è¦‹ã¦ã¿ã¾ã—ã‚‡ã†ã€‚è©¦ã—ã« Haskell ã®å®Ÿè£…ã® 1 ã¤ã§ã‚ã‚‹ Hugs ã§ 1 ã«ã¤ã„ã¦è€ƒãˆã¦ã¿ã¾ã™ã€‚Hugs ã§ã¯ :type ã‚„ :info ã¨ã„ã†ã‚³ãƒžãƒ³ãƒ‰ã§ hugs ã«åž‹ã®æƒ…å ±ãªã©ã‚’è³ªå•ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ä¾‹ãˆ
mrkn 2015/08/17
haskell

monad
ãƒªãƒ³ã‚¯
dnngraph by ajtulloch
dnngraph A DSL for deep neural networks, supporting Caffe and Torch View on GitHub Download .zip Download .tar.gz DNNGraph - A deep neural network model generation DSL in Haskell It consists of several parts: A DSL for specifying the model. This uses the lens library for elegant, composable constructions, and the fgl graph library for specifying the network layout. A set of optimization passes tha
mrkn 2015/06/30
â€œDNNGraph - A deep neural network model generation DSL in Haskellâ€

caffe

torch

haskell
ãƒªãƒ³ã‚¯
Page not found
Apologies, we are unable to display the requested page at the moment. You may wish to head back to our home page. You can contact us if you have further enquiries.
mrkn 2015/05/06
Singapore prime minister Lee Hsien Loong said he is reading "Learn you a Haskell for great good".

haskell
ãƒªãƒ³ã‚¯
è¨ƒå ±: Haskellè¨è¨ˆè€…Paul Hudakæ° | ã‚¹ãƒ©ãƒ‰ ãƒ‡ãƒ™ãƒãƒƒãƒ‘ãƒ¼
ç´”ç²‹é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªž Haskellã®ä¸»è¦ãªè¨è¨ˆè€…ã®ä¸€äººã¨ã—ã¦çŸ¥ã‚‰ã‚Œã‚‹ç±³ã‚¤ã‚§ãƒ¼ãƒ«å¤§å¦æ•™æŽˆã®Paul Hudakæ°ãŒ4æœˆ29æ—¥ã€ç™½è¡€ç—…ã®ãŸã‚62æ³ã§æ»åŽ»ã—ãŸ(Yale Daily Newsã®è¨˜äº‹ã€ ã‚¤ã‚§ãƒ¼ãƒ«å¤§å¦ã®ç™ºè¡¨ã€ æœ¬å®¶/.)ã€‚ Hudakæ°ã¯2009å¹´12æœˆã«ç™½è¡€ç—…ã¨è¨ºæ–ã•ã‚Œã€2010å¹´ã«ã¯å¹¹ç´°èƒžç§»æ¤ã‚’å—ã‘ã¦ã„ãŸã€‚2013å¹´1æœˆã¾ã§ã®é—˜ç—…ã®æ§˜åã¯ã€The Yale Haskell Groupã®Hudakæ°ã®å€‹äººãƒšãƒ¼ã‚¸ã«è¨˜è¼‰ã•ã‚Œã¦ã„ã‚‹ã€‚6å¹´è¿‘ã„é—˜ç—…ç”Ÿæ´»ã‚’ç¶šã‘ã‚‹é–“ã‚‚ã‚»ã‚¤ãƒ–ãƒ«ãƒƒã‚¯ãƒ»ã‚«ãƒ¬ãƒƒã‚¸ã®å¯®é•·ã‚’å‹™ã‚ã€ã‚ãƒ£ãƒ³ãƒ‘ã‚¹ã§ã®æ´»å‹•ã«ã‚‚ç©æ¥µçš„ã«å‚åŠ ã—ã¦ã„ãŸãã†ã ã€‚äº¡ããªã‚‹æ•°é€±é–“å‰ã«ã‚‚ã€å¦ç”ŸãŒHudakæ°ã®ãŸã‚ã«é–‹å‚¬ã—ãŸã‚¢ãƒ¼ãƒˆã‚¤ãƒ™ãƒ³ãƒˆã«å‚åŠ ã—ã‚ˆã†ã¨ã—ã¦ã„ãŸã¨ã„ã†ã€‚
mrkn 2015/05/02
RIP

haskell
ãƒªãƒ³ã‚¯
HaskellãŒiOSã‚’ã‚µãƒãƒ¼ãƒˆã€æ€§èƒ½ã‚’æ”¹å–„
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ãŒæœ€è¿‘ãƒªãƒªãƒ¼ã‚¹ã•ã‚Œã€é‡è¦ãªå¤‰...
mrkn 2014/04/27
haskell

ios
ãƒªãƒ³ã‚¯
Lost in Technopolis
As some one who has enjoyed the Lisp language (in several flavors) for about 15 years now, I wanted to express some of my reactions at recently discovering Haskell, and why it has supplanted Lisp as the apple of my eye. Perhaps it will encourage others to explore this strange, wonderful world, where it looks like some pretty damn cool ideas are starting to peek over the horizon. First, let me say
mrkn 2013/08/07
haskell

lisp

functional_programming
ãƒªãƒ³ã‚¯
Ajhc - Haskell everywhere
*** We are closing Ajhc project. *** Metasepi Arafura iteration is closed. We decided to use ATS Programming Language for our next iteration. After merging Ajhc's Context Local Heap into jhc, this project will be shutdown. Please use jhc instead of Ajhc. The jhc-components may be useful, if you can't build original jhc. History of Ajhc Haskell compiler Please read Metasepi Foundation report in Jap
mrkn 2013/08/02
Haskell

jhc
ãƒªãƒ³ã‚¯
é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€ Haskellã§å¦ã¶åŽŸç†ã¨æŠ€æ³• | Ohmsha
æœ¬æ›¸ã¯Haskellã€OCamlã€F#ã€Scalaã¨ã„ã£ãŸè¨€èªžã®æ™®åŠã«ã‚ˆã‚Šæ”¹ã‚ã¦æ³¨ç›®ã•ã‚Œã‚‹ã€Œé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€ã®ç†è«–ã‚’ä½“ç³»çš„ã«å¦ã¶æ•™ç§‘æ›¸"Introduction to Functional Programming using Haskell"ï¼ˆPrentice Hall, 1998ï¼‰ã®ç¿»è¨³ã§ã™ã€‚ é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘ã‚‹è©•ä¾¡æˆ¦ç•¥ã€ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€è¨ˆç®—é‡ã€åž‹ã€ãƒ¢ãƒŠãƒ‰ã®ä»•çµ„ã¿ãªã©ã«ã¤ã„ã¦ã€Haskellã«ã‚ˆã‚‹ã‚·ãƒ³ãƒ—ãƒ«ãªã‚³ãƒ¼ãƒ‰ã‚’ä¾‹ã«è§£èª¬ã—ã¦ã„ã¾ã™ã€‚ è¨³è€…åºæ–‡ ç¬¬2ç‰ˆã¾ãˆãŒã æ•™å¸«ã¸ã®åŠ©è¨€ è¬è¾ž ç¬¬1ç« åŸºæœ¬æ¦‚å¿µ 1.1 ã‚»ãƒƒã‚·ãƒ§ãƒ³ã¨ã‚¹ã‚¯ãƒªãƒ—ãƒˆ 1.2 è©•ä¾¡ 1.3 å€¤ 1.4 é–¢æ•° 1.5 å®šç¾© 1.6 åž‹ 1.7 ä»•æ§˜ 1.8 ç« æœ«ãƒŽãƒ¼ãƒˆ ç¬¬2ç« å˜ç´”ãªãƒ‡ãƒ¼ã‚¿åž‹ 2.1 ãƒ–ãƒ¼ãƒ«å€¤ 2.2 æ–‡å— 2.3 åˆ—æŒ™ 2.4 çµ„ï¼ˆã‚¿ãƒ—ãƒ«ï¼‰ 2.5 ãã®ä»–ã®åž‹ 2.6 åž‹ã‚·ãƒŽãƒ‹ãƒ 2.7 æ–‡å—åˆ— 2.8
mrkn 2012/10/19
ebookç‰ˆã»ã—ã„

books

haskell

functional_programming
ãƒªãƒ³ã‚¯
Yesod Web Framework for Haskell
Yesod is a Haskell web framework for productive development of type-safe, RESTful, high performance web applications. Yesod is a Haskell web framework for productive development of type-safe, RESTful, high performance web applications. Why Yesod? Turn runtime bugs into compile-time errors Yesod believes in the philosophy of making the compiler your ally, not your enemy. We use the type system to e
mrkn 2012/06/24
haskell

web
ãƒªãƒ³ã‚¯
48æ™‚é–“ã§Schemeã‚’æ›¸ã“ã† - Wikibooks
Webä¸Šã«ã‚ã‚‹ã»ã¨ã‚“ã©ã®Haskellãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯è¨€èªžã«ã¤ã„ã¦ã®ãƒžãƒ‹ãƒ¥ã‚¢ãƒ«ã®ã‚ˆã†ãªæ•™ãˆæ–¹ã‚’ã—ã‚ˆã†ã¨ã—ã¦ã„ã‚‹ã‚ˆã†ã§ã™ã€‚ãã‚Œã‚‰ã«ã¯è¨€èªžã®æ–‡æ³•ã€æ¦‚å¿µãŒå°‘ã—è¼‰ã£ã¦ã„ã¦ã€èªè€…ã«å¯¾è©±ç’°å¢ƒã§ã„ãã¤ã‹ã®ç°¡å˜ãªé–¢æ•°ã‚’ä½œã‚‹ã‚ˆã†ã«æŒ‡ç¤ºã—ã¾ã™ã€‚ã‚ˆãæ©Ÿèƒ½ã™ã‚‹æœ‰ç”¨ãªãƒ—ãƒã‚°ãƒ©ãƒ ã®æ›¸ãæ–¹ã¯å¤§æŠµæœ€å¾Œã«ã¾ã‚ã•ã‚Œã‚‹ã‹ã€ãã‚‚ãã‚‚çœã‹ã‚Œã¦ã„ãŸã‚Šã—ã¾ã™ã€‚ ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯é•ã†æ–¹é‡ã‚’å–ã‚Šã¾ã™ã€‚ã‚³ãƒžãƒ³ãƒ‰ãƒ©ã‚¤ãƒ³å¼•æ•°è§£æžã‹ã‚‰å§‹ã‚ã¦ã€å®Œå…¨ã«æ©Ÿèƒ½ã™ã‚‹R5RS Schemeã®ã‹ãªã‚Šå¤§ããªã‚µãƒ–ã‚»ãƒƒãƒˆã®å®Ÿè£…ã¾ã§é€²ã¿ã¾ã™ã€‚é“ã™ãŒã‚‰ã€Haskellã®æŒã¤I/Oã€mutable stateã€dynamic typingã€ã‚¨ãƒ©ãƒ¼å‡¦ç†ã€ãã—ã¦æ§‹æ–‡è§£æžæ©Ÿèƒ½ã‚’å¦ã³ã¾ã™ã€‚ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’çµ‚ãˆã‚‹é ƒã«ã¯ã€ã‚ãªãŸã¯Haskellã¨Schemeä¸¡æ–¹ãŒã‹ãªã‚Šè‰¯ãã‚ã‹ã‚‹ã‚ˆã†ã«ãªã£ã¦ã„ã‚‹ã¯ãšã§ã™ã€‚ ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã®å¯¾è±¡èªè€…ã¯ä¸»ã«ä»¥ä¸‹ã®2ç¨®é¡žã§ã™ã€‚ Lispã‹Sch
mrkn 2012/06/24
haskell

scheme

programming

tutorial
ãƒªãƒ³ã‚¯
Haskell-jp wiki - Front Page
ã‚ˆã†ã“ãHaskell-jp wikiã¸! ã“ã®ã‚µã‚¤ãƒˆã«ã¤ã„ã¦ï¼ˆç¾åœ¨ã¯ç·¨é›†ã§ããªã„çŠ¶æ…‹ã§å…¬é–‹ã—ã¦ã„ã¾ã™ï¼ï¼‰ ã“ã®Wikiã¯Haskellé–¢é€£æƒ…å ±ã‚’æ—¥æœ¬èªžã§ã¾ã¨ã‚ã‚‹ãŸã‚ã®ãƒãƒ¼ã‚¿ãƒ«ã‚µã‚¤ãƒˆã§ã™ã€‚ 2022å¹´11æœˆã¾ã§git itã¨ã„ã†Wikiã‚¨ãƒ³ã‚¸ãƒ³ï¼ˆã‚‚ã¡ã‚ã‚“Haskellè£½ï¼‰ã§é‹ç”¨ã•ã‚Œã¦ãŠã‚Šã¾ã—ãŸãŒã€ãƒ›ã‚¹ãƒ†ã‚£ãƒ³ã‚°ã‚µãƒ¼ãƒ“ã‚¹ã¨ã—ã¦åˆ©ç”¨ã—ã¦ã„ãŸHerokuã®ç„¡æ–™ãƒ—ãƒ©ãƒ³ãŒå»ƒæ¢ã•ã‚ŒãŸã“ã¨ã‚„ã€é•·æœŸé–“ç·¨é›†ã•ã‚Œã‚‹è¦‹è¾¼ã¿ãŒãªã„ã“ã¨ã‹ã‚‰ã€ç¾åœ¨ã¯é™çš„ã‚µã‚¤ãƒˆã¨ã—ã¦èªã¿è¾¼ã¿å°‚ç”¨ã§å…¬é–‹ã—ã¦ã„ã¾ã™ã€‚ç·¨é›†ç”¨ã®ãƒšãƒ¼ã‚¸ã‚„ç·¨é›†å±¥æ´ã«ã‚¢ã‚¯ã‚»ã‚¹ã—ã¦ã‚‚404 Not FoundãŒè¿”ã£ã¦ãã¾ã™ã€‚ãã®ã»ã‹ã€å¤šãã®ãƒšãƒ¼ã‚¸ã¯URLãŒå¤‰ã‚ã£ã¦ã—ã¾ã£ã¦ã„ã‚‹ç‚¹ã«ã”æ³¨æ„ãã ã•ã„ã€‚ç·¨é›†å±¥æ´ã‚’é–²è¦§ã—ãŸã„å ´åˆã¯Gitãƒªãƒã‚¸ãƒˆãƒªãƒ¼ã«ãŠã‘ã‚‹å±¥æ´ã‹ã‚‰ã”è¦§ãã ã•ã„ã€‚ç·¨é›†ã—ãŸã„å ´åˆã¯ä»Šå¾Œã¯haskell-shoenã®åˆ©ç”¨ã‚’ã”æ¤œè¨Žãã ã•ã„ã€‚ ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ ãƒ¡ãƒ¼ãƒªãƒ³ã‚°ãƒªã‚¹ãƒˆ
mrkn 2012/06/24
haskell

japanese

wiki
ãƒªãƒ³ã‚¯
Hoogle(the Haskell API Search Engine)
Welcome to Hoogle Links Haskell.org Hackage GHC Manual Libraries Hoogle is a Haskell API search engine, which allows you to search the Haskell libraries on Stackage by either function name, or by approximate type signature. Example searches: map (a -> b) -> [a] -> [b] Ord a => [a] -> [a] Data.Set.insert +bytestring concat Enter your own search at the top of the page. The Hoogle manual contains mor
mrkn 2012/06/24
haskell
ãƒªãƒ³ã‚¯
Haskell-jp wiki - Workshop/ReadGHC/0
èª¿æ•´/å½“æ—¥ã‚¹ã‚±ã‚¸ãƒ¥ãƒ¼ãƒ« GHCã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ãƒªãƒ¼ãƒ‡ã‚£ãƒ³ã‚°å‹‰å¼·ä¼š ç¬¬0å›ž(æº–å‚™ç·¨) - [PARTAKE] è³‡æ–™ GHC ã®æ©Ÿèƒ½ã¨é–¢ã‚ã‚Šã®æ·±ã„ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚„ãƒ„ãƒ¼ãƒ«ãªã©ã®å–å¾— ã©ã®éƒ¨åˆ†ã‚’èªã‚€ã‹ã«ã‚‚ã‚ˆã‚Šã¾ã™ãŒã€GHC ã®æ©Ÿèƒ½ã®ä¸€éƒ¨ã¯ base ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã‚„ DPH ãƒ©ã‚¤ãƒ–ãƒ©ãƒªï¼ˆä¸¦åˆ—é…åˆ—ï¼‰ã€haddock ãªã©å¤–éƒ¨ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚„ãƒ„ãƒ¼ãƒ«ã¨é–¢ ã‚ã£ã¦ã„ã‚‹ã®ã§ã€ã¡ã‚ƒã‚“ã¨èªã‚‚ã†ã¨ã™ã‚‹ãªã‚‰ã€ãã®è¾ºã‚‚å–å¾—ã—ã¦ãŠãå¿…è¦ãŒ ã‚ã‚Šã¾ã™ãã€‚ï¼ˆã¾ãŸãƒ“ãƒ«ãƒ‰æ™‚ã«ã¯ã“ã‚Œã‚‰ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚„ãƒ„ãƒ¼ãƒ«ãŒå¿…è¦ã§ã™ã€‚ï¼‰ git clone å¾Œã€ä»¥ä¸‹ã®ã‚³ãƒžãƒ³ãƒ‰ã‚’å®Ÿè¡Œã—ã¦ä¸‹ã•ã„ã€‚ ./sync-all get ãƒ†ã‚¹ãƒˆã‚„ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã€ãã®ä»–ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚‚å¿…è¦ãªã‚‰ã€ã“ã¡ã‚‰ã®ã‚³ãƒžãƒ³ãƒ‰ ã«ãªã‚Šã¾ã™ã€‚ ./sync-all --testsuite --nofib --extra get http://hackage.haskell.org/trac/ghc
mrkn 2012/02/12
haskell

workshop

readghc
ãƒªãƒ³ã‚¯
The Typeclassopediaã‚’è¨³ã—ã¾ã—ãŸ, The Typeclassopedia - #3(2009-10-20)
â– [Haskell] The Typeclassopediaã‚’è¨³ã—ã¾ã—ãŸ The Monad.Readerã®Issue 13ã«æŽ²è¼‰ã•ã‚ŒãŸThe Typeclassopediaã¨ã„ã†è¨˜äº‹ãŒã€Functor, Monad, Monoid, Applicative, Foldable, Traversable, Arrowã¨ã„ã£ãŸã‚ˆã†ãªåž‹ã‚¯ãƒ©ã‚¹ã«ã¤ã„ã¦è‰¯ãã¾ã¨ã¾ã£ã¦ã„ã¦ã€ãã®ã‚ãŸã‚Šã‚’çŸ¥ã‚ŠãŸã„æ™‚ã®å–ã£æŽ›ã‹ã‚Šã«ãªã‚Šãã†ã ã£ãŸã®ã§ç¿»è¨³ã—ã¦ã¿ã¾ã—ãŸã€‚ ä½œè€…ã®Brent Yorgeyã•ã‚“ã‹ã‚‰ã‚‚è¨±å¯ãŒã„ãŸã ã‘ãŸã®ã§å…¬é–‹ã—ã¾ã™ã€‚ç¿»è¨³ã«æ…£ã‚Œã¦ã„ãªã„ã®ã§å¤‰ãªæ—¥æœ¬èªžï¼ˆç‰¹ã«å°‚é–€ç”¨èªžã®æ—¥æœ¬èªžè¨³ã¯ã‹ãªã‚Šæ€ªã—ã„ï¼‰ãŒã‚ã£ãŸã‚Šã€ãã‚‚ãã‚‚é–“é•ã£ã¦ã„ãŸã‚Šã™ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã®ã§ã€ä½•ã‹è¦‹ã¤ã‘ãŸã‚‰ã‚³ãƒ¡ãƒ³ãƒˆã‚’é ‚ã‘ã‚‹ã¨åŠ©ã‹ã‚Šã¾ã™ã€‚ â– [Haskell] The Typeclassopedia by Brent Yorgey <first
mrkn 2012/01/12
haskell

monad

typeclass

category_theory

arrow

functional_programming
ãƒªãƒ³ã‚¯
Zipper - HaskellWiki
where @ marks a hole: the spot that the subtree appears in. This is the way we shall implement a tree with a focus. One way of expressing this context is as a path from the root of the tree to the hole (to which the required subtree will be attached). To reach our subtree, we needed to go down the left branch, and then down the right one. Note that the context is essentially a way of representing
mrkn 2011/11/01
data_structure

algorithm

zipper

haskell

gap_buffer
ãƒªãƒ³ã‚¯
Why Haskell is Kinda Cool
Iâ€™ve been using Haskell for a while, trying to apply it to large-ish projects. Learning it has been time consuming, but rewarding. Iâ€™ve stuck with it this long because: most classes of bugs are caught at compile time, due to strict type system and pure code (immutability) â€“ code tends to work right the first time itâ€™s run! haskell types are very powerful: using them to design and describe software
mrkn 2011/08/26
haskell
ãƒªãƒ³ã‚¯
Haskell ã® 4 ã¤ã®ç³Š - ã‚ã©ã‘ãªã„è©±
ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹ã§ã¯ã€ç³Šã®é‡è¦ã•ãŒå¼·èª¿ã•ã‚Œã¦ã„ã¾ã™ã€‚ å•é¡Œã‚’è§£ããŸã‚ã®éƒ¨å“ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ãã¨ãã€ãã®å•é¡Œã‚’éƒ¨åˆ†å•é¡Œã«åˆ†å‰²ã—ã€éƒ¨åˆ†å•é¡Œã‚’è§£ãã€ãã®è§£ã‚’åˆæˆã™ã‚‹ã€‚å…ƒã®å•é¡Œã‚’åˆ†å‰²ã™ã‚‹æ–¹æ³•ã¯ã€éƒ¨åˆ†è§£ã‚’å¼µã‚Šåˆã›ã‚‹æ–¹æ³•ã«ç›´æŽ¥ä¾å˜ã™ã‚‹ã€‚ãã‚Œã‚†ãˆã«ã€æ¦‚å¿µçš„ã«ã¯å•é¡Œã‚’ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«åŒ–ã™ã‚‹èƒ½åŠ›ã‚’é«˜ã‚ã‚‹ãŸã‚ã«ã¯ãã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®ãªã‹ã§æ–°ãŸãªç³Šã®é¡žã‚’ç”¨æ„ã—ãªã‘ã‚Œã°ãªã‚‰ãªã„ã€‚... ç³Šã®é‡è¦æ€§ã¯ã€å¤§å·¥ä»•äº‹ã¨ã®é¡žæ¯”ã«ã‚ˆã£ã¦ã€æ£ã—ãè©•ä¾¡ã§ãã‚‹ã€‚æ¤…åã¯ã€éƒ¨åˆ†(åº§éƒ¨ã€è„šã€èƒŒã‚‚ãŸã‚Œãªã©)ã‚’ä½œã‚Šã€ãã‚Œã‚‰ã‚’æ£ã—ããã£ã¤ã‘åˆã›ã‚‹ã“ã¨ã§å®¹æ˜“ã«ä½œã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ã—ã‹ã—ã€ã“ã‚Œã¯ã‚¸ãƒ§ã‚¤ãƒ³ãƒˆã¨æœ¨ã‚’å¼µã‚Šåˆã›ã‚‹ã¨ã„ã†èƒ½åŠ›ã«ä¾å˜ã™ã‚‹ã€‚ãã®èƒ½åŠ›ãŒãªã‘ã‚Œã°ã€æ¤…åã‚’ä½œã‚‹æ–¹æ³•ã¯ã²ã¨ã¤æœ¨ã®å¡Šã‹ã‚‰ãã‚Œã‚’å½«ã‚Šå‡ºã™ä»¥å¤–ãªãã€éžå¸¸ã«é›£ã—ã„ä½œæ¥ã«ãªã‚‹ã€‚ã“ã®ä¾‹ã¯ã€ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«åŒ–ã®å¼·å¤§ãªåŠ›ã¨æ£ã—ã„ç³Šã‚’æŒã¤ã“ã¨ã®é‡è¦æ€§ã®ä¸¡æ–¹ã‚’ä¾‹ç¤ºã™ã‚‹ã‚‚ã®ã§ã‚ã‚‹ã€‚ åƒ•ãŒæ€ã†ã«
mrkn 2011/08/26
haskell

functional_programming

monad

lazy_evaluation
ãƒªãƒ³ã‚¯
é–¢æ•°åž‹è¨€èªžã§ã®é–¢æ•°ã®åŸºç¤ŽçŸ¥è˜ - ã‚ã©ã‘ãªã„è©±
é–¢æ•°åž‹è¨€èªžã§ã®é–¢æ•°ã«ã¤ã„ã¦ã€Haskell ã‚’ç”¨ã„ã¦èª¬æ˜Žã—ã¾ã™ã€‚ é–¢æ•°ã®åž‹ é–¢æ•°ã®åž‹ã¯ã€-> ã‚’ä½¿ã£ã¦æ›¸ãã¾ã™ã€‚ä¾‹ãˆã°ã€Int ã‚’ Char ã«å¤‰æ›ã™ã‚‹ chr ã¨ã„ã†é–¢æ•°ã®åž‹ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ chr :: Int -> Char ä¸€å¼•æ•°ã®é–¢æ•°ã®åž‹ã¯ã€ã¾ãã“ã‚“ãªã‚‚ã‚“ã ã¨æ€ãˆã‚‹ã§ã—ã‚‡ã†ã€‚ã³ã£ãã‚Šã™ã‚‹ã®ã¯ã€å¼•æ•°ãŒå¢—ãˆãŸã¨ãã§ã™ã€‚ãŸã¨ãˆã°ã€replicate ã¨ã„ã†é–¢æ•°ã®åž‹ã‚’è¦‹ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ replicate :: Int -> a -> [a] replicate ã¯ã€ç¬¬äºŒå¼•æ•°ã§æŒ‡å®šã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿ã‚’ç¬¬ãƒ¼å¼•æ•°ã«æŒ‡å®šã•ã‚ŒãŸå€‹æ•°åˆ†ç”¨æ„ã—ã¦ã€ãƒªã‚¹ãƒˆã«ã—ã¦è¿”ã™é–¢æ•°ã§ã™ã€‚([] ã¯é…åˆ—ã§ã¯ãªãã€ãƒªã‚¹ãƒˆã§ã™ã€‚) æ¬¡ã®ã‚ˆã†ã«å‹•ãã¾ã™ã€‚ > replicate 3 "foo" â†’ ["foo","foo","foo"] a ã¯åž‹å¤‰æ•°ã¨ã„ã£ã¦ã€ä»»æ„ã®åž‹ã‚’å–ã‚Œã¾ã™ã€‚ãªã˜ã‚ãªã„äººã¯ã€å…·ä½“çš„ãªåž‹ã‚’å½“ã¦ã¯ã‚ã¦ã¿
mrkn 2011/08/26
haskell

functional_programming

currying
ãƒªãƒ³ã‚¯
Prices of Windows RT tablets drop, point to failure of OS - Windows 8, Microsoft, Windows, hardware systems, tablets, software, operating systems - Hardware - Techworld
Study: Scientists make more discoveries with help from AIOn the downside, the study shows that 82% of researchers report reduced satisfaction with their work.
mrkn 2011/08/17
haskell

interview
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸