https://web.archive.org/web/20201121162132/https://artyom.me/learning-racket-1
https://web.archive.org/web/20201121162132/https://artyom.me/learning-racket-1
WARNING: 2018-04-12: The code snippets for this post are no longer available. This is just as well anyway, since they all depended on an unstable internal compiler interface, which hasnât existed for years. A few weeks ago, I set out to add regular expressions to the Rust distribution with an implementation and feature set heavily inspired by Russ Coxâs RE2. It was just recently added to the Rust
Verified Programming in Guru is a tutorial introduction to Guru: GURU is a pure functional programming language, which is similar in some ways to Caml and Haskell. But GURU also contains a language for writing formal proofs demonstrating the properties of programs. So there are really two languages: the language of programs, and the language of proofs. In comparison to Coq: GURU is inspired largel
For years now, it has been self-evident to us at RedMonk that programming language usage and adoption has been fragmenting at an accelerating rate [coverage]. As traditional barriers to technology procurement have eroded [coverage], developers have been empowered to leverage the runtimes they chose rather than those that were chosen for them. This has led to a sea change in the programming languag
In 1998, I published a book called Purely Functional Data Structures. Ten years later, the book is still selling well. (Every time I get a royalty check, my wife the skeptic says âPeople are still buying that?!â) The ten-year anniversary seems like a good time to reflect back on my experience with this book. Origins My first introduction to functional programming was at Carnegie Mellon University,
HTMLã®è¨æ³ã«ã¤ãã¦ åºæ¬çã«ã¯ãdivãã®æ§ã«è¦ç´ ãçç¥ããã«è¨è¿°ãã¦ããããå±éããã¨ã<div></div>ãã¨ããå½¢ã«å±éããã¾ãã ãã®ã¨ãã«å±éã§ããè¦ç´ ã¯ä»¥ä¸ã®å ¬å¼ããã¥ã¡ã³ãã«æè¨ããã¦ãã¾ãã®ã§ãã¡ããè¦ãã¨ããã§ãã Zen HTML Elements Zen HTML Selectors Zen CheatSheets åºæ¬çãªè¨æ³ ã²ã¨ã¤ãã¤é çªã«è¨è¿°ãã¦èª¬æãã¦ããã¾ãããã°ããåæ©çãªèª¬æã«ãªãã®ã§ããç¨åº¦ç¥ã£ã¦ããæ¹ã¯é£ã°ãã¦ããã ãã¦è¯ããã¨æãã¾ãã ã¾ããã®ãããåºæ¬çãªè¨æ³ã§ãããåç¬ã¿ã°ã®è¨æ³ã«ã¤ãã¦èª¬æãè¡ãã¾ãã cssã®ã»ã¬ã¯ã¿ãã¤ã¡ã¼ã¸ããªããè¦ã¦ããã¨ç´å¾ããããã¨æãã¾ãã ã¿ã°ã ã夿 夿å div å¤æå¾ <div></div> ãã¢ ææ«ã§tabãæ¼ãã¦ãã ãã div 夿å¾ãdivè¦ç´ ã®éã«ã«ã¼ã½ã«ãç§»åããã®ã§ãããã«ãã
ãªãªãªã³åº§æµæç¾¤ãæµè¡ã£ã¦ãã¿ããã§ãããããã§ãå¿çãã¹ãã§ãã æµæç¾¤ã¨èãã¦æãåºãã®ã¯ï¼ A. 鬼æã¡ã²ãã®æµæç¾¤ B. ãã¬ãµã¹æµææ³ ãã®å¿çãã¹ãã§ã¯ãããªããæµæç¾¤ã¨èãã¦æãåºããã®ãåããã¾ããAãé¸ãã ããªãã¯ãæµæç¾¤ãè¦ãã¨é¬¼æã¡ã²ãã®æµæç¾¤ãæãåºãã¾ããããããã©ã¡ããã¨è¨ãã¨ãæå ãã®æ¹ãæãåºãããããæå ãæãããã¦æµæç¾¤ãã¤ãã¤ãè¦ããªãã¿ã¤ãã§ããBãé¸ãã ããªãã¯ãæµæç¾¤ãè¦ã¦ããã¬ãµã¹æµææ³ããæãåºããªãè²§ç¸ãªæãåºã®æã¡ä¸»ã§ããã¡ãªã¿ã«ãç§ã¯é«åã§å®¶æã¨éãããã¹ãããªä¸å¤ãæãåºãã¾ãã ãã¦ãæ¬é¡ã§ããããã°ã©ãã³ã°ã®ããºã«ãåºé¡ãããµã¤ããããã¾ãã調ã¹ã¦ã¿ãã¨ããããããããã§ãããããã°ã©ãã³ã°ã®ããºã«ãè§£ãã¨ãããã°ã©ãã³ã°ã¹ãã«ã ãã§ãªããè«ççæèãåé¡è§£æ±ºè½åãé«ã¾ãã¨æãã¾ããã¾ããæ°ããããã°ã©ãã³ã°è¨èªãç·´ç¿ããã¨ãã«ã
第ï¼å2008/5/31(Sat) Preface ã Chapter 5 第ï¼å2008/7/5(Sat) Chapter 6 ã Chapter 8 第ï¼å2008/8/2(Sat) Chapter 9 ã Chapter 12(éä¸) 第ï¼å2008/9/14(Sun) Chapter 12, 14 ã 19 第ï¼å2008/10/11(Sat) ã¹ãã 対çã®ããããã¼ã¸ç·¨éãã³ã¡ã³ãæç¨¿æã«èªè¨¼ãæ±ãããã¾ãã èªè¨¼ãã¤ã¢ãã°ã«è¡¨ç¤ºãããã¦ã¼ã¶åã¨ãã¹ã¯ã¼ããå ¥åãã¦ãã ããã
èªå®¶è£½ãã¼ã³ã³ä½ãã®è¨é² 身è¿ã§é ãå å·¥é£åãã¨ãã¼ã³ã³ãããããèªä½ãããå æ¥ã決æè¡¨æãè¾¼ãã¦ãã§ãããã¼ã³ã³ãä½ãããã¨ãããã¨ãæ¸ããã®ã ãããçä¼ã¿ã®æéã§ãã£ã¦ããã¾ããã umai-meals.hatenablog.com ç¾å³ãããã¼ã³ã³ãè²·ããã¨ããã¨æ³å¤ãªå¤æ®µããããããã¨ãã£ã¦ä¸â¦
ååã«ã²ãã¤ã¥ãSTMããåå¼·ä¸ãWikipediaã®STMã®èª¬æãèªã¿ç´ãã¦ãããã以ä¸ã®ãããªè¨è¿°ãããã¾ããã 2005å¹´ã«ãTim HarrisãSimon MarlowãSimon Peyton Jones ãã㦠Maurice Herlihy ã«ãã£ã¦ STM ã Concurrent Haskell ä¸ã«æ§ç¯ããããããã¯ä»»æã®ã¢ãããã¯ãªæä½ããã大ããªã¢ãããã¯ãªæä½ã«åæãããã¨ãã§ããããã®å½¹ã«ç«ã¤èãã¯ããã¯ãã¼ã¹ããã°ã©ãã³ã°ã§ã¯ä¸å¯è½ã§ããã以ä¸å¦æ³ï¼RDBçã®æèã§ã®æ¥½è¦³æä»ã ã¨ã2ã¤ã®txéã§ç«¶åæ¤åºããããªãã©ã¤ãããããªããã©ãä¸è¨ã®ããã«ä¸¡è ãåæã§ããã¨ããã°æ°ãããããããªãâ¦ãã©ããã仿ãã ããï¼ãéã«ãããRDBã¨ããã¼ã¿ã¹ãã¢ä¸è¬ã«é©ç¨ããã°ãããã¯ããªã¼ãªããã¤ãªãã©ã¤ä¸è¦ãªtxæä»ææ³ãªãã¦ã®ãå®ç¾ã§ããããï¼ãããããã¨ãå¯ä½ç¨ã®ãª
æãã¾ãã¦ããã§ã¨ããããã¾ãã ãã¦ãç§ã®å¨è¾ºã§ã¯ãå æ¥ã«æ¸ãã"Gotoã¯æç¨ã§ãã"ã«ã¤ãã¦ãæè§ã®Matt S. Troutæ°ã®æ¬æãããã使 ãä¸å¹¸ã«ãç§ã®æ¸ããè¨³æ³¨ã®æ¹ã話é¡ã«ãªã£ã¦ãã¾ãã Linusæ°ã¯gotoæç¨è«ã®ä»ã«ããC++ãããã¯ã½ã«è²¶ããããæ¬å½ã«æå¿«ãªäººã ã¨ç§ã¯æãã¾ãããã ãC++ãè²¶ãããæã®åå¿ã¨ãã¦ãæµ·å¤ã¯ç½®ãã¨ãã¨ãã¦ãæ¥æ¬ã®ä¸é¨ã®äººãä½ãã«ãäºã®ä¸ã®èçãªåå¿ãããããã«è¨æ¶ãã¦ãã¾ãã代表çãªä¾ã¯ãLinusã¯ãªãã¸ã§ã¯ãæåãåãããªãããã ãã¨ããã®ãããã¾ããç§ã¯æããç¬ãã¾ãããLinusæ°ã»ã©ã®é è³ã§åãããªããã¨ããæ¥µæ±ã®æ¥æ¬ã®è²´æ¹ããã¯åãã£ã¦ããã¨è¨ããã°ãããããªãã§ãããä¸é¨ã«ãããã ããæ¥æ¬ã¯é§ç®ã ã¨æãã¾ãããã¤ã¾ããèªå·±ã客観è¦ãããå®è³ªçå®åã¯ç¡ãã®ã«ä¸æµå®¶æ°åããªãã§ããããã£ã¨ã¯ã£ããè¨ãã°ä½æ§ã®ã¤ãããªãã ã¨ãã©
21:23 09/11/29 ãã©ã¯ã¨ï¼ ãã©ã´ã³ã¯ã¨ã¹ã III ã¢ãã¤ã«ç ãé ä¿¡éå§ãããã¨èãã¦ã¯ãã¬ã¤ããã«ã¯ããããªããã¨ãããã¨ã§ããã£ãã¯ãªã¢ã å 容㯠ãSFCçã®ãã¿ç§»æ¤ - ããããå ´ + AIæ¦éã ã§ããã ããããå ´ãæ¸ã£ãåãéå®ã¢ã¤ãã ãä»ã®å ´æã«ç§»å ï¼ãã¯ã¼ãã«ãã»ãã©ã´ã³ãã¤ã«ã»ãã©ã´ã³ãã¼ãã»ã°ãªã³ã¬ã ã®ã ããå°ããªã¡ãã«è³åã«ã å ã®ãã¬ã¹ãã¾ã¼ãåã®å®ç®±ã«ãé·ç¥ã®å£ãå®ç®±ã ã£ãæ°ãããããã¨ãå°ããªã¡ãã«ã®ç·æ°ã110æã§å¤åç¡ããããã®ã§ã ããããå ´ã«ãã£ãåãé常ãããã«æ¼ãåºããã¦ãã¨ããã¦ãå¼ã«æ¼ãããçã®ãã¼ã¡ã©ã³ãã¡ãã«è³ååï¼ã 䏿è°ãªãã¬ãã¨å¥³ç¥ã®æè¼ªã¯è¦ã¦ãªãããªããªã£ãï¼ AIã¯ãããã¼ãµ/ã©ãªãã¼/ãããã¼ã³è¾ºããå¹ãç¸æã«ã ãç©æ¥µçã«ä½¿ã£ã¦ãããã®ã§åèã«ãªãï¼ä¾¿å©ã åè ãAIé§åã«ã§ããã¢ã¼ããæ¬²ããã£ã ç´°ããã¨
 ããã§ã¯ãããã°ã©ã ãªã©ã§ãã使ç¨ãããã¢ã«ã´ãªãºã ã«ã¤ãã¦ç´¹ä»ãããã¨æãã¾ãã å ã ã¯ãèªåã®é ã®ä¸ãæ´çãããã¨ãç®çã«ãã®ã³ã¼ãã¼ãéè¨ãã¦ã¿ãã®ã§ãããæè¿ã¯ç¶ç¶ããããã¨ãç®çã«æ°ãããã¿ãæ¢ãããã«ãªã£ã¦ãã¾ãããã¾ã ã¾ã é¢ç½ããã¼ããããããã¨æ®ã£ã¦ããã®ã§ãæ°åã®ç¶ãéãã¯æ´æ°ãã¦ããããã¨æãã¾ãã ä»ã¾ã§ã«ç´¹ä»ãããã¼ãã«é¢ãã¦ããæ°ããå 容ã夿´ãããç®æãªã©ããããããããããæ°è¦ãã¼ãã¨åæé²è¡ã§ä¿®æ£ä½æ¥ãè¡ãªã£ã¦ãã¾ãã ã¢ã«ã´ãªãºã ã®ã³ã¼ãã¼ã§ç´¹ä»ãã¦ãããµã³ãã«ã»ããã°ã©ã ãããã¤ãå ¬éãã¦ãã¾ãããã©ã¤ã³ã»ã«ã¼ãã³ããåå¼§æç»ãããã¤ã³ãã»ã«ã¼ãã³ããã°ã©ãã£ãã¯ã»ãã¿ã¼ã³ã®å¦çããå¤è§å½¢ã®å¡ãã¤ã¶ãããä¸ã¤ã«ã¾ã¨ãã GraphicLibrary ã¨ãã確çã»çµ±è¨ããããä¸è¬åç·å½¢ã¢ãã«ãã¾ã§ãä¸ã¤ã«ã¾ã¨ãã Statistics ãç¾å¨ã¯ç¨æãã¦
Fri, 31 Jul 2009 Dijkstra was not insane Recently, a reader on the Higher-Order Perl discussion mailing list made a remark about Edsger Dijkstra and his well-known opposition to the break construction (in Perl, last) that escapes prematurely from a loop. People often use this as an example to show that Dijkstra was excessively doctrinaire, and out of touch with the reality of programming[1], but u
I decided to write an article about a thing that is second nature to embedded systems programmers â low level bit hacks. Bit hacks are ingenious little programming tricks that manipulate integers in a smart and efficient manner. Instead of performing operations (such as counting the number of 1 bits in an integer) by looping over individual bits, these programming tricks do the same with one or tw
ã¾ã 3 ã¤ã¨ã stack overflow ãã¦ãããã§ãããé¡åã®éãèªå·±åç §ã«æããã¯ãã¦ããã®ã§ãããã²ã¼ãã«ã¨ãã·ã£ã¼ããããããããèªãã§ããã¨ãé¢ä¿ãã¦ããã¨æããããæ¬å½ã¯ç¡éã«ã¼ãã«ãªãã¨æã£ã¦æ¸ãå§ããã®ã ãã©ãæ£è¦è¡¨ç¾ãå®è¡ããé¨åãã©ããã¦ãå帰ã«ãªã£ã¦ãã¾ã£ã¦ãstack 使ãåã£ã¦ãã¾ãã®ã ã£ãã ä¸åç®ã¯ãã³ã¼ãããã¨åã« do$0 ãèªåèªãä¸çªããµãæ¹æ³ã ã¨æãã äºåç®ã¯ http://d.hatena.ne.jp/shinichiro_h/20070119#1169154728 ã§æãã¦ããã£ãååãããããæ£è¦è¡¨ç¾ãä½¿ãæ©è½ã§ãæ£è¦è¡¨ç¾å ã«åããããå®è¡ã³ã¼ããå帰çã«å®è¡ãã¦ã¾ãããªãã¨ãããå®è¡ãã¦ã段éã§ã¯ããããã¦ãªãæ°ããããã ãã©ããªãã§ãã¾ããããããªãã¨ããçåãã ä¸åç®ã¯ããã³ã¼ãããã¨ã eval $;^XXXã¿ãããªæååã
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ã¡ã³ããã³ã¹
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}