継続
□記事を途中から表示しています
[最初から表示]
脚注[脚注の使い方]
出典^ a b Reynolds, John C. (1993-11). ⇒“The discoveries of continuations” (英語). LISP and Symbolic Computation 6 (3-4): 233?247. doi:10.1007/BF01019459. .mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation.cs-ja1 q,.mw-parser-output .citation.cs-ja2 q{quotes:"「""」""『""』"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free a,.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited a,.mw-parser-output .id-lock-registration a,.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription a,.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:#d33}.mw-parser-output .cs1-visible-error{color:#d33}.mw-parser-output .cs1-maint{display:none;color:#3a3;margin-left:0.3em}.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}ISSN 0892-4635. ⇒http://link.springer.com/10.1007/BF01019459.
^ Naur, Peter (1963-06). ⇒“The design of the GIER ALGOL compiler Part I” (英語). BIT 3 (2): 124?140. doi:10.1007/BF01935579. ISSN 0006-3835. ⇒http://link.springer.com/10.1007/BF01935579.
^ “Scheme: Continuations and exceptions”. CSE 341 : Programming Languages Winter 2004 (Lecture Notes). University of Washington, Department of Computer Science and Engineering. 2022年5月30日閲覧。
^ “Revised7 Report on the Algorithmic Language Scheme”. Scheme Working Group 1. 2022年5月31日閲覧。
^ a b Strachey, Christopher; Wadsworth, Christopher P. (2000). ⇒“Continuations: A Mathematical Semantics for Handling Full Jumps”. Higher-Order and Symbolic Computation 13 (1/2): 135?152. doi:10.1023/A:1010026413531. ⇒http://link.springer.com/10.1023/A:1010026413531.
^ Scott, Dana; Strachey, Christopher (1971). Toward a Mathematical Semantics for Computer Languages (Report). Technical Monograph (英語). Oxford: Oxford University Computing Laboratory, Programming Research Group.
^ ⇒Island Life - 継続の起源
^ ⇒Scheme:call/ccと副作用
参考文献
Guy Lewis Steele, Jr. (1978), Rabbit: A Compiler for Scheme, ftp://publications.ai.mit.edu/ai-publications/pdf/AITR-474.pdf
Guy Lewis Steele, Jr. and Gerald Jay Sussman (1976), ⇒Lambda: The Ultimate Imperative, ⇒http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-353.pdf[リンク切れ]
Peter J. Landin (1965), ⇒A Generalization of Jumps and Labels, ⇒http://mirrors.csl.sri.com/www.brics.dk/%257Ehosc/local/HOSC-11-2-pp125-143.pdf[リンク切れ]
Michael J. Fischer (1972), Lambda-Calculus Schemata, https://users-cs.au.dk/hosc/local/LaSC-6-34-pp259-288.pdf[リンク切れ]
Gordon Plotkin (1975), ⇒Call-by-Name, Call-by-Value and the Lambda Calculus, ⇒http://homepages.inf.ed.ac.uk/gdp/publications/cbn_cbv_lambda.pdf
Olivier Danvy , Andrzej Filinski (1990), ⇒Abstracting Control, ⇒http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8753
Olivier Danvy , Andrzej Filinski (1992), ⇒Representing control: a study of the CPS transformation, ⇒http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.84
Andrzej Filinski (1994), ⇒Representing Monads, ⇒http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8213
Martin Gasbichler. Michael Sperber (2002), ⇒Final Shift for Call/cc: Direct Implementation of Shift and Reset, ⇒http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.3425
Timothy G. Griffin (1990), ⇒A Formulae-as-Types Notion of Control, ⇒http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.6893
廣川佐千男, 亀山幸義, 馬場謙介「λC計算とλP計算との対応(計算理論とその応用)」『数理解析研究所講究録』第992巻、京都大学数理解析研究所、1997年5月、167-174頁、CRID 1050001201936747648、hdl:2433/61141、ISSN 1880-2818。
浅井 健一, ⇒shift/reset プログラミング入門, ACM SIGPLAN Continuation Workshop 2011 チュートリアルセッション資料, ⇒http://pllab.is.ocha.ac.jp/~asai/cw2011tutorial/main-j.pdf
記事の検索おまかせリスト▼オプションを表示暇つぶしWikipedia
Size:24 KB
出典: フリー百科事典『ウィキペディア（Wikipedia）』
担当:undef