IBM DeveloperIBM Developer is your one-stop location for getting hands-on training and learning in-demand skills on relevant technologies such as generative AI, data science, AI, and open source.
List Out of Lambda / Steve Losh
Posted on March 30th, 2013. If you ignore the practical issues of computers like size, weight, cost, heat, and so on, what do you really need in a programming language? Let's play around with this question. To understand this post you'll need a basic understanding of how functions in Javascript work. If you can look at this code and understand what it prints, you're good to go: var x = 10; var f =
Rubyã«ã‚ˆã‚‹é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
å¤ã良ãå°å¦æ ¡ã®æ™‚代ã€ã“ã®è¡Œã«ã¯å›°æƒ‘ã•ã›ã‚‰ã‚ŒãŸã‚‚ã®ã ã£ãŸã€‚ é”術的㪠x ãŒã€åŠ ç®—ã•ã‚ŒãŸã®ã«ç‰ã—ã„ã¾ã¾ã§ã„る事ã«ã€‚ ã©ã†ã„ã†ã‚ã‘ã‹ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’始ã‚ã‚‹ã¨ã€ãã‚Œã«æ§‹ã‚ãªããªã‚‹ã€‚ 「やれやれã€ãã‚Œã¯é‡å¤§ãªäº‹æŸ„ã˜ã‚ƒãªã„ã—ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ç¾å®Ÿã®ãƒ“ジãƒã‚¹è¡Œç‚ºãªã‚“ã ã‹ã‚‰ã€ æ•°å¦çš„ãªç´”粋ã•ã«ã¤ã„ã¦ã‚ら探ã—ãªã‚“ã¦å¿…è¦ç„¡ã„ (ãã®è°è«–ãªã‚‰ã€å¤§å¦ã«ã„ã‚‹ç‹‚ã£ãŸé«é¢é‡ŽéƒŽã©ã‚‚ã«ã•ã›ã¦ãŠã‘ã°ã„ã„)ã€ã¨æ€ã£ã¦ã„ãŸã€‚ ã‘ã‚Œã©ã‚‚ã€ãŸã 知らãªã‹ã£ãŸã ã‘ã§ã€æˆ‘々ãŒé–“é•ã£ã¦ã„ã¦é«˜ã„代償を支払ã£ã¦ã„ãŸã®ã¯ 明らã‹ã§ã‚る。 Wikipedia ã«ã‚ˆã‚Œã°ã€ã€Œé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°(functional programming, FP)ã¨ã¯ã€ 計算を数å¦çš„ãªé–¢æ•°ã®è©•ä¾¡ã¨ã¿ãªã—〠状態やå¯å¤‰ãƒ‡ãƒ¼ã‚¿ã‚’é¿ã‘るプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ‘ラダイムã€ã§ã‚る。 言ã„æ›ãˆã‚‹ã¨ã€é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯ã€ 副作用ãŒç„¡ã変数ã®å€¤ã‚’変化ã•ã›ãªã„コードを推奨ã™ã‚‹ã€‚
Things that amuse me
Quicksort in Haskell Quicksort is a commonly used example of how succinct Haskell programming can be. It usually looks something likes this: qsort :: (Ord a Bool) => [a] -> [a] qsort [] = [] qsort (x:xs) = qsort (filter (<= x) xs) ++ [x] ++ qsort (filter (> x) xs) The problem with this function is that it's not really Quicksort. Viewed through sufficently blurry glasses (or high abstraction altitu
Shibu's Diary: 関数型言語を広ã‚ã‚‹ãŸã‚ã«ã¯ä½•ãŒå¿…è¦ãªã®ã‹ï¼Ÿ
By plushoff under CC BY-NC å±±å£ã•ã‚“ã‹ã‚‰ã€ã€ŒJava開発者ã®ãŸã‚ã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€ã®é›»å献本をã„ãŸã ãã¾ã—ãŸã€‚ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚é›»å書ç±ä¾¿åˆ©ã§ã™ã。アメリカã«ã„ã¦ã‚‚日本語ã®æœ¬ãŒæ‰‹ã«å…¥ã‚‹ï¼ã—ã‹ã‚‚ã€ã™ã”ã„ã“ãªã‚ŒãŸæ—¥æœ¬èªžã«ãªã£ã¦ã„ã‚‹ã—ã€æ³¨é‡ˆã‚‚ã°ã£ã¡ã‚Šã¤ã„ã¦èªã¿ã‚„ã™ã„ã§ã™ã€‚仕事ã®ã§ãã‚‹ç”·ã®é¢¨æ ¼ã‚’æ„Ÿã˜ã¾ã™ã€‚ 本人ã®ãƒ–ãƒã‚°: http://ymotongpoo.hatenablog.com/entry/20120621/1340233739 オライリーã®æ›¸ç±ãƒšãƒ¼ã‚¸: http://www.oreilly.co.jp/books/9784873115405/ ã“ã®æœ¬ã‚’楽ã—ãèªã‚“ã§ã„ãŸã¨ã“ã‚ã€å±±å£ã•ã‚“ã‹ã‚‰åˆ¥ã®é¢ç™½ã„リンクを教ãˆã¦ã‚‚らã„ã¾ã—ãŸã€‚ Why OO Sucks (ãªãœã‚ªãƒ–ジェクト指å‘ã¯ã‚¯ã‚½ãªã®ã‹) Erlangã®é–‹ç™ºè€…ã®Joe Armstrongã®è¨˜äº‹ã§ã™ã€‚本当ã¯
The Functor Pattern in C++ - FP Complete
The Gang of Four book introduced many a C++ programmer to the world of patterns. Those patterns are mostly based on everyday examples, although there are a few more abstract ones like Strategy. In Haskell (and other functional languages) most patterns are very abstract. They are often based on mathematical constructs; category theory being a major source of ideas. Arguably it’s easier to grok term
#AltDevBlogADay » Functional Programming in C++
Probably everyone reading this has heard “functional programming†put forth as something that is supposed to bring benefits to software development, or even heard it touted as a silver bullet. However, a trip to Wikipedia for some more information can be initially off-putting, with early references to lambda calculus and formal systems. It isn’t immediately clear what that has to do with writing
プãƒã‚°ãƒ©ãƒ ã®æ•°ç†
プãƒã‚°ãƒ©ãƒ ã®æ•°ç† 時間： 2008 年度冬å¦æœŸ 月曜日åˆå‰ 8:30 -- 10:00 å ´æ‰€ï¼š å·¥å¦éƒ¨ 6 å·é¤¨ 2 階 63 講義室 講義内容 計算機プãƒã‚°ãƒ©ãƒ ã«å†…在ã™ã‚‹æ•°ç†çš„æ§‹é€ ã‚’æ‰ãˆã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è¨è¨ˆã«ãŠã‘る構 æˆçš„手法ã®ä½“系化ã¨ãã‚Œã«åŸºã¥ãプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æ–¹æ³•è«–を扱ã†ã€‚ 算法言語ã®åŸºæœ¬æ¦‚念（文法・æ„味・型・計算モデル）をå¦ç¿’ã™ã‚‹ã“ã¨ã«ã‚ˆã£ ã¦ã€åŽ³å¯†ãªç§‘å¦ãƒ»å·¥å¦ã¨ã—ã¦ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ã‚り方をå¦ã¶ã€‚ 算法è¨è¨ˆãƒ»ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’æ•°å¦çš„ãªæ´»å‹•ã¨ã—ã¦ã¨ã‚‰ãˆã‚‹è€ƒãˆæ–¹ã‚’ç†è§£ã™ る。計算機プãƒã‚°ãƒ©ãƒ ã®æ•°ç†çš„æ§‹é€ ã‚’æ‰ãˆï¼Žãã‚Œã«åŸºã¥ã„ã¦æ§‹æˆçš„ã«ã‚¢ãƒ«ã‚´ãƒª ズムを記述ã™ã‚‹æ§‹æˆçš„アルゴリズム論(constructive algorithmics)ã®åŸºç¤Žã‚’扱 ã†ã€‚ 教科書・å‚考書 æ¦å¸‚æ£äººè¨³ã€ 「関数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€, 近代科å¦ç¤¾, 1994å¹´. ISBN4-7649-0181-1ã€å®šä¾¡ 4,500円．(R.
ãªãœæ¬¡ã«å¦ã¶è¨€èªžã¯é–¢æ•°åž‹ã§ã‚ã‚‹ã¹ãã‹ - YAMAGUCHI::weblog
ã¯ã˜ã‚ã« ã“ã‚“ã«ã¡ã¯ã€Pythonç•Œã®æƒ…å¼±ã§ã™ã€‚ã¡ã‚‡ã£ã¨å‰ã«OCamlç³»ã®ã‚¨ãƒ³ãƒˆãƒªã‚’色々ã¨çœºã‚ã¦ã„ãŸã‚‰Yaron Minskyæ°ã®ã‚¨ãƒ³ãƒˆãƒªã‚’見ã¤ã‘ãŸã®ã§ç¿»è¨³ã—ã¦ã¿ã¾ã—ãŸã€‚ OCaml for the Masses - ACM Queue Yaron Minskyæ°ã¯Jane Streetã§ç¬¬ä¸€ç·šã§æ´»èºã•ã‚Œã‚‹ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã§ã€Jane Streetã®æŠ€è¡“ページをã¯ã˜ã‚多ãã®å ´æ‰€ã§OCamlã«é–¢ã—ã¦ã®çŸ¥è¦‹ã‚’語ã£ã¦ãã ã•ã£ã¦ã„ã¾ã™ã€‚ Jane Street Tech Blogs 本エントリã¯John Hughesã®åエントリ「ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹ã€ã‚’å—ã‘ã¦ACM Queueã«å¯„稿ã•ã‚ŒãŸã‚‚ã®ã®æ—¥æœ¬èªžè¨³ã§ã™ã€‚ ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹ Why the next language you learn should be functional YARON MINSKY, JANE STREE
foldrãŒåŠ¹çŽ‡çš„ã«å‹•ä½œã™ã‚‹æ¡ä»¶ - www.kotha.netã®è£
eagerãªè¨€èªžã§ã¯foldrã¯ãƒªã‚¹ãƒˆã®é•·ã•ã«æ¯”例ã™ã‚‹ã‚¹ã‚¿ãƒƒã‚¯ã‚’消費ã™ã‚‹ã€‚GHCã§ã‚‚(+)ã®ã‚ˆã†ãªæ£æ ¼ãªé–¢æ•°ã§ç•³ã¿è¾¼ã‚‚ã†ã¨ã™ã‚Œã°åŒæ§˜ã«O(n)ã®æŒ¯ã‚‹èˆžã„ã«ãªã‚‹ã€‚ {-# OPTIONS_GHC -O0 #-} import Data.List(foldl') main = do n <- readLn print $ foldr (+) 0 [1..n] -- O(n)スタックã€O(1)ヒープ print $ foldl (+) 0 [1..n] -- O(n)スタックã€O(n)ヒープ print $ foldl' (+) 0 [1..n] -- O(1)スタックã€O(1)ヒープ 一方ã€foldrを使ã£ã¦åŠ¹çŽ‡çš„ã«å®Ÿè£…ã§ãる関数もHaskellã«ã¯å˜åœ¨ã™ã‚‹ã€‚例ãˆã°ä»¥ä¸‹ã¯concatã®ç«‹æ´¾ãªå®šç¾©ã§ã‚ã‚Šã€O(1)空間ã§å‹•ä½œã™ã‚‹*1。 concat :: [[a]] -> [a] concat =
モナドã¯ãƒ¡ã‚¿ãƒ•ã‚¡ãƒ¼ã§ã¯ãªã„ · eed3si9n
2011-05-28 Scalaç•Œã®é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ä¸€æ´¾ã‚’代表ã™ã‚‹è«–客ã®ä¸€äººã€@djspiewak ㌠2010å¹´ã«æ›¸ã„㟠“Monads Are Not Metaphors†を翻訳ã—ã¾ã—ãŸã€‚翻訳ã®å…¬é–‹ã¯æœ¬äººã‚ˆã‚Šè¨±è«¾æ¸ˆã¿ã§ã™ã€‚翻訳ã®é–“é•ã„ç‰ãŒã‚ã‚Œã°é æ…®ãªãã”指摘ãã ã•ã„。 2010å¹´12月27æ—¥ Daniel Spiewak è‘— 2011å¹´5月29æ—¥ e.e d3si9n 訳 僕ã¯ä»Šã€ç´„æŸã‚’ç ´ã‚‹ã¨ã“ã‚ã 。ãŠã‚ˆã三年å‰ã€åƒ•ã¯çµ¶å¯¾ã«ãƒ¢ãƒŠãƒ‰ã®è¨˜äº‹ã ã‘ã¯æ›¸ã‹ãªã„ã¨è‡ªåˆ†ã«ç´„æŸã—ãŸã€‚æ—¢ã«ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹è¨˜äº‹ã¯æœ‰ã‚Šä½™ã£ã¦ã„る。記事ã®æ•°ãŒå¤šã™ãŽã¦ãã®å¤šã•ã ã‘ã§å¤šãã®äººã¯æ··ä¹±ã—ã¦ã„る。ã—ã‹ã‚‚全員ãŒãƒ¢ãƒŠãƒ‰ã«å¯¾ã—ã¦ç•°ãªã‚‹æ‰±ã„方をã—ã¦ã„ã‚‹ãŸã‚ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚念をåˆã‚ã¦å¦ã¼ã†ã¨ã™ã‚‹è€…ã¯ã€ãƒ–リトーã€å®‡å®™æœã€è±¡ã€ç ‚æ¼ ã®ãƒ™ãƒ‰ã‚¦ã‚£ãƒ³ (訳注: アラブ系éŠç‰§æ°‘) ã®å…±é€šé …を探ã™åŠªåŠ›ã‚’ã™ã‚‹ãƒãƒ¡ã«ãªã£ã¦ã„る。 僕ã¯ã€ã“ã®æ··ä¹±ã—ãŸ
本をèªã‚€ 関数型言語shã®åŸºç¤Žæ–‡æ³•æœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼
関数型言語shã®æ–‡æ³•ä¸€è¦§ã§ã™ã€‚ä»–ã®é–¢æ•°åž‹è¨€èªžã‚’ã‚る程度知ã£ã¦ã„る人ãŒã“れをèªã‚ã°ã€shã®åŸºç¤Žã‚’マスターã—ã¦shを書ã‘るよã†ã«ãªã£ã¦ã„ã¾ã™ã€‚以下ã€Clojureã‚ãŸã‚Šã‚’想定ã—ã¦èª¬æ˜Žã—ã¾ã™ã€‚ 注æ„：ã“ã‚Œã¯åŸºç¤Žæ–‡æ³•æœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼ããŸã®ãƒ‘ãƒãƒ‡ã‚£ã§ã™ã€‚動作ã¯æœ¬ç‰©ã§ã™ãŒã€æ„味ã¯ã‚³ã‚¸ãƒ„ケã§ã™ã€‚ REPL shã®å‡¦ç†ç³»ã¯ã€POSIXæº–æ‹ ã®Unix系環境ã§ã‚ã‚Œã°æ¨™æº–ã§ç”¨æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚REPLã‚’èµ·å‹•ã™ã‚‹ã«ã¯ã€shを実行ã—ã¾ã™ã€‚ sh ã™ã‚‹ã¨ã€ãƒ—ãƒãƒ³ãƒ—トãŒè¡¨ç¤ºã•ã‚Œã¾ã™ã€‚ $ shã®ã»ã‹ã«ã€REPLã«è¡Œç·¨é›†æ©Ÿèƒ½ã‚’付ã‘ãŸbash・zsh・tcshãªã©ã‚‚ã‚ã‚Šã¾ã™ãŒã€ã“ã“ã§ã¯å‰²æ„›ã—ã¾ã™ã€‚ ãªãŠã€REPLã¨ã—ã¦ä½¿ã†ã»ã‹ã«ã€ã‚らã‹ã˜ã‚用æ„ã—ãŸã‚¹ã‚¯ãƒªãƒ—トをshã§å®Ÿè¡Œã™ã‚‹ã“ã¨ã‚‚ã§ãã¾ã™ã€‚ sh hoge シーケンス shã®æ‰±ã†ãƒ‡ãƒ¼ã‚¿ã¯ã€ã™ã¹ã¦ã€ã‚ã‚‹å˜ä½ï¼ˆãƒ©ã‚¤ãƒ³ã¨å‘¼ã³ã¾ã™ï¼‰ã®ãƒ‡ãƒ¼ã‚¿ãŒä¸¦ã‚“ã シーケンスã§ã™ã€‚ãŸã¨ãˆã°ã€seq関数（L
(How to Write a (Lisp) Interpreter (in Python))
This page has two purposes: to describe how to implement computer language interpreters in general, and in particular to build an interpreter for most of the Scheme dialect of Lisp using Python 3 as the implementation language. I call my language and interpreter Lispy (lis.py). Years ago, I showed how to write a semi-practical Scheme interpreter Java and in in Common Lisp). This time around the go
Monads in Perl
Monads in Perl Monads in Perl (in the spirit of TMTOWTDI) Haskell is the language that popularized (?!) monads, but my understanding was impeded because of the myriad of new things that I needed to learn about Haskell before I could even get to monads (different syntax, purity/laziness, typing system, significant white-space, etc.) All that added up to something as clear as mud. I needed a Rosetta
Monads in Ruby, Part 1: Introduction - Moonbase
This article owes a great debt to Monads as Containers and A Schemer’s Introduction to Monads, each of which greatly advanced my understanding of the topic. Introduction Monads have been getting a lot of press lately in connection with the Haskell programming language. They’re a very powerful programming tool in functional languages, but all too often they’re described as some sort of black magic
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Google Code Archive - Long-term storage for Google Code Project Hosting.
コードウォッãƒï¼šé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®è‡ªæƒšã‚Œå•é¡Œ
GitHub - IBM/japan-technology: IBM Related Japanese technical documents - Code Patterns, Learning Path, Tutorials, etc.
edw: Nanoeval, a 1KB tail-recursive LISP interpreter
https://www.ccs.neu.edu/home/dherman/research/tutorials/monads-for-schemers.txt
{{#tags}}- {{label}}
{{/tags}}