c.l.sã§èå³æ·±ãè°è«ãé²è¡ãã¦ããã®ã§ã¡ã¢ã purely functional Lisp + call/cc = ? çºç«¯ã¯ãNils M Holmã® ãPurely functionalãªãã¤Lispã«call/ccãã¤ãã¦ã¿ããã ã¨ããæ稿ã ããã«å¯¾ããSchemeã®å¤§å¾¡æéãã ãcall/ccã¯ãå¯ä½ç¨ãçãããã ã¨çªã£è¾¼ã¿ãå ¥ãã è¨ãæ¿ããã°ããset!ãªã©ã®æ示çãªå¯ä½ç¨ãªãã¬ã¼ã¿ãä¸åæããªã purely functionalãªLispã«ãcall/ccãå°å ¥ããã¨ãããã¯ãã¯ã purely functionalã§ã¯ãªããªããã¨ãããã¨ã å®ä¾ ããã¯ç°¡åãªä¾ã«ãã£ã¦ç¤ºããã¨ãã§ãããszgygã«ããä¾ï¼ (let ((f (lambda (x) (call/cc (lambda (k) k))))) (cons (f 0) (f 0))) (f 0)ã®2å
{{#tags}}- {{label}}
{{/tags}}