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

mooz id:mooz

schemeã«é–¢ã™ã‚‹moozã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (30)

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

Island Life - ãƒãƒ¼ã‚«ãƒ«ã‚¹ã‚³ãƒ¼ãƒ—å†…ã‹ã‚‰ã‚°ãƒãƒ¼ãƒãƒ«å®šç¾©
About å—ã®å³¶ã®ãƒ—ãƒã‚°ãƒ©ãƒžã€‚ ãŸã¾ã«å½¹è€…ã€‚ Practical Schemeã®ä¸»ã€‚ WiLiKi:Shiro æœ€è¿‘ã®ã‚¨ãƒ³ãƒˆãƒª ç±³å›½ã®å¤§å¦é€²å¦ç„¡é™cxré«˜æ ¡å—é¨“DefenseæŒ¯ã‚Šè¿”ã£ã¦ã¿ã‚‹ã¨2019å¹´ã¯è‰²ã€…å¦ã‚“ã§æ¥½...è¦šãˆã‚‹ã‚ˆã‚Šå¿˜ã‚Œã‚‹æ–¹ãŒé›£ã—ã„(ã“ã¨ã‚‚ã‚ã‚‹)çœ¼é¡ã®ã¤ã‚‹ã¨3Dãƒ—ãƒªãƒ³ã‚¿Iris Klein Acting ClassSAG-AFTRA conservatory: Voice Actingå‰µä½œæ´»å‹•ã£ã¦è‡ªåˆ†ã‚’æ™’ã‘å‡ºã•ãã°ãªã‚‰ãªã„ã¨...More... æœ€è¿‘ã®ã‚³ãƒ¡ãƒ³ãƒˆ shiro on æ³ã‚’å–ã‚‹ã¨æ™‚é–“ãŒé€ŸãéŽãŽã‚‹ã®ã¯ã€æ–°ã—ã„ã“ã¨ã«æŒ‘æˆ¦ã—ãªã„ã‹ã‚‰? (2023/03/14)1357 on æ³ã‚’å–ã‚‹ã¨æ™‚é–“ãŒé€ŸãéŽãŽã‚‹ã®ã¯ã€æ–°ã—ã„ã“ã¨ã«æŒ‘æˆ¦ã—ãªã„ã‹ã‚‰? (2023/03/01)ãƒ™ã‚¢ãƒˆãƒªãƒ¼ãƒã‚§ on ãƒã‚¤ãƒãƒã‚¤ãƒãƒã‚¤ãƒã®ã‚·ãƒ¥ãƒ¼ãƒªãƒ³ã‚¬ãƒ³ (2022/04/02)ãƒ™ã‚¢ãƒˆãƒªãƒ¼ãƒã‚§ on ãƒã‚¤ãƒãƒ
mooz 2012/12/08
"Schemeã¯Common Lispã‚ˆã‚Šã‚‚å°‘ã—é™çš„å¯„ã‚Šã§ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œé–‹å§‹æ™‚ã¾ã§ã«ãƒˆãƒƒãƒ—ãƒ¬ãƒ™ãƒ«æŸç¸›ãŒãªã‚‹ã¹ãæ±ºã¾ã£ã¦ã„ã¦æ¬²ã—ã„ã¨æ€ã†å‚¾å‘ãŒã‚ã‚‹"

scheme

cl
ãƒªãƒ³ã‚¯
GitHub - AlexNisnevich/ECMAchine: Lisp-based in-browser toy operating system
ECMAchine is an in-browser Scheme REPL that is also a toy operating system. It has a virtual filesystem that is accessed through Unix-like commands, as well as a rudimentary process management system. Why? I made ECMAchine for a few reasons. For one, it's an interesting experiment in what a filesystem based around S-expressions could look like. It was also a good exercise in writing an interpreter
mooz 2012/04/09
JavaScript ã«ã‚ˆã‚‹ Scheme å®Ÿè£… + OS æ©Ÿèƒ½ï¼Ž

ECMAScript

scheme
ãƒªãƒ³ã‚¯
ãªãœ JavaScripter ãŒ Schemer ã«ãªã£ãŸã‹ - (new Hatena).blog()
ä»¥å‰ã¯ JavaScript ã®ã“ã¨ã°ã‹ã‚Šæ›¸ã„ã¦ã„ãŸã®ãŒä¿¡ã˜ã‚‰ã‚Œãªã„ãã‚‰ã„ã€Scheme ã®ã“ã¨ã°ã‹ã‚Šæ›¸ã„ã¦ã„ã‚‹ã“ã¨ã«ã¤ã„ã¦ã®èª¬æ˜Žæ–‡ã§ã™ã€‚ ãƒ›ãƒƒãƒ— å½“ãƒ€ã‚¤ã‚¢ãƒªãƒ¼ã®ã‚¿ã‚¤ãƒˆãƒ«ã‹ã‚‰ã‚‚ãŠåˆ†ã‹ã‚Šã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ãŒã€ç§ã¯å…ƒã€… JavaScript ã«ã¤ã„ã¦æ›¸ããŸããªã£ã¦ã€ãƒ–ãƒã‚°ã¨ã„ã†ã‚‚ã®ã‚’å§‹ã‚ã¾ã—ãŸ (ã¤ã„ã§ã«è¨€ã†ã¨ã€ã¯ã¦ãªã®ã‚¢ã‚«ã‚¦ãƒ³ãƒˆã‚’å–ã£ãŸæ™‚ç‚¹ã§ã¯ãã‚“ãªã¤ã‚‚ã‚Šã¯1ãƒŸãƒªã‚‚æœ‰ã‚Šã¾ã›ã‚“ã§ã—ãŸ)ã€‚ ã¡ã‚‡ã†ã©ä¸–ç•Œçš„ã« JavaScript ã®çœŸä¾¡ãŒç†è§£ã•ã‚Œã‚‹ã‚ˆã†ã«ãªã£ãŸæ™‚æœŸã§ã‚‚ã‚ã‚Šã€å€‹äººçš„ã«ã¯ Ruby ã®ã‚¯ãƒ©ã‚¹ãƒ»ã‚·ã‚¹ãƒ†ãƒ ã‚’ JavaScript ã§æ¨¡å€£ã™ã‚‹ã¨ã„ã†ãƒ†ãƒ¼ãƒžã«èˆˆå‘³ã‚’æŒã£ã¦è‰²ã€…ã¨å®Ÿé¨“ã‚’ã—ãŸã‚‚ã®ã§ã™ã€‚ ãã‚Œã‹ã‚‰ã€LDR ã¨ã®å‡ºä¼šã„ã¨ã„ã†å¤§ããªçµŒé¨“ã‚‚ã‚ã‚Šã¾ã—ãŸã€‚ãƒ—ãƒã‚°ãƒ©ãƒ ã®ä¸–ç•Œã«æ·±ãæ²ˆæ½œã™ã‚‹ã‚ˆã†ãªãƒªãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ä½“é¨“ã‚’ã—ãŸã®ã¯ã€ã“ã®æ™‚ãŒåˆã‚ã¦ã ã£ãŸã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ãã‚Œã¾ã§è€ƒãˆã‚‚ã—ãªã‹ã£ãŸã‚ˆã†ãªç™ºæƒ³ã‚„æŠ€è¡“ã«æº¢
mooz 2010/12/16
scheme
ãƒªãƒ³ã‚¯
éƒ¨åˆ†ç¶™ç¶šã«ã¤ã„ã¦æœ¬æ°—å‡ºã—ã¦è€ƒãˆã¦ã¿ãŸ - (new Hatena).blog()
ä»¥å‰ä½•åº¦ã‹éƒ¨åˆ†ç¶™ç¶šã«ã¤ã„ã¦æ›¸ã„ãŸã“ã¨ãŒã‚ã‚‹ã‚“ã§ã™ãŒã€å½“æ™‚ã¯è¡¨é¢çš„ãªæŒ¯ã‚‹èˆžã„ã‚’è¦³å¯Ÿã—ã¦ä½•ã¨ãªãåˆ†ã‹ã£ãŸæ°—ã«ãªã£ãŸç¨‹åº¦ã®æ‹™ã„èª¬æ˜Žã—ã‹å‡ºæ¥ã¾ã›ã‚“ã§ã—ãŸã€‚ ãã®ä¸Šã€æœ€è¿‘ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã‚‚ã»ã¨ã‚“ã©æ´»ç”¨ã—ã¦ãŠã‚‰ãšã€æ”¹ã‚ã¦ç†è§£ã—ç›´ã™å¿…è¦ã‚’æ„Ÿã˜ã¦ããŸæ¬¡ç¬¬ã§ã™ã€‚ ãã“ã§ä»Šå›žã¯ã€éƒ¨åˆ†ç¶™ç¶šã®æ¦‚å¿µçš„ãªç†è§£ã‚’ç›®æŒ‡ã—ã€åŸºç¤Žçš„ãªäº‹æŸ„ã‚’ä¸å¿ƒã«ã¾ã¨ã‚ã¦ã„ããŸã„ã¨æ€ã„ã¾ã™ã€‚ åŸºæœ¬çš„ã« PLT Scheme (MzScheme) ã®è©•ä¾¡ãƒ¢ãƒ‡ãƒ«ã«å³ã—ã¦æ›¸ã„ã¦ã„ããŸã‚ã€Scheme ä¸€èˆ¬ã«å½“ã¦ã¯ã¾ã‚‹è©±ã«ãªã£ã¦ã„ãªã„éƒ¨åˆ†ã‚‚ã‚ã‚‹ã‹ã‚‚çŸ¥ã‚Œã¾ã›ã‚“ã€‚ãã®ç‚¹ã”äº†æ‰¿ãã ã•ã„ã€‚ Redex ã¨ç¶™ç¶š Scheme ã®è©•ä¾¡ãƒ¢ãƒ‡ãƒ«ã«ãŠã„ã¦ã€ (+ 1 (+ 2 0))ã¨ã„ã†å¼ã‚’è©•ä¾¡ã™ã‚‹ã¨ãã€ã¾ãš (+ 2 0)ã®éƒ¨åˆ†ãŒè©•ä¾¡ã•ã‚Œã€ãã®çµæžœã®å€¤ã«å¯¾ã—ã¦ (+ 1 [])ã¨ã„ã†æ®‹ã‚Šã®è¨ˆç®—ãŒè¡Œã‚ã‚Œã¾ã™ã€‚ ã“ã“ã§è§’æ‹¬å¼§ã§ç¤ºã—ãŸéƒ¨åˆ†ã‚’ reducible exp
mooz 2010/12/16
è„±å‡ºã®èµ·ã“ã‚‹ continuation, è„±å‡ºã®èµ·ã“ã‚‰ãªã„ composable continuation.

scheme
ãƒªãƒ³ã‚¯
SRFI 26: Notation for Specializing Parameters without Currying
by Sebastian Egner Status This SRFI is currently in final status. Here is an explanation of each status that a SRFI can hold. To provide input on this SRFI, please send em ail to [email protected]emers.org. To subscribe to the list, follow these instructions. You can access previous messages via the mailing list archive. Draft: 2002-02-06--2002-04-06 Revised: 2002-02-15 Revised: 2002-02-28 Rev
mooz 2010/11/07
cut / cute

scheme
ãƒªãƒ³ã‚¯
ä¾¿åˆ©ãã†ãªãƒžã‚¯ãƒã‚’é›†ã‚ã‚‹æ—…ã€‚é€”ä¸çµŒéŽ - podhmoã®æ—¥è¨˜
æ—…ã‚’ã—ã¦ã„ã¾ã™ã€‚é€”ä¸çµŒéŽã¯gistã§ ã¯ã˜ã‚ã« elispã¯ä¾¿åˆ©ãªæ©Ÿèƒ½ãŒãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã§ã¤ã‹ãˆãªã„ã“ã¨ãŒå¤šã„ã§ã™ã€‚clç”±æ¥ã®ä¾¿åˆ©ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒä½¿ãˆã¾ã›ã‚“ã€‚(require 'cl)ã‚’ã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ãã‚Œè‡ªä½“ã¯eval-when-compileã§å›²ã‚ã°è‰¯ã„ã®ã§å•é¡Œãªã„ã§ã™ã€‚elispã¯åå‰ã®è¡çªã‚’é¿ã‘ã‚‹ä»•çµ„ã¿(e.g. åå‰ç©ºé–“)ãŒç”¨æ„ã•ã‚Œã¦ã„ã¾ã›ã‚“ã€‚ãã‚“ãªã‚ã‘ã§ã€è‡ªå‰ã®æ‹¡å¼µã‚’ä½œæˆã™ã‚‹ã¨ãã«å„è‡ªã§é‡è¤‡ã™ã‚‹ã‚ˆã†ãªãƒžã‚¯ãƒãŒå®šç¾©ã•ã‚Œã¦ã¾ã™ã€‚onlispç”±æ¥ã®ãƒžã‚¯ãƒãªã©ã‚’è‰¯ãè¦‹ã‹ã‘ã¾ã™(ã¨ãã«aifã‚’è‰¯ãè¦‹ã‹ã‘ã‚‹)ã€‚ ä»Šå›žã®ç›®çš„ã¯2ã¤ã‚ã‚Šã¾ã™ã€‚ å„è‡ªãŒå€‹åˆ¥ã«å®šç¾©ã—ã¦ããŸä¾¿åˆ©ãƒžã‚¯ãƒã‚’é›†ã‚ã¦ã¿ã‚‹ã¨ã©ã®ç¨‹åº¦ã®è¦æ¨¡ã«ãªã‚‹ã®ã‹çŸ¥ã‚ŠãŸã„ã€‚ è‡ªåˆ†ç”¨ã®ä¾¿åˆ©ãªãƒžã‚¯ãƒã‚’é›†ã‚ãŸãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒæ¬²ã—ã„ã€‚ ã¨ã‚Šã‚ãˆãšã€ä¾¿åˆ©ã ãªã¨æ€ã†ãƒžã‚¯ãƒã‚’è¿½åŠ ã—ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸã€‚util-macro.elã¨ã„ã†ãƒ•ã‚¡ã‚¤ãƒ«ãŒãã‚Œã§ã™ã€‚ è¿½åŠ ã—ãŸãƒž
mooz 2010/11/03
elisp

scheme
ãƒªãƒ³ã‚¯
Route 477(2010-05-24)
â– [lisp][scheme] ç¤¾å†…å‹‰å¼·ä¼šã§Lispæ¦‚è«–çš„ãªè©±ã‚’ã—ãŸ (ä»¥ä¸‹ã€ã‚ã‚Šã¨é©å½“ãªè³‡æ–™) Lispã¨ã„ãˆã°ï¼Ÿ æœ€åˆã®å‹•çš„è¨€èªž æœ€åˆã®GCä»˜ãå‡¦ç†ç³» äººå·¥çŸ¥èƒ½ç ”ç©¶ã®è¨€èªžã¨ã—ã¦æ´»èº æ‹¬å¼§ ãƒžã‚¯ãƒ 1957å¹´ FORTRAN 1958å¹´ ALGOL58, LISP 1960å¹´ COBOL 1964å¹´ BASIC LISPæˆ¦å›½æ™‚ä»£ æ–¹è¨€ã®ä¹±ç«‹ LISPäºŒå¤§æ”¿å…šæ™‚ä»£ Common Lisp (1984-) æ–¹è¨€ã®çµ±ä¸€ æ¨™æº–è¦æ ¼ãŒå˜åœ¨ (ANSI CL) http://www.lispworks.com/documentation/HyperSpec/Front/Contents.htm SBCL, Clisp, Allegro CL(å•†ç”¨), ... LISP-2 tã¨nil ãƒžãƒ«ãƒãƒ‘ãƒ©ãƒ€ã‚¤ãƒ ã€ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã€ãƒªãƒ¼ãƒ€ãƒžã‚¯ãƒã€ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã€CLOS Scheme (1975-) ãƒŸãƒ‹ãƒžãƒªã‚ºãƒ å‡¦ç†
mooz 2010/05/26
åè‘—ã«ã—ã¦ç©ã‚“èª. åè‘—ã«ã—ã¦éˆå™¨. ã„ã¤ã‹ S å¼ã§ã‚³ãƒŸãƒ¥ãƒ‹ã‚±ãƒ¼ã‚·ãƒ§ãƒ³ãŒå–ã‚Œã‚‹ã‚ˆã†ã«ãªã‚ŠãŸã„.

lisp

scheme
ãƒªãƒ³ã‚¯
Lisp/Scheme Interpreter & Compiler
ã‚ˆã†ã‚„ãLOL(LET OVER LAMBDA Edition 1.0)ã‚’èªäº†ã—ãŸä»Šæ—¥ã“ã®é ƒã§ã™ã€‚ã‚ã‹ã‚‰ãªã„ã“ã¨ã ã‚‰ã‘ã§ã™ã€‚7ç« ã®Forthã‚’å®Ÿè£…ã™ã‚‹ã¨ã“ã‚ã‹ã‚‰æ›¸ã„ã¦ã¿ã‚ˆã†ã¨æ€ã£ã¦ã„ã¾ã™ã€‚ æœ¬é¡ŒãŸã ã®ãƒ¡ãƒ¢ã§ã™ã€‚ æœ€è¿‘ã€ä¸€æ—¥ã®ã†ã¡ã«ä½•åº¦ã‚‚ã€ŒPCã‚’é–‹ãã«ã‚‚æœ¬ã‚’é–‹ãã«ã‚‚ä¸é€”åŠç«¯ãªæ™‚é–“ã€ãŒå¤šãç™ºç”Ÿã™ã‚‹ã®ã§ã€æºå¸¯ã§2chã‚’è¦‹ã¦ã¾ã™ã€‚ ã€SICPã€‘è¨ˆç®—æ©Ÿãƒ—ãƒã‚°ãƒ©ãƒ ã®æ§‹é€ ã¨è§£é‡ˆ Part2 99 ï¼šãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã®åç„¡ã—ã•ã‚“ï¼š2008/02/18(æœˆ) 22:30:16 >>94 > Essentials of Programming Languages > 71. Continuation Passing Interpreterã§ã€‚ 3ç« ãŒenvironment passing interpreterã§ã€ 7.3ãŒimperative interpregerã€‚ Reflection http://libr
mooz 2010/04/28
Lisp, Scheme å‡¦ç†ç³»ã®å®Ÿè£…ã«ã¤ã„ã¦ã¾ã¨ã‚.

lisp

scheme
ãƒªãƒ³ã‚¯
Tumblr
Tumblr is a place to express yourself, discover yourself, and bond over the stuff you love. It's where your interests connect you with your people.
mooz 2010/04/27
Common Lisp ã®ãƒžã‚¯ãƒ

cl

scheme
ãƒªãƒ³ã‚¯
Schemeã®ãƒžã‚¯ãƒ - Island Life
About å—ã®å³¶ã®ãƒ—ãƒã‚°ãƒ©ãƒžã€‚ ãŸã¾ã«å½¹è€…ã€‚ Practical Schemeã®ä¸»ã€‚ WiLiKi:Shiro æœ€è¿‘ã®ã‚¨ãƒ³ãƒˆãƒª ç„¡é™cxré«˜æ ¡å—é¨“DefenseæŒ¯ã‚Šè¿”ã£ã¦ã¿ã‚‹ã¨2019å¹´ã¯è‰²ã€…å¦ã‚“ã§æ¥½...è¦šãˆã‚‹ã‚ˆã‚Šå¿˜ã‚Œã‚‹æ–¹ãŒé›£ã—ã„(ã“ã¨ã‚‚ã‚ã‚‹)çœ¼é¡ã®ã¤ã‚‹ã¨3Dãƒ—ãƒªãƒ³ã‚¿Iris Klein Acting ClassSAG-AFTRA conservatory: Voice Actingå‰µä½œæ´»å‹•ã£ã¦è‡ªåˆ†ã‚’æ™’ã‘å‡ºã•ãã°ãªã‚‰ãªã„ã¨...ãƒ«ãƒ¼ãƒ—ã‚’ä½¿ã‚ãšã«1ã‹ã‚‰100ã¾ã§More... æœ€è¿‘ã®ã‚³ãƒ¡ãƒ³ãƒˆ shiro on æ³ã‚’å–ã‚‹ã¨æ™‚é–“ãŒé€ŸãéŽãŽã‚‹ã®ã¯ã€æ–°ã—ã„ã“ã¨ã«æŒ‘æˆ¦ã—ãªã„ã‹ã‚‰? (2023/03/14)1357 on æ³ã‚’å–ã‚‹ã¨æ™‚é–“ãŒé€ŸãéŽãŽã‚‹ã®ã¯ã€æ–°ã—ã„ã“ã¨ã«æŒ‘æˆ¦ã—ãªã„ã‹ã‚‰? (2023/03/01)ãƒ™ã‚¢ãƒˆãƒªãƒ¼ãƒã‚§ on ãƒã‚¤ãƒãƒã‚¤ãƒãƒã‚¤ãƒã®ã‚·ãƒ¥ãƒ¼ãƒªãƒ³ã‚¬ãƒ³ (2022/04/02)ãƒ™ã‚¢ãƒˆãƒªãƒ¼ãƒ
mooz 2010/04/27
Scheme, Common Lisp ã®ãƒžã‚¯ãƒ.

scheme

cl
ãƒªãƒ³ã‚¯
How to implement continuations?
I'm working on a Scheme interpreter written in C. Currently it uses the C runtime stack as its own stack, which is presenting a minor probl em with implementing continuations. My current solution is manual copying of the C stack to the heap then copying it back when needed. Aside from not being standard C, this solution is hardly ideal. What is the simplest way to implement continuations for Scheme
mooz 2010/04/26
ç¶™ç¶šã®å®Ÿè£…

scheme
ãƒªãƒ³ã‚¯
Karetta|ç¶™ç¶šæ¸¡ã—ã‚¹ã‚¿ã‚¤ãƒ«
mooz 2010/04/21
ç¶™ç¶š call/cc ã‚’å®Ÿéš›ã«ä½¿ã£ã¦ã¿ã‚‹

scheme
ãƒªãƒ³ã‚¯
azito.com
This domain may be for sale!
mooz 2010/04/21
ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã«ã¤ã„ã¦.

scala

scheme

ruby
ãƒªãƒ³ã‚¯
Lisp: Common Lisp, Racket, Clojure, Emacs Lisp - Hyperpolyglot
ca side-by-side reference sheet grammar and execution | variables and expressions | arithmetic and logic | strings | regular expressions | dates and time | lists | fixed-length arrays | dictionaries | user-defined types | functions | execution control | exceptions | streams | emacs buffers | files | directories | processes and environment | libraries and namespaces | objects | lisp mac ros | reflec
mooz 2010/04/19
Common Lisp, Scheme, Clojure, Elisp ã®é–¢æ•°å¯¾å¿œè¡¨. æœ€é«˜.

lisp

clojure

scheme
ãƒªãƒ³ã‚¯
Greenbear Diary - call/ccã®7ã¤ã®å…¸åž‹çš„ãªä½¿ã„æ–¹
â– [scheme][ruby] call/ccã®7ã¤ã®å…¸åž‹çš„ãªä½¿ã„æ–¹ ã‚ã ã°ã•ã‚“(ã§ã„ã„ã®ã‹ãª?)ã®ã¨ã“ã‚ã§ç´¹ä»‹ã•ã‚Œã¦ã„ãŸCall with Current Continuation Patternsã‚’ã¡ã‚‡ã£ã¨è¦‹ã¦ã¿ãŸã€‚ 7/26 ç¬¬9å›ž æ…¢æ€§çš„CLå‹‰å¼·ä¼š@Lingr 8æ™‚ã ãƒ§!å…¨å“¡é›†åˆã¾ã¨ã‚ - ã‚ã ã°Lisperã«ãªã‚‹ - cadrã‚°ãƒ«ãƒ¼ãƒ— ãã‚Œã«ã‚ˆã‚‹ã¨ã€callccã®å…¸åž‹çš„ãªä½¿ã„æ–¹ã«ã¯ä»¥ä¸‹ã®ã‚ˆã†ãªã‚‚ã®ãŒã‚ã‚‹ã‚‰ã—ã„ã€‚ (ç„¡é™)ãƒ«ãƒ¼ãƒ—ã‹ã‚‰ã®è„±å‡º å†å¸°ã‹ã‚‰ã®è„±å‡º Cã§ã„ã†continue è„±å‡ºï¼‹å†å…¥ ã‚³ãƒ«ãƒ¼ãƒãƒ³ non-blindãª(??)ãƒãƒƒã‚¯ãƒˆãƒ©ãƒƒã‚ãƒ³ã‚° ãƒžãƒ«ãƒã‚¿ã‚¹ã‚¯ ã§ã€ã ã€‚ 1, 2, 3ã¯ã€breakã¨ã‹continueãŒã‚ã‚‹è¨€èªžãªã‚‰æ™®é€šã«ã§ãã‚‹ã€‚ 5ã‚„4ã®ä¸€éƒ¨ã¯ã€Pythonã®ã‚¸ã‚§ãƒãƒ¬ãƒ¼ã‚¿ã¨ã‹Ruby1.9ã®Fiberã§ã§ãã‚‹ã€‚ 7ã¯ã‚³ãƒ«ãƒ¼ãƒãƒ³ã‚„ã‚¹ãƒ¬ãƒƒãƒ‰ã‚’ä½¿ãˆã°ã§ãã‚‹ã€‚ ã¨ãª
mooz 2010/04/11
call/cc ã®ä½¿ç”¨ä¾‹. Fiber, Generator.

scheme

ruby
ãƒªãƒ³ã‚¯
Scheme:ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚¿ã‚¤ãƒ«
koguroã•ã‚“ã®ã¨ã“ã§å‡ºãŸè©±é¡Œ ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚¿ã‚¤ãƒ«ifã®beginæ‹¬å¼§ã®ä½ç½®letå¼ifå¼é–¢æ•°å®šç¾©é–¢æ•°ã®ã‚µã‚¤ã‚ºç·¨é›†ç’°å¢ƒæ‹¬å¼§ã‚’æ›¸ãã‚¿ã‚¤ãƒŸãƒ³ã‚°emacsã®ã‚ãƒ¼ãƒã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°æ‹¬å¼§æŒ¿å…¥ã®ã‚ãƒ¼ãƒã‚¤ãƒ³ãƒ‰å…¨ä½“çš„ãªã‚³ãƒ¡ãƒ³ãƒˆã¯ã“ã¡ã‚‰ ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚¿ã‚¤ãƒ« ã¿ãªã•ã‚“ã©ã‚“ãªé¢¨ã« Scheme ã®ã‚½ãƒ¼ã‚¹ã‚’æ›¸ã‹ã‚Œã¦ã„ã‚‹ã®ã§ã—ã‚‡ã†ã‹ã€‚ ä»–ã®äººã®ã‚½ãƒ¼ã‚¹ã‚’å‚è€ƒã«ã—ã¦ã„ã‚‹ã®ã§ã™ãŒã€ã©ã“ã‹ã«æ˜Žæ–‡åŒ–ã•ã‚ŒãŸã‚‚ã®ãŒã‚ã‚‹ã¨ã†ã‚Œã—ã„ã§ã™ã€‚(C ã¿ãŸã„ã« K&R ã¨ã‹ whitesmith ã¨ã‹ã„ã‚ã„ã‚æµæ´¾ãŒã‚ã‚‹ã®ã§ã—ã‚‡ã†ã‹) ã¨ã‚Šã‚ãˆãšã€ãƒãƒªã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ãŒå‡ºã‚‹è¦ç´ ã‚’ä¸Šã’ã¦ã„ã£ã¦ã¿ã¾ã—ã‚‡ã€‚Shiro é–¢é€£ï¼šLisp:ã‚³ãƒ¡ãƒ³ãƒˆ ifã®begin ã‚‚ã—Cè¨€èªžã§if (...) { ã‚’ if (...) (begin ã¨æ›¸ã‘ã¨ã„ã‚ã‚ŒãŸã‚‰ã†ã‚“ã–ã‚Šã™ã‚‹ã§ã—ã‚‡ã†ã€‚ Cè¨€èªžã®switchæ–‡ã«break;ã‚’æ›¸ã„ã¦ã„ã‚‹ã‚ˆã†ãªæ°—åˆ†ã«ãªã‚Šã¾ã™ã€‚(gemma
mooz 2010/03/21
scheme, lisp ç³»ã®ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚¿ã‚¤ãƒ«. é–‰ã˜æ‹¬å¼§ã¯ã¾ã¨ã‚ã‚Œã°è‰¯ã„ã¨ã„ã†ã‚‚ã®ã§ã‚‚ãªã„.

scheme

lisp
ãƒªãƒ³ã‚¯
Island Life - è¨€èªžã®å¼·ã¿
About å—ã®å³¶ã®ãƒ—ãƒã‚°ãƒ©ãƒžã€‚ ãŸã¾ã«å½¹è€…ã€‚ Practical Schemeã®ä¸»ã€‚ WiLiKi:Shiro æœ€è¿‘ã®ã‚¨ãƒ³ãƒˆãƒª ç±³å›½ã®å¤§å¦é€²å¦ç„¡é™cxré«˜æ ¡å—é¨“DefenseæŒ¯ã‚Šè¿”ã£ã¦ã¿ã‚‹ã¨2019å¹´ã¯è‰²ã€…å¦ã‚“ã§æ¥½...è¦šãˆã‚‹ã‚ˆã‚Šå¿˜ã‚Œã‚‹æ–¹ãŒé›£ã—ã„(ã“ã¨ã‚‚ã‚ã‚‹)çœ¼é¡ã®ã¤ã‚‹ã¨3Dãƒ—ãƒªãƒ³ã‚¿Iris Klein Acting ClassSAG-AFTRA conservatory: Voice Actingå‰µä½œæ´»å‹•ã£ã¦è‡ªåˆ†ã‚’æ™’ã‘å‡ºã•ãã°ãªã‚‰ãªã„ã¨...More... æœ€è¿‘ã®ã‚³ãƒ¡ãƒ³ãƒˆ shiro on æ³ã‚’å–ã‚‹ã¨æ™‚é–“ãŒé€ŸãéŽãŽã‚‹ã®ã¯ã€æ–°ã—ã„ã“ã¨ã«æŒ‘æˆ¦ã—ãªã„ã‹ã‚‰? (2023/03/14)1357 on æ³ã‚’å–ã‚‹ã¨æ™‚é–“ãŒé€ŸãéŽãŽã‚‹ã®ã¯ã€æ–°ã—ã„ã“ã¨ã«æŒ‘æˆ¦ã—ãªã„ã‹ã‚‰? (2023/03/01)ãƒ™ã‚¢ãƒˆãƒªãƒ¼ãƒã‚§ on ãƒã‚¤ãƒãƒã‚¤ãƒãƒã‚¤ãƒã®ã‚·ãƒ¥ãƒ¼ãƒªãƒ³ã‚¬ãƒ³ (2022/04/02)ãƒ™ã‚¢ãƒˆãƒªãƒ¼ãƒã‚§ on ãƒã‚¤ãƒãƒ
mooz 2010/03/17
lisp

scheme

è¨€èªž
ãƒªãƒ³ã‚¯
call/cc å…¥é–€ (Coroutine with call/cc) - MAYAH
call/cc ã‚’ä½¿ã£ã¦ç°¡å˜ãª Coroutine ã‚’ä½œã‚Šã¾ã™ã€‚call/cc å…¥é–€ã ã¨æ€ã£ã¦ã‚‚ã‚‰ãˆã‚Œã°å¹¸ã„ã§ã™ã€‚ coroutine ã¨ã¯ ã“ã“ã§ã¯ coroutine ã‚’ã€Œå®Ÿè¡Œã®é€”ä¸ã§ãƒªã‚¿ãƒ¼ãƒ³ã§ãã€ã•ã‚‰ã«ãã“(å®Ÿè¡Œã®é€”ä¸)ã‹ã‚‰å†é–‹ã™ã‚‹ã“ã¨ãŒå‡ºæ¥ã‚‹ä½•ã‹ã€ã®æ„å‘³ã§ä½¿ç”¨ã—ã¾ã™ã€‚é©å½“ãªç–‘ä¼¼è¨€èªžã§æ›¸ãã¨æ¬¡ã®é€šã‚Šã€‚é–¢æ•°ã®é€”ä¸ã§ã®ãƒªã‚¿ãƒ¼ãƒ³ã‚’ suspend(), é€”ä¸ã‹ã‚‰ã®å†é–‹ã‚’ resume() ã§è¡¨ã™ã“ã¨ã«ã—ã¾ã™ã€‚ ã“ã“ã§ã¯ã€ã“ã‚Œã‚’ scheme ã® call/cc ã‚’ç”¨ã„ã¦è¡¨ã™ã“ã¨ã‚’ç›®æŒ‡ã—ã¾ã™ã€‚ call/cc ã¨ã¯ call/cc ã¨ã¯ã€call-with-current-continuation ã¨ã„ã† scheme ã®é–¢æ•°ã§ã€ã€Œç¾åœ¨ã®ç¶™ç¶š(current continuation)ã‚’ç”Ÿæˆã—ã€ãã‚Œã‚’é–¢æ•°ã«æ¸¡ã—ã¦ãã®é–¢æ•°ã‚’å®Ÿè¡Œã™ã‚‹ã€ã‚‚ã®ã§ã™ã€‚èªè€…ã®æ®†ã©ã¯ã€Œç¶™ç¶šã€ã«ã¤ã„ã¦ã‚ˆãçŸ¥ã£ã¦ã„ã‚‹ã‹ã‚‚ã—ã‚Œ
mooz 2010/03/08
call-with-current-continuation : call/cc

scheme
ãƒªãƒ³ã‚¯
jsscheme test
Tiny Scheme implementation with javascript description è¨€èªžé–‹ç™ºåˆå®¿ã§ä½œæˆã—ãŸã€Scheme(çš„ãªã‚‚ã®)ã®javascriptå®Ÿè£…ã§ã™ã€‚ ç¶™ç¶šã¨æœ«å°¾å†å¸°æœ€é©åŒ–ã¾ã§å®Ÿè£…ã—ã¾ã—ãŸã€‚ç¶™ç¶šã®ã»ã†ã¯æœ¬å½“ã«ä»•æ§˜ã‚’æº€è¶³ã—ã¦ã„ã‚‹ã‹ã©ã†ã‹ä¸å®‰ã§ã™ãŒã€‚ ãƒžã‚¯ãƒã¯ã€ã‚ã‚Šã¾ã›ã‚“ è©³ã—ã„èª¬æ˜Žã¯blogã®ã»ã†ã«ã€‚ features parse SExpr variable reference create/call closure tail-call optimization continuation quote ('expr) , dotted pair( (x . y) ) , comment( ;; ) etc is not supported. console hold log Examples basic operations 1 (define x 1
mooz 2010/03/02
scheme å‡¦ç†ç³». Gin ã‚’ä½¿ç”¨.

javascript

scheme
ãƒªãƒ³ã‚¯
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
mooz 2010/02/17
scheme

lambda
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸