[B! scheme][continuation] ishideoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ishideo id:ishideo

schemeã¨continuationã«é–¢ã™ã‚‹ishideoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (9)

${{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}}

ç¶™ç¶š
ç¶™ç¶šã€continuationã¨æ¥ã‚Œã°ã‚„ã¯ã‚ŠSchemeã®è©±ã«ãªã‚‹ã®ã ã‚ã†ã‹ã€‚ä¸€èˆ¬ç¤¾ä¼šã§ schemeã¨è¨€ãˆã°ã€Œã™ããƒ¼ã‚€ï¼ˆnï¼‰è¨ˆç”»ã€‚é™°è¬€ã€‚ã€ã§ã‚ã‚‹ãŒã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢æ¥ç•Œã§ Schemeã¨è¨€ã£ãŸã‚‰Lispã®ä¸€ç¨®ã®ã“ã¨ã ã€‚Lispã«ã¯å¤‰ç¨®ãŒè…ã‚‹ã»ã©å˜åœ¨ã™ã‚‹ãŒã€ Common Lispã¨ä¸¦ã‚“ã§æœ‰åãªã®ãŒSchemeã§ã‚ã‚‹ã€‚Common LispãŒæ¨™æº–åŒ–ã®èª²ç¨‹ã§ã‚´ãƒ† ã‚´ãƒ†ã¨è£…å‚™ã—ã¦å·¨å¤§åŒ–ã—ãŸã®ã«å¯¾ã—ã€Schemeã¯é¥ã‹ã«ã‚³ãƒ³ãƒ‘ã‚¯ãƒˆã§ã‚¯ãƒªã‚¢ãªä»• æ§˜ã‚’æŒã¤ã€‚ã¾ãŸSchemeã¨ã¯è¨€èªžã®ä¸€èˆ¬åã§ã‚ã‚Šã€ãã®å®Ÿè£…ã«ã¯Gaucheã¨ã‹ scmã¨ã‹guileã¨ã‹MIT Schemeãªã©ãŒã‚ã‚‹ã€‚ ã•ã¦Call/CCã€æ£å¼åç§°Call with Current Continuationã€ã«ã¤ã„ã¦ èª¬æ˜Žã—ã‚ˆã†ã€‚Call/CCã¯ã¡ã‚‡ã£ã¨è¦‹ã¯setjmp/longjmpã¨åŒã˜ã‚ˆã†ã«è¦‹ãˆã‚‹ã®ã ãŒã€ ã‚¹ã‚¿ãƒƒã‚¯ãŒæ·±ããªã‚‹æ–¹å‘ã«ã‚‚ã‚¸ãƒ£
ishideo 2017/08/21
lisp

scheme

continuation

ruby

callcc
ãƒªãƒ³ã‚¯
ishideoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ / 2009å¹´1æœˆ28æ—¥ - ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯
How do we make dynamic web applications? In this tutorial, we show how to use Racket to achieve this goal. We explain how to start up a web server, how to generate dynamic web content, and how to interact with the user. Our working example will be a simple web journalâ€”a â€œblog.â€ This tutorial is intended for students who have read enough of How to Design Programs to know how to use structures, high
ishideo 2010/10/13
scheme

lisp

webapp

dev

PLT-Scheme
ãƒªãƒ³ã‚¯
Pythoné¢¨ã‚¸ã‚§ãƒãƒ¬ãƒ¼ã‚¿ã‚’é™å®šç¶™ç¶šã§ - Homoiconic Days
ã“ã“ã§ã„ã‚ã„ã‚è°è«–ã•ã‚Œã¦ã‚‹ã€call/ccã‚’ä½¿ã£ãŸã‚¸ã‚§ãƒãƒ¬ãƒ¼ã‚¿ã‚’å‹‰å¼·ãŒã¦ã‚‰ã«é™å®šç¶™ç¶šã§æ›¸ãç›´ã—ã¦ã¿ã‚‹ã€‚ãƒˆãƒªãƒƒã‚ãƒ¼ãªéƒ¨åˆ†ãŒãªããªã£ã¦ã€ã‹ãªã‚Šç´ ç›´ã«æ›¸ã‘ã‚‹ã€‚ (define (make-generator f) (let ((cont #f)) (lambda () (reset (if cont (cont #f) (f (lambda (v) (shift k (set! cont k) v)))))))) (define (fib-generator) (make-generator (lambda (yield) (let loop ((a 1) (b 1)) (yield a) (loop b (+ a b)))))) å‹•ä½œã¯ä»¥ä¸‹ã®ã¨ãŠã‚Šã€‚ > (define fib (fib-generator)) > (list (fib) (fib) (fib) (fib) (fib)) (1
ishideo 2009/06/02
scheme

gauche

python

generator

yield

continuation
ãƒªãƒ³ã‚¯
http://wataru.aoisakura.jp/tdiary/?date=20060328
ishideo 2008/09/23
python

lisp

programming

scheme

continuation

cps
ãƒªãƒ³ã‚¯
æœ¬ã‚’èªã‚€ FizzBuzzã¨Gaucheã§å¦ã¶ç¶™ç¶šã®åŸºç¤Ž
å…ˆæ—¥ã¯é…”ã£ãŸå‹¢ã„ã§ã€ŒFizzBuzzã¨Gaucheã§å¦ã¶é…å»¶è©•ä¾¡ã®åŸºç¤Žã®åŸºç¤Žã€ã£ã¦ã‚¨ãƒ³ãƒˆãƒªã‚’æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ä»Šå›žã¯ã€å†ã³é…”ã£ãŸå‹¢ã„ã§ã€åŒã˜ãƒã‚¿ã‹ã‚‰ç¶™ç¶šæ¸¡ã—ã‚¹ã‚¿ã‚¤ãƒ«ï¼ˆCPSï¼šContinuation Passing Styleï¼‰ã«æŒ‘æˆ¦ã—ã¦ã¿ã¾ã™ã€‚ è¨€èªžã¯ä»Šå›žã‚‚Scemeï¼ˆGaucheï¼‰ã§ã™ã€‚ç¶™ç¶šæ¸¡ã—ã‚¹ã‚¿ã‚¤ãƒ«ã®çŸ¥è˜ã¯ã€ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°Gaucheã€ã¨ã€Œã¾ã‚‹ã”ã¨JavaScriptï¼†Ajaxï¼ã€ã®å—ã‘å£²ã‚Šï¼ˆåŠ£åŒ–ã‚³ãƒ”ãƒ¼ï¼‰ã§ã™ã®ã§ã€å‹˜é•ã„ãŒã‚ã£ãŸã‚‰ã”æŒ‡æ‘˜ãã ã•ã„ã€‚ é…å»¶è©•ä¾¡ã¨ç¶™ç¶šæ¸¡ã—ã®æ¯”è¼ƒ é…å»¶è©•ä¾¡ç·¨ã§ã¯ã€ç„¡é™ãƒ«ãƒ¼ãƒ—ã‚’é¿ã‘ã‚‹ãŸã‚ã«é…å»¶è©•ä¾¡ã‚’ä½¿ã„ã¾ã—ãŸã€‚ç„¡é™ãƒ«ãƒ¼ãƒ—ã‚’é¿ã‘ã‚‹ãŸã‚ã®æ–¹æ³•ã¨ã—ã¦ã¯ã€ã»ã‹ã«ã€ç¶™ç¶šæ¸¡ã—ã«ã‚ˆã‚‹å‘¼ã³å‡ºã—ãƒˆãƒ©ãƒ³ãƒãƒªãƒ³ã‚’ä½¿ã£ãŸæ–¹æ³•ãŒã‚ã‚‹ã¿ãŸã„ã§ã™ã€‚ ã¨ã¦ã‚‚ãŠãŠã–ã£ã±ã«ã„ã†ã¨ã€é…å»¶è©•ä¾¡ã¯é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã€ç¶™ç¶šæ¸¡ã—ã¯æ‰‹ç¶šãåž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãªã‚“ã ãã†ã§ã™ã€‚ ã¾ãšæ‰‹ç¶šãåž‹ã£ã½ãæ›¸ã„ã¦ã¿ã‚‹
ishideo 2008/08/20
scheme

gauche

functional

continuation
ãƒªãƒ³ã‚¯
Scheme:ä½¿ã„ãŸã„äººã®ãŸã‚ã®ç¶™ç¶šå…¥é–€
ä½¿ã„ãŸã„äººã®ãŸã‚ã®ç¶™ç¶šå…¥é–€ç¶™ç¶šæ¸¡ã—å½¢å¼call/ccã¯æ™®é€šã®é–¢æ•°call-withç³»é–¢æ•°call-with-procedurecall-with-continuation-procedurecall-with-current-continuationè©•ä¾¡é †åºã¨ç¶™ç¶šcall/ccãƒ‘ã‚ºãƒ«ãŠæ‰‹å…ƒãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰éƒ¨åˆ†ç¶™ç¶šreset/pcã¨call/pcç’°å¢ƒç ´å£Šã¨éƒ¨åˆ†ç¶™ç¶šéƒ¨åˆ†ç¶™ç¶šã®ä½¿ç”¨æ³•PRINT-AND-NEXT-REPLè°è«–è³ªå•ãŠæ‰‹å…ƒãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ã®ã‚µãƒ³ãƒ—ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒ ã«ã¤ã„ã¦ ä½¿ã„ãŸã„äººã®ãŸã‚ã®ç¶™ç¶šå…¥é–€ ã¨ã‚Šã‚ãˆãšæ®´ã‚Šæ›¸ãã€‚ ãã©ã‹ã£ãŸã‚Šå†—é•·ãªæ–‡ç« ã«ãªã£ã¦ãŸã‚Šã€é‡è¤‡ã—ã¦ãŸã‚Šã€é–“é•ã£ã¦ãŸã‚Šã€ ãŠãŠã„ãªã‚‹å‹˜é•ã„ã‚’ã—ã¦ãŸã‚Šã€æ¥ã‚’ã‚«ã„ã¦ãŸã‚Šã™ã‚‹ã‹ã‚‚ã—ã‚Œãªã„ã‘ã©ã”æ„›æ•¬ã€‚ è—ã‚’ã‚‚ã¤ã‹ã¿ãŸã„æ°—æŒã¡ã§ç¶™ç¶šã‚’ä½¿ãˆã‚‹ã‚ˆã†ã«ãªã‚ŠãŸã„äººã¯èªã‚“ã§ã¿ã¦ãã ã•ã„ã€‚ ãŸã ã—æ‰€è©®ã¯è—ã§ã™ã€‚(ï½— ç¶™ç¶šæ¸¡ã—å½¢å¼ ä¾‹ã«ã‚ˆã£ã¦éšŽä¹—fact
ishideo 2007/11/14
scheme

lisp

continuation
ãƒªãƒ³ã‚¯
Practical Scheme
Shiro Kawai ã¾ã ä¸‹æ›¸ã Schemeã®ç‰¹å¾´ã‚’ã‚ã’ã‚‹ã¨ãã«ã€ã€Œç¶™ç¶šã€ã‚„ã€Œcall/ccã€ãŒå‡ºã¦æ¥ãªã„ã“ã¨ã¯ãªã„ã€‚ ã§ã‚‚ã€R5RSã®call/ccã®é …ã‚’ã„ãã‚‰èªã‚“ã§ã‚‚ã€ã©ã†ã‚‚ã‚ˆãã‚ã‹ã‚‰ãªã„ã€‚ call/ccã‚’ä½¿ãˆã°Cè¨€èªžã®breakã¿ãŸã„ãªã®ã¨ã‹ã€ã‚³ãƒ«ãƒ¼ãƒãƒ³ã¨ã‹ã„ã† ã‚¹ãƒ¬ãƒƒãƒ‰ã‚‚ã©ãã¨ã‹ãŒæ›¸ã‘ã‚‹ã€ã¨ã„ã†ã®ã¯ã‚ã‹ã£ãŸã‘ã©ã€ä¸€ä½“ãã†ã„ã†ã®ãŒæ›¸ã‘ã¦ ä½•ãŒå¬‰ã—ã„ã®ã‹ã€ãã“ã‚“ã¨ã“ãŒãƒ”ãƒ³ã¨æ¥ãªã„ã‚“ã ã€‚ ä»Šã€ãã“ã«ã‚ã‚‹ç¶™ç¶š ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ä¸–ç•Œã®æ¦‚å¿µã«ã¯ã€ç¦…ã®å…¬æ¡ˆã®ã‚ˆã†ãªã‚‚ã®ãŒã‚ã‚‹ã€‚ ãã‚Œã‚’èª¬æ˜Žã™ã‚‹æ–‡ç« ã¯ã»ã‚“ã®ä¸€æ–‡ãªã®ã«ã€æœ€åˆã«ç›®ã«ã™ã‚‹æ™‚ã€ ãã®æ–‡ã¯å…¨ãæ„å‘³ã‚’ãªã•ãªã„ã€æš—å·ã®ã‚ˆã†ã«æ„Ÿã˜ã‚‰ã‚Œã‚‹ã€‚ ã ãŒã²ã¨ãŸã³ãã®æ¦‚å¿µã‚’ç†è§£ã™ã‚‹ã¨ã€ ãã®æ¦‚å¿µã®èª¬æ˜Žã¯ç¢ºã‹ã«ãã®ä¸€æ–‡ã§èª¬æ˜Žã•ã‚Œã¦ã„ã‚‹ã®ãŒã‚ã‹ã‚‹ã®ã ã€‚ ãã‚“ãªã€ã€Œåˆ†ã‹ã‚Œã°åˆ†ã‹ã‚‹ã€ã¨ã„ã†ç¦…å•ç”ã®ä¸ã§ã‚‚ ã€Œç¶™ç¶šã€ã¯æœ€ã‚‚è¬Žã‚ã„ãŸã‚‚ã®ã®ä¸€ã¤ã¨è¨€ãˆã‚‹ã ã‚ã†ã€‚ æ–‡çŒ®ã‚’ç´
ishideo 2007/09/16
continuation

scheme
ãƒªãƒ³ã‚¯
ãªã‚“ã§ã‚‚ç¶™ç¶šã€Perl ã§ã€‚ : torus solutions!
æœ€è¿‘ã‚ˆãã‚³ãƒ³ãƒ†ã‚£ãƒ‹ãƒ¥ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãƒ»ãƒ‘ãƒƒã‚·ãƒ³ã‚°ã ã¨ã‹ã€ ç¶™ç¶šãƒ™ãƒ¼ã‚¹ã®â—‹â—‹ã¨ã‹ã€ ãã†ã„ã†è©±é¡Œã‚’è€³ã«ã—ã¾ã™ã€‚ ã§ã‚‚ç¶™ç¶šã£ã¦ã„ã†ã®ãŒä½•ãªã®ã‹è‰¯ãåˆ†ã‹ã‚‰ãªã‹ã£ãŸã®ã§ã€ ãŠæ£æœˆä¼‘ã¿ã« Shiro Kawaiã•ã‚“ã® ãªã‚“ã§ã‚‚ç¶™ç¶š ã‚’èªã‚“ã§ã¿ã¾ã—ãŸã€‚ ä»Šã¾ã§ãšã£ã¨é›£ã—ã„ã ã‚ã†ã¨æ€ã£ã¦èªã‚“ã§ãªã‹ã£ãŸã‚“ã ã‘ã©ã€ ã“ã‚ŒãŒã¾ãŸã¨ã¦ã‚‚åˆ†ã‹ã‚Šã‚„ã™ãã¦é¢ç™½ã‹ã£ãŸã®ã§ã€ é€”ä¸ã«ã‚ã’ã‚‰ã‚Œã¦ã„ãŸã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ã‚’ Perl ã§ã‚‚æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ æ™®é€šã®å†å¸°å½¢å¼ Scheme ã§ã¯ (define (leaf-count tree) (if (pair? tree) (+ (leaf-count (car tree)) (leaf-count (cdr tree))) 1)) Perl ã§ã¯ Perl ã«ã¯ãƒšã‚¢ãŒãªã„ã®ã§ã€ 2 è¦ç´ ã®é…åˆ—ã§ã‚¨ãƒŸãƒ¥ãƒ¬ãƒ¼ãƒˆã™ã‚‹ã“ã¨ã«ã—ã¾ã™ã€‚ ãã‚Œä»¥å¤–ã¯ãã®ã¾ã‚“ã¾ã§ã™ã€‚ sub leaf_count
ishideo 2007/09/16
continuation

perl

scheme
ãƒªãƒ³ã‚¯
Javascriptã§ç¶™ç¶šæ¸¡ã— - ãƒ’ãƒ“ãƒŽã‚ãƒã‚¯
id:nozom:20060317#1142577630ã®ç¶šãã€‚ä¸–ç•Œã§æœ€ã‚‚èª¤è§£ã•ã‚ŒãŸè¨€èªžã¨ã‚‚å‘¼ã°ã‚Œã‚‹Javascriptã‚’ä½¿ã£ã¦ç¶™ç¶šæ¸¡ã—ã‚’æ›¸ã„ã¦ã¿ãŸã€‚ ãªãŠã€Javascriptã®å‡¦ç†ç³»ã¨ã—ã¦Rhino*1ã‚’ä½¿ã£ãŸã€‚å‚è€ƒæ–‡çŒ®ã¯ã€Žå…¥é–€Javascriptã€(ISBN:4756138713)ã€‚ function fib(n) { if ((n == 1) || (n == 2)) return 1; else return fib(n - 1) + fib(n - 2); } function fib_cps(n, k) { if ((n == 1) || (n == 2)) return k(1); else return fib_cps(n - 1, function(v1) { return fib_cps(n - 2, function(v2) { return k(v1 + v2);
ishideo 2007/07/20
javascript

lisp

programming

scheme

continuation

cps
ãƒªãƒ³ã‚¯
1