[B! lambda] TaKUMAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

TaKUMA id:TaKUMA

lambdaã«é–¢ã™ã‚‹TaKUMAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (16)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

åœè«–ã¨ãƒ©ãƒ ãƒ€è¨ˆç®—ã®å‚è€ƒæ›¸ - (ä¿å˜ç”¨) æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ ãƒ¡ãƒ¢ç·¨
æ¬¡ã®ã‚¨ãƒ³ãƒˆãƒªãƒ¼å†…ã§æ›¸ç±ã«è§¦ã‚Œã¦ã„ã¾ã™ã€‚ groovyã¨ãƒ©ãƒ ãƒ€å¼(6)ï¼šè£œè¶³ã¨ç·æ‹¬ - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãª Blog)â†’ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®åŸºç¤Žç†è«–ã€ãƒ—ãƒã‚°ãƒ©ãƒ æ„å‘³è«– ã‚¦ãƒ«ãƒˆãƒ©ãƒ»ãƒžã‚¯ãƒãªç«‹å ´ã®å®šå¼åŒ– - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãª Blog)â†’ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®åŸºç¤Žç†è«– è¦‹ã¤ã‘ã‚‚ã®ï¼šAngelo Vistoliã®ã¦ã„ãã„ãªè«–æ–‡ - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãª Blog)â†’Categorical Logic and Type Theory, Handbook of Categorical Algebra 2 ãƒ‡ãƒ¼ã‚¿åž‹ã®ã‚¯ãƒ¬ã‚¤ã‚¸ãƒ¼è¨ˆç®— - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãª Blog)â†’Categories and Computer Science åœè«–ã€è«–ç†ã€è¨ˆç®—è«–ã®é–¢ä¿‚ã«ã¤ã„ã¦ã¯ã€"Introduction to Higher-Order Categorical L
TaKUMA 2010/12/14
åœè«–

lambda

Logic

Programming
ãƒªãƒ³ã‚¯
ãƒ©ãƒ ãƒ€è¨ˆç®—å…¥é–€
TaKUMA 2010/12/14
lambda

functional

Programming

CS

æƒ…å ±

Tutorial
ãƒªãƒ³ã‚¯
Y Combinator - LoveRubyNet
$Id: ycombinator.html,v 1.6 2002/06/27 23:37:39 aamine Exp $ [ruby-list:35058] ã«åˆºæ¿€ã‚’å—ã‘ã¦ Y combinator ã‚’è§£èªã—ã¦ã¿ãŸã€‚ ã“ã‚“ãªã‚‚ã‚“èªã‚€ãã‚‰ã„ãªã‚‰ä»¥ä¸‹ã®å‚è€ƒãƒšãƒ¼ã‚¸ã‚’èªã‚“ã ã»ã†ãŒã„ã„ã€‚ å‚è€ƒã«ã—ãŸ (ã¨ã„ã†ã‹ã»ã¨ã‚“ã©ãã®ã¾ã¾ãª) ãƒšãƒ¼ã‚¸ (è‹±èªž) http://www.ececs.uc.edu/~franco/C511/html/Scheme/ycomb.html å‹•æ©Ÿ å†å¸°é–¢æ•°ã¯å†å¸°ã™ã‚‹ã¨ãã«è‡ªåˆ†è‡ªèº«ã‚’åå‰ã§å‘¼ã¶ã®ãŒæ™®é€šã§ã‚ã‚‹ã€‚ ã“ã‚Œã‚’ãªã‚“ã¨ã‹ã—ã¦åå‰ã‚’ä½¿ã‚ãšã€é–¢æ•°ãã®ã‚‚ã®ã‚’å‘¼ã¶ã‚ˆã†ã« ã•ã›ãŸã„ã€‚ æ±‚ã‚ã‹ãŸ ã¾ãšå˜ç´”ãª fact (éšŽä¹—) ã‚’ä»¥ä¸‹ã«ç¤ºã™ã€‚è¨€èªžã¯ Scheme ã§ã‚ã‚‹ã€‚ (define fact (lambda (n) (if (zero? n) 1 (* n (fact (- n
TaKUMA 2010/12/06
Y combinator

Programming

Lisp

Scheme

lambda

functional

CS
ãƒªãƒ³ã‚¯
Haskell ã§ Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ - ã‚ã©ã‘ãªã„è©±
Haskell ã§ã¯ã€Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ãŒä½œã‚Œãªã„ã¨èª¤è§£ã—ã¦ã„ã‚‹äººãŒã„ã‚‹ã®ã§ã€ã§ãã‚‹ã“ã¨ã‚’ç¤ºã™ã¨åŒæ™‚ã«ã€ã“ã‚Œã¾ã§å¦ã‚“ã ã“ã¨ã‚’ã¾ã¨ã‚ã¦ã¿ã¾ã™ã€‚ é…å»¶è©•ä¾¡ã‚’æ´»ã‹ã—ãŸ Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ é–¢æ•°åã‚’ç”¨ã„ãŸå†å¸°ã‚’ä½¿ã£ã¦ã‚ˆã„ãªã‚‰ã€Haskell ã§ã¯é…å»¶è©•ä¾¡ã®ãŠã‹ã’ã§ã€Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã‚’å®šç¾©ã§ã‚ã‚‹ Y x = x (Y x) ã®é€šã‚Šã«æ›¸ã‘ã¾ã™ã€‚ y :: (a -> a) -> a y x = x (y x) Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ç”¨ã®éšŽä¹—ã‚’å®šç¾©ã—ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ fact :: Num a => (a -> a) -> a -> a fact = \f n -> if n == 0 then 1 else n * f (n-1) ä»¥ä¸‹ã®ã‚ˆã†ã«å‹•ãã¾ã™ã€‚ y fact 4 â†’ 24 ã§ã‚‚ã€ã“ã®éšŽä¹—ã¯ Haskell ã£ã½ããªã„ã®ã§ã€å…¥ã‚Šå£ã§åˆ†å²ã™ã‚‹ã‚ˆã†ã«æ›¸ãç›´ã—ã¦ã¿ã¾ã™ã€‚ fact :: Num a => (a
TaKUMA 2010/12/06
Haskell

Programming

lambda

functional

CS

Y combinator
ãƒªãƒ³ã‚¯
ã•ã‚ã€Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿(ä¸å‹•ç‚¹æ¼”ç®—å)ã‚’ä½¿ãŠã†ï¼ - ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“
å‰å›žã€ãŠã¨ã†ã•ã‚“ã«ã‚‚ã‚ã‹ã‚‹Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ï¼(çµµè§£ãè§£èª¬ç·¨) - ã‚ˆãã‚ã‹ã‚Šã¾ã›ã‚“ã¨ã„ã†ã‚¨ãƒ³ãƒˆãƒªã§ã€Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿(ä¸å‹•ç‚¹æ¼”ç®—å)ã¨å†å¸°ã®çµµè§£ãè§£èª¬ã‚’ã—ã¾ã—ãŸã€‚ Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è‡ªèº«ã¯ã€çµå±€ã®ã¨ã“ã‚å†å¸°ã‚’ç”£ã¿å‡ºã—ã¦ãã‚Œã‚‹ã ã‘ã§ã™ã€‚é–¢æ•°(æ£ç¢ºã«ã¯Î»ã¨ã„ã†å˜ç´”ãªæ–‡å—åˆ—å¤‰æ›ãƒ«ãƒ¼ãƒ«)ã ã‘ã§å‡ºæ¥ã¦ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«é–¢ã™ã‚‹ã„ã‚ã‚“ãªåŽŸç†ã®ç ”ç©¶ã‚’å¯èƒ½ã«ã™ã‚‹ã®ãŒå‡„ã„è¨³ã§ã™ã€‚ãã®è¾ºã®ã•ã‚ã‚Šã‚’ã€ãã—ã ã•ã‚“ãŒè§£èª¬ã•ã‚Œã¦ã„ã¾ã™ã€‚ã—ã‹ã—ã€å˜ãªã‚‹å†å¸°ãªã‚‰ã€å®Ÿéš›ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ãªã‚“ã¦ä½¿ã‚ãªãã¦ã‚‚å‡ºæ¥ã¾ã™ã€‚ ã˜ã‚ƒã‚ã€Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã¨ã‹ä¸å‹•ç‚¹ã¨ã‹ã¯ã€å‰ã„å¦è€…ã•ã‚“ã¨ã‹ãŒç ”ç©¶ã«ä½¿ãˆã°ã„ã„ã‚‚ã®ã§ã€æ™®é€šã®ãƒ—ãƒã‚°ãƒ©ãƒžã«ã¯ä½•ã®æ„å‘³ã‚‚ãªã„ãƒ¢ãƒŽãªã®ã§ã—ã‚‡ã†ã‹ï¼Ÿ ã¨ã„ã†ã‚ã‘ã§ã€ä»Šå›žã¯ãƒã‚¸ãƒ†ã‚£ãƒ–ã«ã€Yã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã‚„ä¸å‹•ç‚¹ã§å‡ºã¦ãã‚‹è€ƒãˆæ–¹ã‚’ã€ç†è«–ã ã‘ã˜ã‚ƒãªãã€å®Ÿéš›ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«å¿œç”¨ã™ã‚‹ä¾‹ã‚’è¦‹ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ ä»Šå›žã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®ä¾‹ã‚’
TaKUMA 2010/12/06
Y combinator

Programming

JavaScript

functional

lambda

CS
ãƒªãƒ³ã‚¯
Y combinator ã®è¬Ž
ã¾ã¨ã‚: Y combinator ã¯ã€ ä¸å‹•ç‚¹æ¼”ç®—å (ä¸å‹•ç‚¹ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿) ã¨å‘¼ã°ã‚Œã‚‹ã‚‚ã®ã®ã²ã¨ã¤ã§ã‚ã‚‹ã€‚ ã‚ã‚‹é«˜éšŽé–¢æ•° f ã« Y ã‚’é©ç”¨ã—ãŸå€¤ Yf ã¯ã€é–¢æ•° f ã®ä¸å‹•ç‚¹ã¨ãªã‚‹ã€‚ ä¸å‹•ç‚¹æ¼”ç®—åã‚’ä½¿ã†ã¨ã€åå‰ã®ãªã„é–¢æ•°ã§ã‚‚è‡ªåˆ†è‡ªèº«ã‚’å†å¸°çš„ã«å‘¼ã³å‡ºã™ã“ã¨ãŒã§ãã‚‹: Y = (Î»f. (Î»x. f (x x)) (Î»x. f (x x))) Y ã®æ”¹è‰¯ç‰ˆ = (Î»f. (Î»x. (Î»p. f((x x), p))) (Î»x. (Î»p. f((x x), p)))) ã“ã‚Œä»¥å¤–ã«ã‚‚ã€ä¸å‹•ç‚¹æ¼”ç®—åã¨ã—ã¦ Turingã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ Î¸ ãŒçŸ¥ã‚‰ã‚Œã¦ã„ã‚‹: Î¸ = (Î»x. (Î»y. y ((x x) y))) (Î»x. (Î»y. y ((x x) y))) (è¿½è¨˜) Î»-å¼ (lambda expression) ã¯ã€ã•ã—ãšã‚ã€Žé–¢æ•°ã®ãƒ’ãƒ¢ãƒŽ (å¹²ç‰©)ã€ã®ã‚ˆã†ãªã‚‚ã®ã§ã‚ã‚‹ã€‚ æ°´ (=å¼•æ•°) ã‚’ã‹ã‘
TaKUMA 2010/12/06
Y combinator

functional

lambda

How to

Tips

Programming

CS
ãƒªãƒ³ã‚¯
404 Blog Not Found:Turingã¨Churchã®ç‹é–“ã§
2006å¹´04æœˆ16æ—¥13:53 ã‚«ãƒ†ã‚´ãƒªMathæ›¸è©•/ç”»è©•/å“è©• Turingã¨Churchã®ç‹é–“ã§ The Emperor's New Mind Roger Penrose [é‚¦è¨³:çš‡å¸ã®æ–°ã—ã„å¿ƒ] ãªã‚“ã§ã²ã’ã½ã‚“ãŒåå¾©ãŒã™ãã«ã‚ã‹ã‚‰ãªã‹ã£ãŸã‹ã‚’æ†¶æ¸¬ã™ã‚‹ã¨ã€ã€Œå¤‰æ•°ã¨ã¯ä»£å…¥ã™ã¹ãã‚‚ã®ã€ã€ã¨ã„ã†æ‰‹ç¶šãåž‹è¨€èªžã®å‘ªç¸›ãŒæ€ã„ç«‹ã¤ã€‚ã²ã’ã½ã‚“ã¯åˆ¥ã«ãŒã£ã‹ã‚Šã™ã‚‹å¿…è¦ã¯ãªã„ã€‚hyukiã•ã‚“ã•ãˆãã‚Œã«å¼•ã£ã‹ã‹ã£ã¦ã„ãŸã‚“ã ã‹ã‚‰ã€‚ ãã®è¨¼æ‹ ã‚’ã€ä»¥ä¸‹ã«ãŠè¦‹ã›ã™ã‚‹ã€‚ [çµ]2005å¹´8æœˆ - www.textfile.org sub fix { my $G = shift; return $G->( sub { my $x = shift; return fix($G)->($x); } ); } ã“ã‚Œã¯Perlã§å®Ÿè£…ã—ãŸä¸å‹•ç‚¹é–¢æ•°ã§ã€å…¨ãå•é¡Œãªãå‹•ãã€‚ã—ã‹ã—ã€hyukiã•ã‚“ã‚‚çŸ¥ã‚‰ã¬é–“ã«ä¸€ã¤ã€Œåå‰‡ã€ã‚’çŠ¯ã—ã¦ã„ã‚‹ã“
TaKUMA 2010/12/06
lambda

functional

Programming

Scheme

Perl

Lisp

CS
ãƒªãƒ³ã‚¯
Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã£ã¦ä½•ï¼Ÿ - ITæˆ¦è¨˜
ã“ã®ã‚¨ãƒ³ãƒˆãƒªã® è¦ªå‹ã¸ã€‚ãƒ–ãƒã‚°ã‚’æ›¸ã“ã†ã€‚ - ITæˆ¦è¨˜ y ãŒãƒ–ãƒã‚°ã‚’å§‹ã‚ãŸã¿ãŸã„ãªã®ã§ã€èªã‚“ã§ã¿ãŸã€‚ ã§ã€æœ€æ–°ã®ã‚¨ãƒ³ãƒˆãƒªã‚’èªã‚“ã§ã¿ãŸã‚‰ã€ Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã¨ã„ã†ã‚‚ã®ã«ã¤ã„ã¦æ›¸ã„ã¦ã‚ã£ãŸã®ã§ã€ Y CombinatorãŒå‡„ã™ãŽã‚‹ï¼ - yuji1982ã®æ—¥è¨˜ Y ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã£ã¦ä½•ã£ã¦ã¨ã“ã‚ã‹ã‚‰ã€è‡ªåˆ†ã§ã‚‚ã„ã‚ã„ã‚è€ƒãˆã¦ã¿ãŸã€‚ çµå±€ãªã‚“ãªã®ã‹ã•ã£ã±ã‚Šåˆ†ã‹ã‚‰ãªã‹ã£ãŸã‚“ã§ã™ãŒã€è‡ªåˆ†ãŒè€ƒãˆãŸã“ã¨ã‚’ã¾ã¨ã‚ã¦ãŠã ã¾ãšã€ãƒ•ã‚£ãƒœãƒŠãƒƒãƒæ•°ã‚’æ±‚ã‚ã‚‹ fib ã‚’å®šç¾©ã™ã‚‹ var fib = function(n){ return (n <= 2) ? 1 : (arguments.callee(n-1) + arguments.callee(n-2)); }; fib(10); ãŠãŠï¼ JS ã™ã’ãƒ¼ï¼åå‰ã¯ n ã—ã‹ä½¿ã£ã¦ããƒ¼ã‚ˆï¼ ã‚ã§ãŸã—ã€ã‚ã§ãŸã—ã€‚ã€‚ã€‚ã€‚ã˜ã‚ƒãªãã¦ï¼ JS ãŒç´ æ™´ã‚‰ã—éŽãŽã¦è©±ãŒçµ‚ã‚ã£ã¦ã—ã¾
TaKUMA 2010/12/06
JavaScript

lambda

functional

Programming
ãƒªãƒ³ã‚¯
More preview enhancements for Windows Azure AD Premium - Active Directory Blog - Site Home - TechNet Blogs
We're happy to announce that ASP.NET Core OData 9 has been officially released and is available on NuGet: Microsoft.AspNetCore.OData 9.0.0 The major highlight of this release is the update of the OData .NET dependencies to the 8.x major version. By updating the dependencies,...
TaKUMA 2010/12/06
lambda

functional

Programming

Y combinator

CS
ãƒªãƒ³ã‚¯
Computational Logic
TaKUMA 2010/11/15
math

functional

lambda

CS
ãƒªãƒ³ã‚¯
çµµã‚’æã„ã¦å¦ã¶ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒžã®ãŸã‚ã®ãƒ©ãƒ ãƒ€è¨ˆç®— - æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ (ã¯ã¦ãªBlog)
ã€ŒJavaScriptã§å¦ã¶ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒžã®ãŸã‚ã®ãƒ©ãƒ ãƒ€è¨ˆç®—ã€ã¯ã€1å›žã§ã¯è¿°ã¹åˆ‡ã‚‰ãªãã¦ã€ä¸€æ®µè½ä»˜ã„ãŸã¨ã“ã‚ã§åŒºåˆ‡ã‚Šã¾ã—ãŸã€‚ã“ã‚Œã¯ã‹ãˆã£ã¦è‰¯ã‹ã£ãŸã§ã™ãã€ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã‚„ãƒˆãƒ©ãƒƒã‚¯ãƒãƒƒã‚¯ã§ãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ãŒå¾—ã‚‰ã‚ŒãŸã®ã§ã€‚ ãã®ãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ãªã©ã‚’ã‹ã‚“ãŒã¿ã¦ã€ã€Œæ®‹ã‚Šï¼æ¬¡å›žã®è©±é¡Œã€ã¨ã—ã¦äºˆå‘Šã—ãŸå†…å®¹ã¨ã¯é£Ÿã„é•ã£ã¦ã—ã¾ã†ã®ã ã‘ã©ã€ä»Šå›žã¯ã€æ–‡ç« ã§ã¯ä¼ã‚ã‚Šã«ãã„ï¼ˆå‰å›žã†ã¾ãä¼ã‚ã‚‰ãªã‹ã£ãŸã¨æ€ãˆã‚‹ï¼‰ãƒ©ãƒ ãƒ€è¨ˆç®—ã®å¤§äº‹ãªãƒ„ãƒœã‚’ã€ãªã‚“ã¨ã‹è¡¨ç¾ã—ã¦ã¿ã‚ˆã†ã¨æ€ã„ã¾ã™ã€‚ ï¼»ã“ã®ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®å†…å®¹ã¯ã ã„ã¶å‰ã«ã»ã¼å‡ºæ¥ä¸ŠãŒã£ã¦ã„ãŸã®ã ã‘ã©ã€ã‚³ã‚³ã«æ›¸ã„ã¦ã‚ã‚‹äº‹æƒ…ã§ã€â€œãŠçµµæãâ€ãŒãªã‹ãªã‹å‡ºæ¥ãªã‹ã£ãŸã®ã§ã™ã€‚ï¼½ â€»å°åˆ·ã®ã¨ãã¯ã‚µã‚¤ãƒ‰ãƒãƒ¼ãŒæ¶ˆãˆã¾ã™ã€‚ å†…å®¹ï¼š çŸ¥ã£ã¦ã„ã¦æã¯ãªã„ è¨ˆç®—ã¯èº«ä½“çš„ã«ç†è§£ã—ã‚ˆã† ãƒ©ãƒ ãƒ€é …ã®ãƒ„ãƒªãƒ¼è¡¨ç¤ºï¼šæº–å‚™ ãƒ©ãƒ ãƒ€é …ã®ãƒ„ãƒªãƒ¼è¡¨ç¤ºï¼šæãï¼ Î²å¤‰æ›ã«å¯¾å¿œã™ã‚‹ãƒ„ãƒªãƒ¼ã®æãæ›ãˆ ã‚‚ã£ã¨Î²å¤‰æ›ã‚’ã‚„ã£ã¦ã¿ã‚ˆã† è¨ˆç®—ç¾è±¡ã‚’
TaKUMA 2010/11/15
math

Programming

functional

Language

lambda
ãƒªãƒ³ã‚¯
æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ - JavaScriptã«ã‚ˆã‚‹ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆãƒ»ãƒ¢ãƒŠãƒ‰ã€ã™ã£ã’ãƒ¼ç°¡å˜!
å…ˆé€±æ›¸ã„ãŸã‚¨ãƒ³ãƒˆãƒªãƒ¼ã€Œåœè«–ã‚„ãƒ¢ãƒŠãƒ‰ãŒã€ã©ã†ã—ã¦æ–‡æ›¸å‡¦ç†ã‚„XMLã¨é–¢ä¿‚ã™ã‚‹ã®ã§ã™ã‹ï¼Ÿã€ã®å†…å®¹ã‚’å®Ÿéš›ã«ç¢ºèªã™ã‚‹ãŸã‚ã®JavaScriptãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ 3ã¤ã®é–¢æ•°ã‚’å«ã¿ã€å…¨éƒ¨ã§12è¡Œã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã™ã€‚ /* templ-process.js */ function processTemplate(templ, con) { var a = (templ.replace(/\}/g, '{')).split('{'); for (var i = 0; i < a.length; i++) if (i%2 == 1) a[i] = con(a[i]); // ã‚³ãƒ³ãƒ†ã‚ã‚¹ãƒˆconã¯é–¢æ•° return a.join(''); } function processContext(con1, con2) { return function (k) {return processTemplat
TaKUMA 2010/11/15
lambda

Programming

math

functional

JavaScript

monad
ãƒªãƒ³ã‚¯
æªœå±±æ£å¹¸ã®ã‚ãƒžã‚¤ãƒ©é£¼è‚²è¨˜ - JavaScriptã§å¦ã¶ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒžã®ãŸã‚ã®ãƒ©ãƒ ãƒ€è¨ˆç®—
ã€ŒJavaScriptã«ã‚ˆã‚‹ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆãƒ»ãƒ¢ãƒŠãƒ‰ã€ã™ã£ã’ãƒ¼ç°¡å˜!ã€ã«ã¦ï¼š ç´™ã¨é‰›ç†ã§ãƒ©ãƒ ãƒ€è¨ˆç®—ã‚’å®Ÿè¡Œã§ãã‚‹ã“ã¨ã¯å¿…è¦ã ãªã€ã‚„ã£ã±ã‚Šã€‚ ãªã‚“ã¦å¼·èª¿ã—ãŸã®ã§ã€ãƒ©ãƒ ãƒ€è¨ˆç®—ã®å…¥é–€ã€ã„ã£ã¦ã¿ã‚ˆã†ã€‚ [è¿½è¨˜]ç·´ç¿’å•é¡Œé›†ã‚’è¿½åŠ ã—ã¾ã—ãŸã€‚èª¬æ˜Žã‚’èªã¿ãªãŒã‚‰ã€ã‚ã‚‹ã„ã¯èªã‚“ã å¾Œã§æ˜¯éžã‚„ã£ã¦ã¿ã¦ãã ã•ã„ã€‚â†’ã€ŒJavaScriptã§å¦ã¶ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒžã®ãŸã‚ã®ãƒ©ãƒ ãƒ€è¨ˆç®— å•é¡Œé›†ã€[/è¿½è¨˜] â€»å°åˆ·ã®ã¨ãã¯ã‚µã‚¤ãƒ‰ãƒãƒ¼ãŒæ¶ˆãˆã¾ã™ã€‚ å†…å®¹ï¼š JavaScriptã®é–¢æ•°ãƒªãƒ†ãƒ©ãƒ« ãƒ©ãƒ ãƒ€å¼ã£ã¦ãªã‚“ã ãƒ©ãƒ ãƒ€è¨ˆç®—ã®ä½“ç³»ã¨é©ç”¨æ“ä½œ ãƒ©ãƒ ãƒ€å¼ã®ä¾‹ã‚’ã„ãã¤ã‹ Î²å¤‰æ› -- ãƒ©ãƒ ãƒ€è¨ˆç®—ã®ã‚ãƒ¢ï¼ Î²å¤‰æ›ã‚’ä½•åº¦ã‹å®Ÿè¡Œã—ã¦ã¿ã‚‹ ä¸é–“ã¾ã¨ã‚ã€ã¾ã ç¶šããŒã‚ã‚‹ã‚ˆ JavaScriptã®é–¢æ•°ãƒªãƒ†ãƒ©ãƒ« æœ€åˆã«ã€JavaScriptã«é–¢ã™ã‚‹çŸ¥è˜ã‚’ç¢ºèªã—ã¦ãŠãã¾ã—ã‚‡ã†ã€‚ãªãŠã€JavaScriptã®å¯¾è©±çš„å®Ÿè¡Œç’°å¢ƒã«ã¤ã„ã¦ã¯ã€Œã‚‚ã£ã¨ã‚‚ãŠæ‰‹è»½ãªå¯¾è©±çš„JavaScr
TaKUMA 2010/11/15
JavaScript

lambda

math

Programming

functional
ãƒªãƒ³ã‚¯
ãƒ©ãƒ ãƒ€è¨ˆç®—åŸºç¤Žæ–‡æ³•æœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼ - è²³ä½°ä¼æ‹¾é™¸å¤œæ—¥è¨˜
ãƒ©ãƒ ãƒ€è¨ˆç®—ã¯, å¤šãã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªž, ã¨ãã«é–¢æ•°åž‹è¨€èªžã®åŽŸå½¢ã«ãªã£ã¦ã„ã¾ã™. ãƒ©ãƒ ãƒ€è¨ˆç®—ã«ã¤ã„ã¦ç†è§£ã—ã¦ãŠãã“ã¨ã¯, å¤šãã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®ç¿’å¾—ã«å½¹ç«‹ã¤ã§ã—ã‚‡ã†. ãƒ©ãƒ ãƒ€è¨ˆç®—ã¯ãƒãƒ¥ãƒ¼ãƒªãƒ³ã‚°å®Œå…¨ã§, è¨ˆç®—èƒ½åŠ›ã¨ã—ã¦ã¯ãµã¤ã†ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã¨åŒã˜ã§ã™. ãƒ©ãƒ ãƒ€è¨ˆç®—ã§è¨ˆç®—ã‚’æ›¸ãè¨“ç·´ã‚’ã—ã¦ãŠãã“ã¨ã¯, ä»»æ„ã®è¨ˆç®—ã‚’é–¢æ•°ã®ã¿ã‚’ä½¿ã£ã¦(ä»–ã®åˆ¶å¾¡æ§‹æ–‡ã‚’ç”¨ã„ãšã«)æ›¸ãã¨ãã«å½¹ç«‹ã¡ã¾ã™. ãµã¤ã†ã«æ›¸ã„ãŸã‚‰ç…©é›‘ãªå‡¦ç†ã‚’, é–¢æ•°åž‹è¨€èªžã®ã‚„ã‚Šæ–¹ã§æ›¸ãã¨ã™ã£ãã‚Šã™ã‚‹ã“ã¨ãŒå¤šã€…ã‚ã‚Š, ã‚³ãƒ¼ãƒ‰ã‚’è‡ªç”±è‡ªåœ¨ã«æ›¸ããŸã‚ã«ã¯å¿…é ˆã®è€ƒãˆæ–¹ã¨è¨€ãˆã‚‹ã§ã—ã‚‡ã†. é … ãƒ©ãƒ ãƒ€è¨ˆç®—ã®å¼ã‚’é …(term)ã¨è¨€ã„ã¾ã™. é …ã¯å¤‰æ•°, æŠ½è±¡, é©ç”¨ã®ã„ãšã‚Œã‹ã§ã™. å¤‰æ•° å¤‰æ•°(variable)ã¯ãµã¤ã†1æ–‡å—ã§æ›¸ãã¾ã™. å¤‰æ•°ã«ã¯é–¢æ•°å†…ã®æŸç¸›å¤‰æ•°(bound variable)ã‹è‡ªç”±å¤‰æ•°(free variable)ã‹ã¨ã„ã†åŒºåˆ¥ãŒã‚ã‚Š
TaKUMA 2010/11/15
lambda

functional

Programming

Tutorial

Language

math
ãƒªãƒ³ã‚¯
Î»è¨ˆç®—ã¨ã¯ ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã®äººæ°—ãƒ»æœ€æ–°è¨˜äº‹ã‚’é›†ã‚ã¾ã—ãŸ - ã¯ã¦ãª
ã¾ãšç„¡é™å€‹ã®å¤‰æ•°ãŒä¸Žãˆã‚‰ã‚Œã¦ã„ã‚‹ã¨ã™ã‚‹ã€‚å¤‰æ•°ã¯é€šå¸¸x, yãªã©ã©è¨˜è¿°ã•ã‚Œã‚‹ã€‚å¤‰æ•°ã‹ã‚‰å‡ºç™ºã—ã€æ¬¡ã®æ“ä½œã‚’ç¹°ã‚Šè¿”ã—ã¦å¾—ã‚‰ã‚Œã‚‹ã‚‚ã®ã‚’Î»å¼ã¨å‘¼ã¶ã€‚ Î»æŠ½è±¡ Î»å¼Mã¨å¤‰æ•°xã‹ã‚‰ã€å¼Î»x. Mã‚’ç”Ÿæˆã™ã‚‹æ“ä½œã€‚ã“ã‚Œã¯ã€å¤‰æ•°xã«å¼•æ•°ã‚’å—ã‘å–ã‚Šã€å€¤Mã‚’è¿”ã™é–¢æ•°ã‚’æ„å›³ã™ã‚‹ã€‚Mã«å«ã¾ã‚Œã‚‹å¤‰æ•°xã¯ã“ã®Î»ã«ã‚ˆã‚ŠæŸç¸›ã•ã‚Œã‚‹ã¨ã„ã†ã€‚ãŸã ã—ã€ã™ã§ã«æŸç¸›ã•ã‚Œã¦ã„ã‚‹ã‚‚ã®ã¯é™¤ãã€‚ é–¢æ•°é©ç”¨ äºŒã¤ã®Î»å¼M, Nã‚’ä¸¦ã¹ã¦çµåˆã—ãŸå¼MNã‚’ä½œã‚‹æ“ä½œã€‚ã“ã‚Œã¯å¼MãŒè¡¨ã™é–¢æ•°ã«å¼•æ•°ã¨ã—ã¦Nã‚’ä¸Žãˆã‚‹ã“ã¨ã‚’æ„å›³ã™ã‚‹ã€‚ ã¾ãŸÎ»æŠ½è±¡ã‚„é–¢æ•°é©ç”¨ã®ç¯„å›²ã‚’æ˜Žç¢ºã«ã™ã‚‹ãŸã‚ã«æ‹¬å¼§ã‚’ç”¨ã„ã‚‹ã€‚ ä¾‹: (Î»x. xx)(Î»x. xx),Î»f.(Î»x.(f (x x)) Î»x.(f (x x)))
TaKUMA 2010/11/01
Programming

CS

lambda
ãƒªãƒ³ã‚¯
1