GitHub - billpmurphy/hask: Haskell language features and standard libraries in pure Python.
Hask is a pure-Python, zero-dependencies library that mimics most of the core language tools from Haskell, including: Full Hindley-Milner type system (with typeclasses) that will typecheck any function decorated with a Hask type signature Easy creation of new algebraic data types and new typeclasses, with Haskell-like syntax Pattern matching with case expressions Automagical function currying/part
「関数型言語ã€ã«é–¢ã™ã‚‹FAQå½¢å¼ã®ä¸€èˆ¬çš„説明 - Qiita
å‰ç½®ã： 特定ã®è¨€èªžã§ã¯ãªãã€é–¢æ•°åž‹è¨€èªžä¸€èˆ¬ã«é–¢ã™ã‚‹èª¬æ˜Žã§ã™ã€‚ ã“ã“ã«æ›¸ãã®ãŒè‰¯ã„ã®ã‹ã‚ã‹ã‚Šã¾ã›ã‚“ãŒã€ãれを考ãˆã‚‹æ™‚é–“ã‚‚ã‚‚ã£ãŸã„ãªã„ã®ã§ã¨ã‚Šã‚ãˆãšæ›¸ãã¾ã™ã€‚å¿…è¦ãŒç”Ÿã˜ãŸã‚‰ç§»è»¢ã—ã¾ã™ã€‚ 皆様ã®ã”è¦æœ›ã‚„自分ã®æ°—分(?)ã«ã‚ˆã‚Šéšæ™‚åŠ ç†ä¿®æ£ã—ã¾ã™ã€‚ 「ãã‚Œã¯é•ã†ã‚“ã˜ã‚ƒãªã„？ã€ã¨ã„ã†ã”指摘ã¯ã‚‚ã¡ã‚ã‚“ã€åˆå¿ƒè€…ã®æ–¹ã®ç´ 朴ãªç–‘å•ãƒ»è³ªå•ã‚„ã€ã€Œã“ã“ãŒã‚ˆãã‚ã‹ã‚‰ãªã„ã€ã€Œã“ã†ã„ã†ã“ã¨ã‚‚書ã„ã¦ã»ã—ã„ã€ã¿ãŸã„ãªã‚³ãƒ¡ãƒ³ãƒˆã‚‚æ“è¿Žã—ã¾ã™ã€‚ã™ãã«å¯¾å¿œã§ããªã„å ´åˆã‚‚ã‚ã‚‹ã¨æ€ã„ã¾ã™ãŒã™ã¿ã¾ã›ã‚“。Twitterã®esumiiå®›ã§ã‚‚構ã„ã¾ã›ã‚“ãŒã€ã‚³ãƒ¡ãƒ³ãƒˆã®ã»ã†ãŒä»–ã®æ–¹ã‚‚見ã¤ã‘ã‚„ã™ãã¦è‰¯ã„ã¨æ€ã„ã¾ã™ã€‚当然ãªãŒã‚‰ï¼ˆä»–者ã«å¯¾ã—ã¦ã‚‚）誹謗ä¸å‚·ç‰ã¯ã”é æ…®ãã ã•ã„。 ã„ãŸã ã„ãŸã‚³ãƒ¡ãƒ³ãƒˆã¯ã»ã¼æœ¬æ–‡ã«åæ˜ ã—ã¦ã„ã¾ã™ã®ã§ã€æœ¬æ–‡ã‚’èªã‚€ãŸã‚ã«ã€å¿…ãšã—もコメントをèªã‚€å¿…è¦ã¯ã‚ã‚Šã¾ã›ã‚“。もã¡ã‚ã‚“ã€èˆˆå‘³ã¨ä½™è£•(?)ãŒã‚ã‚Œã°ã‚³ãƒ¡ãƒ³ãƒˆã‚‚èªã‚“ã§ã„ãŸã ã‘ã‚Œã°éžå¸¸ã«æœ‰ç”¨
Writing foldl using foldr
In Real World Haskell, Chapter 4. on Functional Programming: Write foldl with foldr: -- file: ch04/Fold.hs myFoldl :: (a -> b -> a) -> a -> [b] -> a myFoldl f z xs = foldr step id xs z where step x g a = g (f a x) The above code confused me a lot, and somebody called dps rewrote it with a meaningful name to make it a bit clearer: myFoldl stepL zeroL xs = (foldr stepR id xs) zeroL where stepR lastL
A tutorial on the universality and expressiveness of fold (PDF)
J. Functional Programming 9 (4): 355–372, July 1999. Printed in the United Kingdom c ! 1999 Cambridge University Press 355 A tutorial on the universality and expressiveness of fold GRAHAM HUTTON University of Nottingham, Nottingham, UK http://www.cs.nott.ac.uk/-gmh Abstract In functional programming, fold is a standard operator that encapsulates a simple pattern of recursion for processing lists.
ã‚‹ã³ã¾
『るã³ã¾ã€ã¯ã€Ruby ã«é–¢ã™ã‚‹æŠ€è¡“記事ã¯ã‚‚ã¡ã‚ã‚“ã®ã“ã¨ã€Rubyist ã¸ã®ã‚¤ãƒ³ã‚¿ãƒ“ューやエッセイã€ãã®ä»–ã‚’ãŠå±Šã‘ã™ã‚‹ã‚¦ã‚§ãƒ–雑誌ã§ã™ã€‚ Rubyist Magazine ã«ã¤ã„㦠『Rubyist Magazineã€ã€ç•¥ã—ã¦ã€Žã‚‹ã³ã¾ã€ã¯ã€æ—¥æœ¬ Ruby ã®ä¼šã®æœ‰å¿—ã«ã‚ˆã‚‹ Rubyist ã® Rubyist ã«ã‚ˆã‚‹ã€Rubyist ã¨ãã†ã§ãªã„人ã®ãŸã‚ã®ã‚¦ã‚§ãƒ–雑誌ã§ã™ã€‚ æœ€æ–°å· Rubyist Magazine 0058 å· ãƒãƒƒã‚¯ãƒŠãƒ³ãƒãƒ¼ Rubyist Magazine 0058 å· RubyKaigi 2018 ç›´å‰ç‰¹é›†å· Rubyist Magazine 0057 å· RubyKaigi 2017 ç›´å‰ç‰¹é›†å· Rubyist Magazine 0056 å· Rubyist Magazine 0055 å· Rubyist Magazine 0054 å· æ±äº¬ Ruby ä¼šè° 11 ç›´
Monad tutorial
Monadic Programmingã®ã‚¹ã‚¹ãƒ¡ - Functional Reactive Programmingã¸ã®ã‚¢ãƒ—ãƒãƒ¼ãƒ
Lua ã§ä¸å‹•ç‚¹ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ - 野良C++erã®é›‘記帳
ãŸã¾ã«ã¯ Lua も書ã‹ãªã„ã¨å¿˜ã‚Œã¦ã—ã¾ã„ãã†ãªã®ã§ï¼Œä¹…ã—ã¶ã‚Šã« Lua を書ã„ã¦ã¿ãŸï¼Ž ãŠé¡Œã¯ï¼Œæœ€è¿‘ã®æ—¥è¨˜ã§ã‚‚扱ã£ãŸï¼Œä¸å‹•ç‚¹ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ï¼Ž 散々既出ã ã‚ã†ã—，新è¦æ€§ã¯å…¨ããªã„ã‘ã©ï¼Œã¾ã個人㮠blog ã ã— ãã®è¾ºã‚Šã¯å‹˜å¼ã—ã¦ãã ã•ã„，ã£ã¦ã“ã¨ã§ï¼Ž ã•ã¦ï¼ŒçŸ¥ã‚‰ãªã„人ã®ãŸã‚ã«èª¬æ˜Žã™ã‚‹ã¨ï¼Œä¸å‹•ç‚¹ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã¨ã¯ï¼Œ function fix(f) -- 実装 end local fact = fix( function( fact, x ) return x > 1 and x * fact(x-1) or 1 end ) ã£ã¦æ„Ÿã˜ã§ï¼Œãƒ©ãƒ ダå¼ã§å†å¸°ã‚’書ã‘るよã†ã«ã™ã‚‹ï¼Œã¡ã‚‡ã£ã¨ä¸æ€è°ãªé–¢æ•° fix ã®ã“ã¨ï¼Ž 勿論，ã“れ㯠local function を使ã£ã¦ local function fact(x) return x > 1 and x * fact(x-1) or 1 end ã¨æ›¸ã‘ã°
関数型言語ã§ã®é–¢æ•°ã®åŸºç¤ŽçŸ¥è˜ - ã‚ã©ã‘ãªã„話
関数型言語ã§ã®é–¢æ•°ã«ã¤ã„ã¦ã€Haskell を用ã„ã¦èª¬æ˜Žã—ã¾ã™ã€‚ 関数ã®åž‹ 関数ã®åž‹ã¯ã€-> を使ã£ã¦æ›¸ãã¾ã™ã€‚例ãˆã°ã€Int ã‚’ Char ã«å¤‰æ›ã™ã‚‹ chr ã¨ã„ã†é–¢æ•°ã®åž‹ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ chr :: Int -> Char 一引数ã®é–¢æ•°ã®åž‹ã¯ã€ã¾ãã“ã‚“ãªã‚‚ã‚“ã ã¨æ€ãˆã‚‹ã§ã—ょã†ã€‚ã³ã£ãã‚Šã™ã‚‹ã®ã¯ã€å¼•æ•°ãŒå¢—ãˆãŸã¨ãã§ã™ã€‚ãŸã¨ãˆã°ã€replicate ã¨ã„ã†é–¢æ•°ã®åž‹ã‚’見ã¦ã¿ã¾ã—ょã†ã€‚ replicate :: Int -> a -> [a] replicate ã¯ã€ç¬¬äºŒå¼•æ•°ã§æŒ‡å®šã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿ã‚’第ー引数ã«æŒ‡å®šã•ã‚ŒãŸå€‹æ•°åˆ†ç”¨æ„ã—ã¦ã€ãƒªã‚¹ãƒˆã«ã—ã¦è¿”ã™é–¢æ•°ã§ã™ã€‚([] ã¯é…列ã§ã¯ãªãã€ãƒªã‚¹ãƒˆã§ã™ã€‚) 次ã®ã‚ˆã†ã«å‹•ãã¾ã™ã€‚ > replicate 3 "foo" → ["foo","foo","foo"] a ã¯åž‹å¤‰æ•°ã¨ã„ã£ã¦ã€ä»»æ„ã®åž‹ã‚’å–ã‚Œã¾ã™ã€‚ãªã˜ã‚ãªã„人ã¯ã€å…·ä½“çš„ãªåž‹ã‚’当ã¦ã¯ã‚ã¦ã¿
CUFP 2011 Tokyo ã®ãŠçŸ¥ã‚‰ã› - camlspotter’s blog
C.U.F.P. (Companhia União Fabril Portuense) 関数型言語ã®å›½éš›ä¼šè° ICFP ã®ä»Šå¹´ã®é–‹å‚¬åœ°ã¯æ±äº¬ã§ã™ã€‚ICFP ã®ã‚¢ã‚¸ã‚¢ã§ã®é–‹å‚¬ã¯åˆã‚ã¦ã§ã™ã。F# ã‚‚æ£å¼ã«ãƒªãƒªãƒ¼ã‚¹ã•ã‚Œã¾ã—ãŸã— Haskell ã‚‚ Haskell Platform ãŒç«‹ã¦ç¶šã‘ã«å‡ºã¦ã¾ã™ã€‚Coq ã‚„ Agda ãªã©ã®ä¾å˜åž‹ã®è¨€èªžãƒ¦ãƒ¼ã‚¶ã‚‚増ãˆã¦ãã¾ã—ãŸã€‚(OCaml ã‚‚ã²ã£ãã‚Šã¨é †èª¿ã«ãƒãƒ¼ã‚¸ãƒ§ãƒ³ãŒ 3.11 ã‹ã‚‰ 3.12 ã«ã‚ãŒã‚Šã¾ã—ãŸã€‚) (OO 寄り㮠Scala ã¨ã‹åž‹ã®ç„¡ã„言語ã¯åƒ•ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“ã”ã‚ã‚“ãªã•ã„。触れã¦ãªã„型付関数型言語ユーザã®æ–¹ã‚‚ã”ã‚ã‚“ãªã•ã„。) ãã‚“ãªè¨³ã§é–¢æ•°åž‹è¨€èªžç•Œéšˆã¯ã“ã®ã”ã‚活気付ã„ã¦ã„ã¾ã™ã€‚ 2011å¹´ã¯æ—¥æœ¬ã«ãŠã‘る関数型言語ブレイクã®å¹´ã«ãªã‚‹ã‹ï¼Ÿãªã‚‹ã¨å¬‰ã—ã„ãªã‚ã¨ã„ã†æ–¹ã«ãŠçŸ¥ã‚‰ã›ã§ã™ã€‚ ICFP 2011 ã«ä½µè¨ã•ã‚Œã¦ CUFP workshop
JavaScript ã§ã‚«ãƒªãƒ¼åŒ–ã€å†ã³: Days on the Moon
以å‰ã€ã€ŒJavaScript ã§å¼•æ•°æŸç¸›ã€ã«ãŠã„ã¦é–¢æ•°ã®ã‚«ãƒªãƒ¼åŒ–を試ã¿ã¾ã—ãŸã€‚ã—ã‹ã—ã€ãã“ã§ã‚«ãƒªãƒ¼åŒ–ã•ã‚ŒãŸé–¢æ•°ã¯ã€ãã®ã¾ã¾ã§ã¯ä¸€åº¦ã—ã‹éƒ¨åˆ†é©ç”¨ãŒã§ããšã€ã¾ãŸã€æœ€åˆã®é–¢æ•°å‘¼ã³å‡ºã—ã¯å¿…ãšéƒ¨åˆ†é©ç”¨ã¨ã—ã¦æ‰±ã‚ã‚Œã¦ã„ã¾ã—ãŸã€‚ function mean3(a, b, c) { return (a + b + c) / 3; } // 「JavaScript ã§å¼•æ•°æŸç¸›ã€ã«ãŠã‘ã‚‹ curry 関数。 var curriedMean3 = curry(mean3); curriedMean3(1)(2, 3); // => 2 curriedMean3(1)(2)(3); // => TypeError: curriedMean3(1)(2) is not a function // ãã®ã¾ã¾ã§ã¯éƒ¨åˆ†é©ç”¨ã‚’ 2 回以上行ãˆãªã„。 // curry(curriedMean3(1))(2)(3) ãªã‚‰å¤§ä¸ˆå¤«
実ã¯ã‚ªãƒ–ジェクト指å‘ã£ã¦ã—ã£ãã‚Šãã™ãŽã‚‹ã‚“ã§ã™ï¼ ä¸å¤‰ã‚ªãƒ–ジェクトã®ã™ã‚ã‚。 - Bug Catharsis
ãƒã‚°ã®ãªã„ソフトウェアを作りãŸã„ãŠä»•äº‹ã§ã¯ä¸»ã«VB.NETã¨C#を。趣味ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯é–¢æ•°åž‹è¨€èªžF#を利用ã—ã¦ã„ã¾ã™ã€‚ ç§è‡ªèº«ã®F#スã‚ル(関数型的ãªè€ƒãˆæ–¹)ã¯ã€ã¾ã ã¾ã 実践レベルã¨ã¯ã¨ã¦ã‚‚言ãˆãªã„ã‚·ãƒãƒ¢ãƒŽã ã‘ã©ã€ é¢ç™½ã„発見ã¨å¤šãã®å¯èƒ½æ€§ã‚’æ„Ÿã˜ã‚‰ã‚Œã‚‹è¨€èªžãªã®ã§ã€F#ã¯ã•ã‚ã£ã¦ã„ã¦ã¨ã¦ã‚‚楽ã—ã„。 ç§ã¯ã“ã‚Œã¾ã§ã‚ªãƒ–ジェクト指å‘言語ã«ã‚ˆã‚‹ã‚ªãƒ–ジェクト指å‘プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’ã“よãªãæ„›ã—ã¦ãã¾ã—ãŸã€‚ ã¨ã„ã†ã®ã‚‚ã€ã€Œã„ã‹ã«ãƒã‚°ã‚’減らã™ã‹ã€ã€ã€Œãƒã‚°ã®ãªã„ソフトウェアを作るã“ã¨ã€ãŒç§ã®æœ€å¤§ã®é–¢å¿ƒäº‹ã ã‹ã‚‰ã§ã™ã€‚ ãƒã‚°ã®å¤šã„コードã€ã‚ã‚‹ã„ã¯æŠ€è¡“çš„è² å‚µã®å¤šã„コードã¨ã„ã†ã®ã¯ã€ã‚³ã‚¹ãƒˆçš„ãªå•é¡ŒãŒã‚ã‚‹ã°ã‹ã‚Šã‹ã€ 開発者ã®èº«ä½“や心ã¾ã§ã‚‚ã‚’ä¸å¥åº·ã«ã—ã€ã‚ã‚Œã‚ã‚Œã«å¤§ããªä¸å¹¸ã‚’ã‚‚ãŸã‚‰ã™ã“ã¨ã‚’経験的ã«ã‚ã‹ã£ã¦ã„ã‚‹ã‹ã‚‰ã§ã™ã€‚ ã‚ãŸã—ã«ã¨ã£ã¦ã‚ªãƒ–ジェクト指å‘技術ã¯ã€ãれらã®å•é¡Œã‚’防ã„ã り解決をã™ã‚‹æ‰‹æ®µã¨ã—ã¦é©ã—ãŸæŠ€è¡“ã§ã—ãŸã€‚
関数型言語ã§ã®ãƒ‡ã‚¶ã‚¤ãƒ³æ‰‹æ³•
Takashi Miyamoto @tmiya_ オブジェクト指å‘ã¯OOPã®ä»–ã«OOA,OODãªã©ä¸Šæµå·¥ç¨‹å‘ã‘ã®æ–¹æ³•è«–ãŒã‚ã‚‹ã®ã ãŒã€é–¢æ•°åž‹è¨€èªžã«ã¤ã„ã¦ã‚‚FPã®ä»–ã«FA,FDãŒã‚ã‚‹ã®ã ã‚ã†ã‹ï¼Ÿèª°ã‹é©åˆ‡ãªè«–æ–‡/教科書ã¨ã‹çŸ¥ã‚Šã¾ã›ã‚“ã‹ï¼Ÿ 2010-05-30 09:26:38 Ikegami Daisuke @ikegami__ 探ã—ã¦ã¿ã¾ã™ã€‚ã§ã‚‚å¼·ã„型付ã‘ã‹ã€å¼±ã„型付ã‘ã‹ã§ã€ã¾ã‚‹ã£ãã‚Šç•°ãªã‚‹ã§ã—ょㆠRT @tmiya_: オブジェクト指å‘ã¯OOPã®ä»–ã«OOA,OODãªã©ä¸Šæµå·¥ç¨‹å‘ã‘ã®æ–¹æ³•è«–ãŒã‚ã‚‹ã®ã ãŒã€é–¢æ•°åž‹è¨€èªžã«ã¤ã„ã¦ã‚‚FPã®ä»–ã«FA,FDãŒã‚ã‚‹ã®ã ã‚ã†ã‹ï¼Ÿèª°ã‹é©åˆ‡ãªè«–æ–‡/教科書ã¨ã‹çŸ¥ã‚Šã¾ã›ã‚“ã‹ï¼Ÿ 2010-05-30 09:30:40 Ikegami Daisuke @ikegami__ @tmiya_ 個人的ãªæ„Ÿæƒ³ã§ã™ãŒã€å¼·ã„型付ã‘ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§é–‹ç™ºã‚’è¡Œã†å ´åˆã€å®Ÿè£…ã®å‰ã«ã€å…¨ä½“
)
FP (programming language) - Wikipedia
FP (for functional programming)[2] is a programming language created by John Backus to support the function-level programming[2] paradigm. It allows building programs from a set of generally useful language primitives and avoiding named variables (a style also called tacit programming or "point free"). It was heavily influenced by APL developed by Kenneth E. Iverson in the early 1960s.[3] The FP l
Erlang is Not Functional
Robert Fischer claims Scala is not a functional language. But if you go by his post then Erlang isn't either. ModulesFischer says In OCaml, we define a function like this:let f x = x + 1;;In Scala, though, we define the function somewhat differently:object SomeHolderObject { val f(x:int):int = { x + 1 } } Now some Erlang -module(SomeHolderModule). -export([f/1]). f(X) -> X + 1. Erlang requires a f
Conal Elliott » Is Haskell a purely functional language?
Inspirations & experiments, mainly about denotative/functional programming in Haskell There is a lot of confusion about the meaning of “functional†and “declarative†as descriptions of programming languages and paradigms. For instance, Haskell is sometimes advertised as a “purely functional programming language†and other times as “the world’s finest imperative programming languageâ€. I added some
純粋関数型言語Concurrent Clean
純粋é…延関数型言語Concurrent Clean (Pure and lazy functional language : Concurrent Clean) 〜 The most functional language 〜 Concurrent Cleanã¯ã€ã‚ªãƒ©ãƒ³ãƒ€ã®ãƒã‚¤ãƒ¡ãƒ¼ãƒ˜ãƒ³å¤§å¦ã§é–‹ç™ºã—ã¦ã„ã‚‹ã€ç´”粋ãªé–¢æ•°åž‹è¨€èªžã§ã™ã€‚ メジャーãªé–¢æ•°åž‹è¨€èªžã¨ã—ã¦ã¯ã€Lispã€Schemeã€MLã€Haskellç‰ãŒã‚ã‚Šã¾ã™ãŒã€ãれらã«æ±ºã—ã¦åŠ£ã‚‹ã“ã¨ã®ãªã„環境ã¨è¨€èªžä»•æ§˜ã‚’æŒã¤è¨€èªžã§ã™ã€‚効率性・開発環境・言語仕様ã©ã‚Œã‚‚最高ä½ã§ã¯ãªã„ã‹ã¨æ€ã†ãらã„ã§ã™ã€‚言語仕様的ã«ã¯ã€ã“ã®ä¸ã§ã¯ã€Haskellã«ä¸€ç•ªä¼¼ã¦ã„ã‚‹ã¨ã•ã‚Œã¦ã„ã¾ã™ï¼ˆæ²¿é©çš„ã«ã¯Mirandaã¨è¨€ã‚れる純粋関数型言語ã®ä¸é–“言語ã‹ã‚‰å‡ºç™ºã—ã¦ã„ã¾ã™ã®ã§ã€Mirandaã«ä¼¼ã¦ã„ã‚‹ã¨è¨€ã†æ–¹ãŒæ£ç¢ºã§ã—ょã†ãŒï¼‰ã€‚ ã“ã“ã§ã¯ã€è‘—作者ãŸã‚‹Plasmeijer教授
How to Design Programs
How to Design Programs An Introduction to Computing and Programming Matthias Felleisen Robert Bruce Findler Matthew Flatt Shriram Krishnamurthi The MIT Press Cambridge, Massachusetts London, England Copyright © 2001 Massachusetts Institute of Technology Illustrations © 2000 Torrey Butzer All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
A companion booklet to "Functional Programming in Scala"
Simon Peyton-Jones - Microsoft Research
http://www.jmuk.org/diary/index.php/2008/01/25/2/
{{#tags}}- {{label}}
{{/tags}}