Simon Gay's Bibliography on Quantum Programming Languages
This bibliography was originally compiled in association with my article Quantum Programming Languages: Survey and Bibliography (Mathematical Structures in Computer Science 16(4), 2006). Its original topic was quantum programming languages, but this has widened to include semantics of quantum computation and structural approaches to quantum computing. The complete bibliography as a BibTeX file is
Writing Parsers Like it is 2017
Writing parsers like it is 2017 Pierre Chifflier Agence Nationale de la SeÌcuriteÌ des SysteÌ€mes d’Information Geoffroy Couprie Clever Cloud Abstract—Despite being known since a long time, memory violations are still a very important cause of security problems in low-level programming languages containing data parsers. We address this problem by proposing a pragmatic solution to ï¬x not only bugs, b
Write You a Haskell ( Stephen Diehl )
Building a modern functional compiler from first principles. Stephen Diehl In 2014 I wrote a short tutorial about building a small imperative language in Haskell that compiled into LLVM. I was extremely happy with the effect the tutorial seemed to have, and the warm response I got from so many people was very encouraging. I've done a great bit of thinking about what the most impactful topic I coul
æ–‡å—列アルゴリズムã®å¦ã³ã‹ãŸ - Hatena Developer Blog
ã“ã‚“ã«ã¡ã¯ï¼ã¯ã¦ãªã‚¢ãƒ—リケーションエンジニア㮠id:takuya-a ã§ã™ã€‚ ã¿ãªã•ã‚“ã¯ã€ã“ã®ã‚ˆã†ãªç–‘å•ã‚’ã‚‚ã£ãŸã“ã¨ã¯ã‚ã‚Šã¾ã›ã‚“ã‹ï¼Ÿ grep ã¯ã©ã®ã‚ˆã†ã«æ–‡å—列を検索ã—ã¦ã„ã‚‹ã®ã‹ï¼Ÿ MeCab ã¯ã©ã†ã‚„ã£ã¦è¾žæ›¸ã‚’高速ã«ãƒ«ãƒƒã‚¯ã‚¢ãƒƒãƒ—ã—ã¦ã„ã‚‹ã®ã‹ï¼Ÿ パーサやコンパイラを作りãŸã„ã‘ã©ã€ä½•ã‹ã‚‰å§‹ã‚ã‚Œã°ã„ã„ã®ã‹ï¼Ÿ 本稿ã§ã¯ã€ã€Œæ–‡å—列アルゴリズムã¨ã¯ã©ã‚“ãªã‚‚ã®ãªã®ã‹ï¼Ÿã€ã€Œãªãœé‡è¦ãªã®ã‹ï¼Ÿã€ã€Œä½•ã‚’知ã£ã¦ãŠãã¹ãã‹ï¼Ÿã€ã€Œã©ã†ã‚„ã£ã¦å‹‰å¼·ã™ã‚Œã°ã„ã„ã®ã‹ï¼Ÿã€ã¨ã„ã£ãŸç–‘å•ã«ãŠç”ãˆã—ã¦ã„ã“ã†ã¨æ€ã„ã¾ã™ã€‚ æ–‡å—列アルゴリズムã®æ„外ãªå¿œç”¨ã‚„ã€ãƒ¢ãƒãƒ™ãƒ¼ã‚·ãƒ§ãƒ³ã‚’ä¿ã¡ã‚„ã™ã„勉強ã®ã—ã‹ãŸã€æ–‡å—列アルゴリズムを勉強ã™ã‚‹ãŸã‚ã«è¡Œã£ãŸç¤¾å†…ã§ã®å–り組ã¿ã€å®Ÿè£…ã™ã‚‹ã¨ãã®ã‚³ãƒ„ã¨ã„ã£ãŸãƒˆãƒ”ックã«ã¤ã„ã¦ã‚‚触れã¦ã„ã¾ã™ã€‚ ã“ã®ã‚¨ãƒ³ãƒˆãƒªã¯ã€ã¯ã¦ãªã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã‚¢ãƒ‰ãƒ™ãƒ³ãƒˆã‚«ãƒ¬ãƒ³ãƒ€ãƒ¼2016ã®22日目ã®è¨˜äº‹ã§ã™ã€‚昨日㯠id:syou6162 ã•ã‚“ã«
Ladder of Functional Programming 〜関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ãƒ¬ãƒ™ãƒ«åˆ†ã‘〜 - Qiita
LambdaConfãŒãƒ„イートã«ã¦é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ãƒ¬ãƒ™ãƒ«åˆ†ã‘を発表ã—ã¦ã„ã¾ã—ãŸã€‚今後LambdaConfã‹ã‚‰ç™ºä¿¡ã•ã‚Œã‚‹ç™ºè¡¨ã«ã¯ã“ã®ãƒ¬ãƒ™ãƒ«ãŒè¡¨è¨˜ã•ã‚Œ, 自分ã®ãƒ¬ãƒ™ãƒ«ã«ã‚ã£ãŸã‚³ãƒ³ãƒ†ãƒ³ãƒ„ãŒæŽ¢ã—ã‚„ã™ããªã‚‹ã‚ˆã†ã§ã™ã€‚ã“ã®ãƒ¬ãƒ™ãƒ«åˆ†ã‘ã¯ãƒ—ãƒã‚°ãƒ©ãƒžã®å„ªåŠ£ã‚’付ã‘るよã†ãªã‚‚ã®ã§ã¯ãªã, 広ãæ·±ã„関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ä¸–ç•Œã§è‡ªåˆ†ãŒä»Šã©ã®ãƒ¬ãƒ™ãƒ«ã«ã„ã‚‹ã®ã‹ã‚’é©åˆ‡ã«ç†è§£ã—次ã«ã©ã“ã«å‘ã‹ã†ã¹ããªã®ã‹ã‚’知るã®ã«ãŸã„ã¸ã‚“å½¹ã«ç«‹ã¤ã‚‚ã®ã ã¨æ€ã„ã¾ã™ã€‚ 表を眺ã‚ã¦ã¿ã‚‹ã¨é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã„ã†ã‚ˆã‚Šã‹ã¯Haskellã®ãƒ¬ãƒ™ãƒ«åˆ†ã‘ã®ã‚ˆã†ãªå°è±¡ã‚‚å—ã‘ã¾ã™ãŒã€åºƒã知られるã¹ãã ã¨æ€ã£ãŸã®ã§ç¿»è¨³ã—ã¦ã¿ã¾ã—ãŸã€‚僕ãŒæœªç†Ÿã§ãƒˆãƒ³ãƒãƒ³ã‚«ãƒ³ãªè¨³ã‚’ã—ã¦ã„る箇所もã‚ã‚‹ã¨æ€ã†ã®ã§ã€ä½•ã‹è¦‹ã¤ã‘ãŸå ´åˆã¯é æ…®ãªãコメントや編集リクエストをãŠé¡˜ã„ã—ã¾ã™ LambdaConf Ladder of Functional Programming (LOFP)
O'Reilly Media - Technology and Business Training
New! O’Reilly announces launch of the AI Academy. Read now Introducing the AI Academy Help your entire org put GenAI to work Every employee today needs to know how to prompt GenAI, use it to enhance critical thinking and productivity, and more. With the AI Academy they can. For less. O’Reilly AI-powered Answers just got even smarter O’Reilly Answers instantly generates information teams can trust,
Convenient and idiomatic conversions in Rust
Key takeaways The traits in std::convert provide a uniform API for converting values to other types From<T> and Into<U> are for conversions that cannot fail and consume the original value From<T> for U converts a value of type T into one of type U Into<U> for T inverts From<T>’s subject-object relationship Implementing From<T> for U gives us an automatically derived Into<U> for T implementation Tr
1
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}