Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part INext: Introduction Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I John McCarthy, Massachusetts Institute of Technology, Cambridge, Mass. 1 April 1960
Lambda calculus - Wikipedia
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. Untyped lambda calculus, the topic of this article, is a universal model of computation that can be used to simulate any Turing machine (and vice versa). It was introduced by the mathematician Alonzo
モナドã®ã™ã¹ã¦ã€€Haskell ã«ãŠã‘るモナドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…括的ガイド
モナドã®ã™ã¹ã¦ Haskell ã«ãŠã‘るモナドプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç†è«–ã¨å®Ÿè·µã«é–¢ã™ã‚‹åŒ…括的ガイド Version 1.1.0 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€ãƒ¢ãƒŠãƒ‰ã®æ¦‚念ã¨ãã®é–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘る応用㫠ã¤ã„ã¦ã€åˆä¸ç´šã® Haskell プãƒã‚°ãƒ©ãƒžã«ã‚ã‹ã‚Šã‚„ã™ãã€åˆ©ç”¨ä¾¡å€¤ãŒã‚るよã†ãª 解説をã™ã‚‹ã“ã¨ã‚’æ—¨ã¨ã—ã¦ã„ã¾ã™ã€‚èªè€…㯠Haskell ã«ãªã‚Œã¦ã„ã‚‹ã“ã¨ã‚’å‰æ㨠ã—ã¾ã™ãŒã€ãƒ¢ãƒŠãƒ‰ã«é–¢ã™ã‚‹çµŒé¨“ã¯è¦æ±‚ã—ã¦ã„ã¾ã›ã‚“。ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ã€å¤š ãã®é¡Œæã‚’ã‚«ãƒãƒ¼ã—ã¦ã„ã¾ã™ã€‚後åŠã®ã‚»ã‚¯ã‚·ãƒ§ãƒ³ã§ã¯ã€å‰åŠã®é¡Œæをよãç†è§£ã— ã¦ã„ã‚‹ã“ã¨ã‚’å‰æã¨ã—ã¾ã™ã€‚é †ã‚’ãŠã£ã¦ã€ãƒ¢ãƒŠãƒ‰ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’例示ã™ã‚‹ãŸã‚ ã®ã‚µãƒ³ãƒ—ルコードãŒãŸãã•ã‚“用æ„ã•ã‚Œã¦ã„ã¾ã™ã€‚一èªã§ã€ã™ã¹ã¦ã®é¡Œæã‚’å¸åŽã— よã†ã¨ã„ã†ã®ã¯ãŠå‹§ã‚ã§ãã¾ã›ã‚“。 ã“ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã¯ 3 ã¤ã®éƒ¨åˆ†ã§æ§‹æˆã•ã‚Œã¦ã„ã¾ã™ã€‚最åˆã®éƒ¨åˆ†ã¯ã€ 関数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã‘るモナドã®åŸºæœ¬çš„
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}