関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨åž‹ã‚·ã‚¹ãƒ†ãƒ ã®ãƒ¡ãƒ³ã‚¿ãƒ«ãƒ¢ãƒ‡ãƒ«
Qiita Conference 2023 Autumun ã§ã®ç™ºè¡¨è³‡æ–™ã§ã™ 発表時間ã®è¦‹ç©ã‚‚ã‚ŠãŒä¸‹æ‰‹ã§å¾ŒåŠå…¨ç„¶èª¬æ˜Žã§ãã¾ã›ã‚“ã§ã—ãŸã€ã™ã¿ã¾ã›ã‚“ï¼ å®Ÿéš›ã®ãƒ—ãƒãƒ€ã‚¯ãƒˆé–‹ç™ºã§ã¯ã©ã†ã™ã‚Œã°ã„ã„ã®ã‹? ã¨ã„ã†ã‚±ãƒ¼ã‚¹ã¯ä»¥ä¸‹ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã‚’å‚ç…§ã—ã¦ãã ã•ã„。 (本スライドã¯ã€ã“ã¡ã‚‰ã®ãƒ—ãƒãƒ€ã‚¯ãƒˆé–‹ç™ºã®çµŒé¨“を…
F# ã§ã¯ã˜ã‚る関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€ (上巻)
.NET ファミリーã®é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã‚ã‚‹ F# を利用ã—ãŸã€å…¨ 3 巻構æˆã®é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€æ›¸ç±ã¨ãªã‚Šã¾ã™ã€‚ 上巻ã§ã¯ F# ã®åŸºæœ¬çš„ãªæ–‡æ³•ãªã©ã®å¦ç¿’ãŒã§ãã¾ã™ã€‚ ãªãŠã€ã“ã®æ›¸ç±ã¯æœ¬ç·¨ã‚’ã™ã¹ã¦ç„¡æ–™ã§åˆ©ç”¨ã„ãŸã ã‘ã¾ã™ãŒã€æ´»å‹•ã‚’å¿œæ´ã„ãŸã ã‘ã‚‹å ´åˆã«ã¯æœ€çµ‚ãƒãƒ£ãƒ—ターをã”購入ã„ãŸã ã‘ã¾ã™ã¨å¬‰ã—ãæ€ã„ã¾ã™ã€‚
TypeScriptã§ã©ã“ã¾ã§ã€Œé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€ã™ã‚‹ã‹ ─ 「手続ã Haskellã€ã‹ã‚‰è€ƒå¯Ÿã™ã‚‹ - 一休.com Developers Blog
ã“ã®è¨˜äº‹ã¯ 一休.comã®ã‚«ãƒ¬ãƒ³ãƒ€ãƒ¼ | Advent Calendar 2023 - Qiita 10日目ã®è¨˜äº‹ã§ã™ã€‚ 昨今㯠Web アプリケーション開発ã®ä¸–ç•Œã§ã‚‚ã€é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ã‚¨ãƒƒã‚»ãƒ³ã‚¹ã‚’å–り入れるよã†ãªæ©Ÿä¼šãŒå¢—ãˆã¦ãã¾ã—ãŸã€‚ ã¨ã¯ã„ãˆã€ä¸€ã¤ã®ã‚¢ãƒ—リケーションを 1 ã‹ã‚‰ 10 ã¾ã§ãŒã£ã¡ã‚Šé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§æ§‹æˆã™ã‚‹ã¨ã„ã†ã‚ã‘ã§ã¯ãªãã€ãã®ã‚ˆã†ã«æ›¸ãã“ã¨ã‚‚ã‚ã‚Œã°ãã†ã§ãªã„従æ¥ã‹ã‚‰ã®æ‰‹ç¶šã的スタイルã§æ›¸ãã¨ã“ã‚ã‚‚ã‚ã‚‹ã¨ã„ã†ã®ãŒç¾çŠ¶ã§ã€ã©ã“ã¾ã§é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°çš„ãªæ‰‹æ³•ã‚’å–り入れるã‹ãã®å¡©æ¢…ã‚‚ã¾ã¡ã¾ã¡ã ã¨æ€ã„ã¾ã™ã€‚ã¾ã 今ã¯ãã®éŽæ¸¡æœŸã¨ã„ã†å°è±¡ã‚‚å—ã‘ã¾ã™ã€‚ 本稿ã§ã¯ã“ã®è¾ºã‚Šã‚’少々考察ã—ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ 先日ã€Qiita Conference 2023 Autumn ã§ä»¥ä¸‹ã®ãƒ†ãƒ¼ãƒžã§ç™ºè¡¨ã‚’è¡Œã„ã¾ã—ãŸã€‚ ã“ã®ç™ºè¡¨ã§ã¯ã€Œé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æœ€å¼·!ã€ã¨ã„ã†è©±ã‚’ã—ãŸã‚ã‘ã§ã¯ãªãã€
anopara
終了ã®ãŠã—ら㛠ブãƒã‚° anopara 㯠2022å¹´12月29æ—¥ ã”ã‚ã«é–‰éŽ–ã—ã¾ã—ãŸã€‚ 先生ã®æ¬¡å›žä½œã«ã”期待ãã ã•ã„。 次ã®ãƒ–ãƒã‚°ã¯å¤šåˆ†åŒã˜URLã§å†é–‹ã—ã¾ã™ã€‚ 詳ã—ã„ã“ã¨ãŒæ±ºã¾ã£ãŸã‚‰ã“ã¡ã‚‰ã«æ›¸ãã¾ã™ → https://twitter.com/anoparanominal 創作関連ã®æ´»å‹•ã¯ã“ã¡ã‚‰ → https://y9ks.jp çµµã¨ã‹ → https://twitter.com/yuri9000series
Functional programming with Elixir
Target audienceProgramming experienceLittle or now experience with functional programmingUnderstanding of Elixir basics OutlineOverview of the functional paradigmElixir functional programming featuresState management in ElixirFunctional paradigmProgramming paradigmA "way of programming"Way of reasonningWay of structuring codeA few programming paradigmsImperative programming (C, Fortran, Basic)Func
Functional Programming in Ruby with Contracts | Viget
I read Thomas Reynolds’ My Weird Ruby a week or two ago, and I loved it. I’d never heard of the Contracts gem, but after reading the post and the well-written docs, I couldn’t wait to try it out. I’d been doing some functional programming as part of our ongoing programming challenge series, and saw an opportunity to use Contracts to rewrite my Ruby solution to the One-Time Pad problem. Check out m
カリー化ã€éƒ¨åˆ†é©ç”¨ã€ã‚¯ãƒãƒ¼ã‚¸ãƒ£ã¨ã„ã†é–“é•ã„ã‚„ã™ã„三種ã«ã¤ã„ã¦ã®ç°¡å˜ãªãƒ¡ãƒ¢æ›¸ã - Line 1: Error: Invalid Blog('by Esehara' )
追記 カリー化を間é•ãˆã¦ã‚«ãƒ¼ãƒªãƒ¼åŒ–ã¨ã„ã†è¡¨è¨˜ã‚’ã—ã¦ã„ãŸã®ã‚’ä¿®æ£ã—ã¾ã—ãŸã€‚ ãã‚‚ãもカリー化ã¨ã¯ä½•ã‹ 複数ã®å¼•æ•°ã‚’å–る関数ã¯ã€ä¸€ã¤ã®å¼•æ•°ã‚’å–ã‚‹ã€é–¢æ•°ã‚’è¿”ã™é–¢æ•°ã®é€£ç¶šã¨ã—ã¦è¡¨ç¾ã§ãã‚‹ã¨ã„ã†ã“ã¨ã€ã¨è¨€è‘‰ã§è¡¨ç¾ã—ã¦ã‚‚抽象的ã™ãŽã‚‹ã®ã§ã€ã¡ã‚‡ã£ã¨å¼ã§è¡¨ã—ã¦ã¿ã‚‹ã€‚ ã¾ãšåˆã‚ã«ãƒ©ãƒ ダã®å°Žå…¥ 例ã¨ã—ã¦ã€ã‚ã‚‹æ•´æ•°ã«å¯¾ã—ã¦ãƒ—ラス1ã™ã‚‹é–¢æ•°ã‚’定義ã™ã‚‹ã€‚ã“ã®ã‚ˆã†ãªé–¢æ•°ã¯ã€ã¨ã—ã¦è¡¨ç¾ã§ãる。 ã“ã“ã§ã“ã®é–¢æ•°ã¯plusoneã¨ã„ã†åå‰ã‚’与ãˆã‚‰ã‚Œã¦ã„ã‚‹ãŒã€ã“ã®x + 1ã¨ã„ã†é–¢æ•°ãã®ã‚‚ã®ã‚’表ç¾ã™ã‚‹ã‚ˆã†ãªè¨˜æ³•ãŒã‚ã‚‹ã¨ä¾¿åˆ©ã ã‚ã†ã€‚ãã“ã§ã€ã‚’ãã®ã‚ˆã†ãªè¨˜æ³•ã¨ã—ã¦å®šç¾©ã™ã‚‹ã€‚ ã“ã®è¨˜æ³•ã‚’用ã„ã‚‹ã“ã¨ã«ã‚ˆã‚Šã€ä¸Šè¨˜ã®ã¯ã¨ã—ã¦è¡¨ç¾ã§ãるよã†ã«ãªã‚‹ã€‚ã¤ã¾ã‚Šã€é–¢æ•°ãれ自体を表ã™è¨˜æ³•ã‚’å°Žå…¥ã™ã‚‹ã“ã¨ã«ã‚ˆã£ã¦ã€é–¢æ•°ã®åå‰ã¨ã€é–¢æ•°ãれ自体を区別ã™ã‚‹ã“ã¨ãŒã§ãるよã†ã«ãªã‚‹ã€‚ カリー化 ã“ã®ã‚ˆã†ãªè€ƒãˆæ–¹ãŒä¾¿åˆ©ãªã®ã¯ã€é–¢æ•°ã‚’è¿”ã™é–¢æ•°ã¨ã„ã†ã‚‚ã®ã‚’表ç¾ã§ãるよ
［入門］関数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°â€•è³ªã®é«˜ã„コードをã™ã°ã‚„ãç›´æ„Ÿçš„ã«æ›¸ã‘ã‚‹ï¼ è¨˜äº‹ä¸€è¦§ | gihyo.jp
第1ç« é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é›£ã—ããªã„ï¼ â€•åˆã‚ã¦å¦ã¶äººã«ã‚‚â â ã€æŒ«æŠ˜ã—ãŸäººã«ã‚‚ãã¡ã‚“ã¨ã‚ã‹ã‚‹ 山本和彦 2015-03-02
関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯çµå±€ä½•ãªã®ã‹ | 黒曜ã®å¹ã溜ã¾ã‚Š
ã“ã®è¨˜äº‹ã¯ãƒ‰ãƒ¯ãƒ³ã‚´ Advent Calendar 2014ã®14日目ã§ã™ã€‚ ã¡ãªã¿ã«å‰æ—¥ã¯@erukitiã•ã‚“ã§ã—ãŸã€‚ ä»–ã®æ–¹ã¯ã€Œã“ã‚“ãªã‚‚ã®ä½œã£ã¦ã¿ãŸï¼ã€ç³»ã®è¨˜äº‹ãŒå¤šã„ã®ã§ã™ãŒã€æŠ€è¡“ç³»ã®è©±é¡Œã§ã‚ã‚Œã°ç‰¹ã«ç¸›ã‚Šã¯ãªã„よã†ãªã®ã§ã€ä»Šå›žã¯ã²ãŸã™ã‚‰æ–‡ç« ã‚’ã¤ã‚‰ã¤ã‚‰ã¨ç¶´ã£ã¦ã„ããŸã„ã¨æ€ã„ã¾ã™ã€‚ ã“ã“æ•°å¹´ã€ã€Œãƒžãƒ«ãƒã‚³ã‚¢æ™‚代ã®ä¸»æµã¯é–¢æ•°åž‹ã ã€ã¨ã‹ã€ŒJavaã¯ã‚‚ã†å¤ã„ï¼ æ™‚ä»£ã¯é–¢æ•°åž‹ï¼ã€ã¨ã„ã£ãŸè¨˜äº‹ã‚’よã見ã‹ã‘るよã†ã«ãªã£ãŸæ°—ãŒã—ã¾ã™ã€‚ 大å¦ã§OCamlã‚’å¦ã‚“ã§ããŸè‡ªåˆ†ã¨ã—ã¦ã¯å¬‰ã—ã„é™ã‚Šãªã®ã§ã™ãŒã€ãªã‚“ã ã‹é–¢æ•°åž‹ã¨ã„ã†è¨€è‘‰ãŒãƒã‚ºãƒ¯ãƒ¼ãƒ‰çš„ãªä½¿ã‚れ方をã—ã¦ã„ã‚‹æ°—ãŒã—ã¦ã€ã¾ã‚‹ã§ã€Œç¾åœ¨èµ·ã“ã£ã¦ã„ã‚‹å…¨ã¦ã®å•é¡Œã‚’解決ã™ã‚‹éŠ€ã®çŸ¢ã ï¼ã€ã¨ã„ã‚ã‚“ã°ã‹ã‚Šã®é›°å›²æ°—ã‚’æ„Ÿã˜ã‚‹ã®ãŒæ°—ã«ãªã£ã¦ã„ã¾ã™ã€‚ 最近ã†ã¡ã®éƒ¨ç½²ã§ã‚‚ã«ã‚ã‹ã«ã€Œé–¢æ•°åž‹ã£ã½ã書ã“ã†ã€ã¿ãŸã„ãªæ©Ÿé‹ãŒé«˜ã¾ã£ã¦ã‚‹ã“ã¨ã‚‚ã‚ã‚‹ã®ã§ã€ã“ã®æ©Ÿã«é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ãªã«ã‹ã€ã©ã®ã‚ˆã†
Getting into functional programming with Swift
This article examines two implementations of a logic puzzle written in Swift. The first example uses an imperative programming style, which is the style familiar to most iOS developers. Then we see the same small program written in a functional style, which is facilitated by several Swift language features. Get the source code at https://github.com/ijoshsmith/break-a-dollar The logic puzzle A few
Functional Programming Patterns (BuildStuff '14)
Functional Programming Patterns (BuildStuff '14)AI-enhanced description The document discusses various functional programming design patterns, principles, and concepts, emphasizing the role of functions, types, and composition in programming. It contrasts functional programming with object-oriented programming, introduces key concepts, and outlines the practical benefits of pure functions. It also
Functional Programming with Ruby
This presentation shows how to apply functional programming principles to Ruby. It covers some theoretical principles but also code examples.
関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã‚ªãƒ–ジェクト指å‘ã®æŠœãå·®ã—å¯èƒ½ãªé–¢ä¿‚ã«ã¤ã„ã¦æ•´ç†ã—ã¦è€ƒãˆã‚‹ - モナドã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
Googleã§é©å½“ã«æ¤œç´¢ã™ã‚‹ã¨ ã¨ã‚ºãƒ©ãƒªã¨å‡ºã¦ãる。 ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘ v.s. 関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚° 関数型ã¨ã‚ªãƒ–ジェクト指å‘ã¨ã„ã†ä¸€è¦‹ç›¸åã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ‘ラダイムã®ä½µç”¨ã«ã¤ã„ã¦ç†è§£ã—㟠プãƒã‚°ãƒ©ãƒžãŒçŸ¥ã‚‹ã¹ã97ã®ã“ã¨/関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’å¦ã¶ã“ã¨ã®é‡è¦æ€§ 新人プãƒã‚°ãƒ©ãƒžã«çŸ¥ã£ã¦ãŠã„ã¦ã‚‚らã„ãŸã„人類ãŒã‚ªãƒ–ジェクト指å‘を手ã«å…¥ã‚Œã‚‹ã¾ã§ã®è»Œè·¡ 関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã‚ªãƒ–ジェクト指å‘ã®æŠœãå·®ã—ãªã‚‰ãªã„関係ã«ã¤ã„ã¦æ•´ç†ã—ã¦è€ƒãˆã‚‹ ã¨ãã‚Œãªã‚Šã«å‚考ã«ãªã‚Šãã†ãªæƒ…å ±ã¯ã‚ã‚‹ã‚‚ã®ã®ã€ç„¡é§„ã«è¤‡é›‘化ã•ã‚ŒãŸã‚ªãƒ–ジェクト指å‘をストãƒãƒ¼ãƒžãƒ³ã«ã™ã‚‹ã‚ˆã†ãªè¨˜äº‹ã°ã‹ã‚Š(ãã‚Œã ã‘今ã¾ã§ã®ã‚ªãƒ–ジェクト指å‘ã«ã¿ã‚“ãªã†ã‚“ã–ã‚Šã•ã›ã‚‰ã‚Œã¦ã„ã‚‹ã®ã ã‚ã†)ã§ã€ãã‚ãã‚ãã¡ã‚“ã¨è‡ªåˆ†è‡ªèº«ã€Œé–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã‚ªãƒ–ジェクト指å‘ã®åˆ‡ã‚Šé›¢ã•ã‚Œæ–¹ã€ã«ã¤ã„ã¦ã¯ã£ãã‚Šã•ã›ã¦ãŠããŸã„ã€ã¨è€ƒãˆã€æ¦‚念整ç†ã—ãŸçµè«–を書ãã¾ã™ã€‚ ã¾ãšç«¯çš„ãªçµè«– çµè«–ã‚’
ã€ç¿»è¨³ã€‘ã‚ãªãŸãŒæ±‚ã‚ã¦ã„ãŸãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€ - ninjinkun's diary
original: The introduction to Reactive Programming you've been missing (by @andrestaltz) (translated by @ninjinkun, reviewed by @ma0e) ã‚ãªãŸã¯ãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨å‘¼ã°ã‚Œã‚‹æ–°ã—ã„方法ãŒæ°—ã«ãªã£ã¦ã„る。 勉強ã™ã‚‹ã®ã¯å¤§å¤‰ã§ã€è‰¯ã„æ•™æãŒãªã„ã®ã§ã•ã‚‰ã«é›£ã—ã„。ç§ãŒå‹‰å¼·ã‚’始ã‚ãŸã¨ãã¯ã€ã¾ãšãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’探ã—ãŸã€‚見ã¤ã‘ãŸã®ã¯ä¸€æ¡ã‚Šã®å®Ÿè·µçš„ãªã‚¬ã‚¤ãƒ‰ã ã‘ã€ã—ã‹ã‚‚ãれらã¯è¡¨é¢ã‚’ãªãžã£ã¦ã„ã‚‹ã ã‘ã§ã€ãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ã‚¢ãƒ¼ã‚テクãƒãƒ£å…¨ä½“åƒã‚’構築ã—よã†ã¨ã—ã¦ã¯ã„ãªã‹ã£ãŸã€‚ã‚る関数をç†è§£ã™ã‚‹ã®ã«ã€ãƒ©ã‚¤ãƒ–ラリã®ãƒ‰ã‚ュメントã¯å½¹ã«ç«‹ãŸãªã„ã“ã¨ãŒã‚る。 ã“れを見ã¦æ¬²ã—ã„。 Rx.Observable.prototype.flatMapLatest(selector,
脱関数化を実用ã™ã‚‹
[1 背景ã¨å°Žå…¥](脱関数化を実用ã™ã‚‹ 1#section1) [1.1 é™çš„ãªå€‹æ•°ã®ã‚¯ãƒãƒ¼ã‚¸ãƒ£ã®ã‚る高階ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã®ã‚µãƒ³ãƒ—ル](脱関数化を実用ã™ã‚‹ 1#section1-1) [1.2 å‹•çš„ãªå€‹æ•°ã®ã‚¯ãƒãƒ¼ã‚¸ãƒ£ã®ã‚る高階ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã®ã‚µãƒ³ãƒ—ル](脱関数化を実用ã™ã‚‹ 1#section1-2) [1.3 脱関数化ã¨ã¯ã¤ã¾ã‚Š](脱関数化を実用ã™ã‚‹ 1#section1-3) [1.4 é–¢é€£ç ”ç©¶](脱関数化を実用ã™ã‚‹ 1#section1-4) [1.5 ã“ã®ç ”究](脱関数化を実用ã™ã‚‹ 1#section1-5) [2 リストã¨æœ¨ã‚’処ç†ã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã®è„±é–¢æ•°åŒ–](脱関数化を実用ã™ã‚‹ 2#section2) [2.1 二分木をリストã¸ã¨å¹³å¦åŒ–ã™ã‚‹](脱関数化を実用ã™ã‚‹ 2#section2-1) [2.2 リストã®é«˜éšŽãªè¡¨ç¾](脱関数化を実用ã™ã‚‹ 2#section2-2) [2.3 ãƒãƒ£ãƒ¼ãƒç¬¦
é…延評価ã£ã¦ãªã‚“ãªã®ã• - ãã‚‹ãる～
何ãªã‚“ã§ã—ょã†ã。分ã‹ã‚Šã¾ã›ã‚“。 自分ã®é ã®ä¸ã‚’ã¨ã‚Šã‚ãˆãšæ•´ç†ã™ã‚‹ãŸã‚ã®ã‚¨ãƒ³ãƒˆãƒªãªã®ã§ã€ã‚ãªãŸã®é ã‚’æ··ä¹±ã•ã›ã‚‹ã ã‘ã«ãªã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“。 ã‚‚ã—æ··ä¹±ã—ã¦ã—ã¾ã£ãŸã‚‰å¿˜ã‚Œã¦ãã ã•ã„。ãˆã€ç„¡ç†ï¼Ÿå¿˜ã‚Œã¦ãã ã•ã„。 自分ã®è€ƒãˆã‚’明確ã«ã—ãŸã®ã§ã€ã“ã¡ã‚‰ã‚’ã©ã†ãžã€‚ é…延評価ã„ã†ãªã‚ャンペーンã¨ã‹ã©ã†ã‹ - ãã‚‹ãる～ ã“ã‚Œã¯é…延評価ã§ã™ã‹ï¼Ÿ 関数を渡ã™ã ã‘ // Scala def hoge(f: Unit => Int) = for (i <- 1 to 2) println(f()) (* F# *) let hoge f = for i in 1..2 do printfn "%d" (f()) ã“ã®é–¢æ•°ã«æ¸¡ã™ f 㯠2 回実行ã•ã‚Œã¾ã™ã€‚ãã®ãŸã‚ã€f ã®ä¸ã§ç”»é¢å‡ºåŠ›ã‚’ã—ã¦ã„ãŸå ´åˆã€2 回出力ã•ã‚Œã¾ã™ã€‚ ã“ã‚Œã¯é…延評価ã§ã—ょã†ã‹ï¼Ÿä¿ºã¯é•ã†ã¨æ€ã„ã¾ã™ã€‚ ã“ã“ã¯å¤šãã®äººã§åˆæ„ãŒå–れるã¨æ€ã£ã¦ã¾ã™ã€‚ Sc
Callbacks are imperative, promises are functional: Node's biggest missed opportunity – The If Works
The nature of promises is that they remain immune to changing circumstances. Frank Underwood, ‘House of Cards’ You will often hear it said that JavaScript is a ‘functional’ programming language. It is described as such simply because functions are first-class values: many other features that define functional programming – immutable data, preference for recursion over looping, algebraic type syste
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Loading...
Functional Programming Principles in Scala | Coursera
LLerã®ãŸã‚ã®é–¢æ•°æŒ‡å‘入門
{{#tags}}- {{label}}
{{/tags}}