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

ilyaletre id:ilyaletre

continuationã«é–¢ã™ã‚‹ilyaletreã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (5)

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

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
ilyaletre 2018/07/18
ã“ã®è¨˜äº‹ã®ãŠã‹ã’ã§ã‚ˆã†ã‚„ãcall/ccãŒä½•ãªã®ã‹é›°å›²æ°—ã ã‘è§£ã£ã¦ãã¤ã¤ã‚ã‚‹ã€‚

scheme

lisp

continuation
ãƒªãƒ³ã‚¯
A page about call/cc
A page about call/cc [ENS] [ENS students] [David Madore] [Mathematics] [Computer science] [Programs] [Linux] [Literature] [What's new?] [What's cool?] [Site map] Table of contents What is call/cc? What is this page? A first introduction Who invented call/cc? What does call/cc stand for? Which programming languages have a call/cc function? Outgoing-only continuations: exceptions Exceptions in C: se
ilyaletre 2018/06/28
continuation

programming

scheme
ãƒªãƒ³ã‚¯
Comprehending first-class continuations
ilyaletre 2018/02/20
scheme

continuation
ãƒªãƒ³ã‚¯
https://www.cs.princeton.edu/~appel/papers/97.ps
ilyaletre 2017/08/04
fp

compiler

continuation

sml
ãƒªãƒ³ã‚¯
ãƒ¢ãƒŽã‚¤ãƒ‰ã¨ç¶™ç¶šæ¸¡ã—ã®é“å…·ç®± - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
é–¢æ•°åž‹è¨€èªžHaskellã«ãŠã„ã¦ã€æ™®é€šã¯è¨ˆç®—ã®çµæžœã¯é–¢æ•°ã®æˆ»ã‚Šå€¤ã¨ã—ã¦æ‰±ã†ãŒã€ã€Œçµæžœã‚’å—ã‘å–ã‚‹é–¢æ•°ã€ ã«æ¸¡ã™ã¨ã„ã†ç¶™ç¶šæ¸¡ã—ã¨ã„ã†ã‚¹ã‚¿ã‚¤ãƒ«ã‚‚ã‚ã‚‹ã€‚ã“ã‚Œã¯å˜ãªã‚‹å†—é•·ãªã‚„ã‚Šæ–¹ã§ã¯ãªãã€æ§˜ã€…ãªèˆˆå‘³æ·±ã„æ€§è³ªã‚’æŒã¤ã€‚ åŸºæœ¬å½¢ã¯ã€aã¨ã„ã†å€¤ã‚’æ¸¡ã™ã¨ã“ã‚ã‚’ âˆ€r. (a -> r) -> r ã®ã‚ˆã†ãªè¡¨ç¾ã«ã™ã‚‹ã€‚ãŸã¨ãˆã°ã€ä¸Žãˆã‚‰ã‚ŒãŸæ•°ã®42å€ã‚’æ¸¡ã—ãŸã„ã¨ãã€ãã®ã¾ã¾\x -> x * 42ã§ã¯ãªãã€\x f -> f (x * 42)ã¨æ›¸ãã€‚ã‚‚ã¡ã‚ã‚“ã“ã‚Œã ã‘ã§ã¯ã‚ã‚ŠãŒãŸã¿ãŒåˆ†ã‹ã‚‰ãªã„ã€‚ ã•ã¦ã€ä¸Žãˆã‚‰ã‚ŒãŸæ–‡å—åˆ—ã®ä¸ã®ã†ã¡ã€å¤§æ–‡å—ã®ã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã‚’å–ã‚Šå‡ºã—ã€ãã‚ŒãŒã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã®ä½•ç•ªç›®ã‹è¨ˆç®—ã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ä½œã‚ŠãŸã„ã€‚æ™®é€šã¯ãƒªã‚¹ãƒˆã‚’ä½¿ã£ã¦ã“ã®ã‚ˆã†ã«æ›¸ãã‹ã‚‚ã—ã‚Œãªã„ã€‚ import Data.Char uppers :: [Char] -> [Int] uppers [] = [] uppers (x:xs) |
ilyaletre 2017/08/03
haskell

continuation

monoid
ãƒªãƒ³ã‚¯
1