readscheme-website/www/page6.html

707 lines
34 KiB
HTML
Raw Normal View History

2024-06-16 09:58:08 -04:00
<!DOCTYPE html>
<html>
<head>
<title>
Continuations and Continuation Passing Style
</title>
<meta name="generator" content="SchemeBib and Site-ML" charset=
"utf-8">
<meta name="description" content=
"Online bibliography of Scheme research">
<meta name="keywords" content=
"Scheme, bibliography, research, continuation-passing style, CPS, continuations, call/cc">
<meta name="robots" content="index,follow">
<link rel="stylesheet" href="basic.css" type="text/css">
</head>
<body>
<table width="100%">
<tr valign="top">
<td width="124">
<table width="124">
<tr width="124" height="45">
<td width="124" height="45">
<img width="124" height="45" border="0" alt=
"Readscheme.org" src="./imgs/nav-logo.gif">
2024-06-16 09:58:08 -04:00
</td>
</tr>
<tr width="124" height="124">
<td width="124" height="124">
<a href="./index.html" target="_top"><img width=
"124" height="124" border="0" alt=
"Scheme Bibliography Home" src=
"./imgs/nav_mainlogo.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page1.html" target="_top"><img width=
"124" height="30" border="0" alt="Classics" src=
"./imgs/nav_classics.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page2.html" target="_top"><img width=
"124" height="18" border="0" alt="Semantics" src=
"./imgs/nav_sem.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page3.html" target="_top"><img width=
"124" height="18" border="0" alt="Macros" src=
"./imgs/nav_macros.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page4.html" target="_top"><img width=
"124" height="18" border="0" alt="Objects" src=
"./imgs/nav_objects.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page5.html" target="_top"><img width=
"124" height="30" border="0" alt="Modules" src=
"./imgs/nav_modules.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page6.html" target="_top"><img width=
"124" height="18" border="0" alt="Continuations"
src="./imgs/focus_nav_cps.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./pagexml.html" target="_top"><img width=
"124" height="30" border="0" alt="Web Programming"
src="./imgs/nav_xml.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page7.html" target="_top"><img width=
"124" height="18" border="0" alt="Applications"
src="./imgs/nav_appl.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page8.html" target="_top"><img width=
"124" height="18" border="0" alt="Implementation"
src="./imgs/nav_impl.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page9.html" target="_top"><img width=
"124" height="30" border="0" alt=
"Concurrent Programming" src=
"./imgs/nav_conc.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page10.html" target="_top"><img width=
"124" height="30" border="0" alt=
"Partial Evaluation" src="./imgs/nav_pe.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page11.html" target="_top"><img width=
"124" height="18" border="0" alt="Reflection" src=
"./imgs/nav_reflect.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./whats_new.html" target=
"_top"><img width="124" height="30" border="0" alt=
"Recent Additions" src="./imgs/nav_recent.gif"></a>
</td>
</tr>
</table>
</td>
<td width="20">
<img width="20" height="1" border="0" src=
"./imgs/dot_clear.gif">
</td>
<td>
<a name="cps" id="cps"></a>
<h2>
Continuations and Continuation Passing Style
</h2>
<ul>
<li>Greg Pettyjohn, John Clements, Joe Marshall,
Shriram Krishnamurthi and Matthias Felleisen.
"Continuations from Generalized Stack Inspection". <em>
International Conference on Functional Programming,
ICFP 2005</em>. September 2005. Available online:
<a href=
"http://www.cs.brown.edu/~sk/Publications/Papers/Published/pcmkf-cont-from-gen-stack-insp/">
downloadable paper</a>.
</li>
<li>Chung-chieh Shan. "Shift to Control". <em>2004
Scheme Workshop</em>. September 2004. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2004/shan.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2004/shan.pdf">
pdf</a>.
</li>
<li>Martin Gasbichler, Eric Knauel, Michael Sperber and
Richard A. Kelsey. "How to Add Threads to a Sequential
Language Without Getting Tangled Up". <em>Scheme
Workshop 2003</em>. November 2003. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2003/Threads.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2003/Threads.pdf">
pdf</a>.
</li>
<li>Dorai Sitaram. "Unwind-protect in portable Scheme".
<em>Scheme Workshop 2003</em>. November 2003. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2003/Unwind.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2003/Unwind.pdf">
pdf</a>.
</li>
<li>Olivier Danvy. "Three Steps for the CPS
Transformation". Kansas State University. CIS-92-02.
December 1991. Available online: <a href=
"http://www.daimi.au.dk/~danvy/Papers/3steps.ps.gz">ps</a>.
</li>
<li>Olivier Danvy. "On some Functional Aspects of
Control". <em>Workshop on the Implementation of Lazy
Functional Languages</em>. October 1988. Available
online: <a href=
"http://www.daimi.au.dk/~danvy/Papers/fac.ps.gz">ps</a>
<a href=
"http://citeseer.nj.nec.com/rd/2643588%2C295233%2C1%2C0.25%2CDownload/http://citeseer.nj.nec.com/cache/papers/cs/14165/http:zSzzSzwww.daimi.au.dkzSz%7EdanvyzSzPaperszSzfac.pdf/danvy88some.pdf">
pdf</a>.
</li>
<li>William D. Clinger, Anne Hartheimer and Eric M.
Ost. "Implementation strategies for continuations".
Vol. 12. No. 1. 1999.
</li>
<li>Olivier Danvy. "Formalizing Implementation
Strategies for First-Class Continuations". <em>European
Symposium on Programming (ESOP 2000)</em>. LNCS 1782.
April 2000. Available online: <a href=
"http://www.brics.dk/RS/99/51/BRICS-RS-99-51.ps.gz">ps</a>
<a href=
"http://www.brics.dk/RS/99/51/BRICS-RS-99-51.pdf">pdf</a>.
</li>
<li>Olivier Danvy. "Back to Direct Style". <em>European
Symposium on Programming (ESOP 1992)</em>. LNCS 582.
February 1992. Available online: <a href=
"ftp://ftp.daimi.au.dk/pub/empl/danvy/Papers/danvy-scp94.ps.gz">
ps</a>.
</li>
<li>Michael Sperber and Martin Gasbichler. "Final shift
for call/cc: Direct implementation of shift and reset".
<em>International Conference on Functional Programming
(ICFP'2002)</em>. October 2002. Available online:
<a href=
"http://www-pu.informatik.uni-tuebingen.de/users/gasbichl/publications/icfp02.ps">
ps</a>.
</li>
<li>Martin Gasbichler, Michael Sperber. "A Direct
Implementation of Shift/Reset". <em>IFL 2001</em>.
2001.
</li>
<li>Paul T. Graunke and Shriram Krishnamurthi.
"Advanced Control Flows for Flexible Graphical User
Interfaces". <em>International Conference on Software
Engineering</em>. 2002. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/icse2002-gk.ps.gz">
ps</a> <a href=
"http://www.ccs.neu.edu/scheme/pubs/icse2002-gk.pdf.gz">
pdf</a>.
</li>
<li>Paul T. Graunke, Robert Bruce Findler, Shriram
Krishnamurthi, Matthias Felleisen. "Automatically
Restructuring Programs for the Web". <em>IEEE
International Symposium on Automated Software
Engineering (ASE 2001)</em>. 2001. Available online:
<a href=
"http://www.ccs.neu.edu/scheme/pubs/ase2001-gfkf.ps.gz">
ps</a> <a href=
"http://www.ccs.neu.edu/scheme/pubs/ase2001-gfkf.pdf">
pdf</a>.
</li>
<li>Paul T. Graunke, Shriram Krishnamurthi, Van der
Hoeven and Matthias Felleisen. "Programming the Web
with High-Level Programming Languages". <em>European
Symposium on Programming (ESOP 2001)</em>. 2001.
Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/esop2001-gkvf.ps.gz">
ps</a> <a href=
"http://www.ccs.neu.edu/scheme/pubs/esop2001-gkvf.pdf.gz">
pdf</a>.
</li>
<li>Olivier Danvy. "Programming with Tighter Control".
<em>BIGRE Bulletin</em>. 65. July 1989.
</li>
<li>Olivier Danvy. "On listing list prefixes". <em>Lisp
Pointers</em>. Vol. 2. No. 3-4. January 1989.
</li>
<li>Mitchell Wand. "Continuation-Based Program
Transformation Strategies". <em>Journal of the
ACM</em>. 27. 1. January 1980. Available online:
<a href=
"http://portal.acm.org/citation.cfm?id=322183&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Mitchell Wand and Daniel P. Friedman. "Compiling
Lambda Expressions Using Continuations and
Factorizations". <em>Journal of Computer
Languages</em>. 3. 1978.
</li>
<li>Mitchell Wand. "Continuation-Based
Multiprocessing". <em>Conference Record of the 1980
Lisp Conference</em>. 1980. Available online:
<a href="http://portal.acm.org/citation.cfm?id=802786&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>R. Kent Dybvig and Robert Hieb. "Continuations and
Concurrency". <em>Proceedings of the Second ACM SIGPLAN
Symposium on Principles and Practice of Parallel
Programming</em>. March 1990. Available online:
<a href="http://portal.acm.org/citation.cfm?id=99178&amp;coll=Portal">
ACM Digital Library</a>.
</li>
<li>Dorai Sitaram and Matthias Felleisen. "Modeling
Continuations Without Continuations". <em>Proceedings
of the Eighteenth ACM Symposium on Principles of
Programming Languages</em>. 1991. Available online:
<a href=
"http://portal.acm.org/citation.cfm?id=99611&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Daniel P. Friedman, Christopher T. Haynes and
Eugene E. Kohlbecker. "Programming with Continuations".
<em>Program Transformation and Programming
Environments</em>. 1984.
</li>
<li>Christopher T. Haynes and Daniel P. Friedman.
"Engines Build Process Abstractions". <em>Conference
Record of the 1984 ACM Symposium on Lisp and Functional
Programming</em>. 1984. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=802018&amp;coll=portal">
ACM Digital Library</a>.
</li>
<li>Christopher T. Haynes, Daniel P. Friedman and
Mitchell Wand. "Continuations and Coroutines".
<em>Conference Record of the 1984 ACM Symposium on Lisp
and Functional Programming</em>. 1984. Available
online: <a href=
"http://portal.acm.org/citation.cfm?id=802046&amp;coll=portal">
ACM Digital Library</a>.
</li>
<li>Christopher T. Haynes and Daniel P. Friedman.
"Abstracting Timed Preemption with Engines".
<em>Journal of Computer Languages</em>. 12. 2. 1987.
</li>
<li>Matthias Felleisen, Daniel P. Friedman, Bruce F.
Duba and John Merrill. "Beyond Continuations". Indiana
University. Computer Science Dept. Technical Report
216. February 1987. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/felleisen-beyond.pdf">
pdf</a>.
</li>
<li>Christopher T. Haynes and Daniel P. Friedman.
"Embedding Continuations in Procedural Objects".
<em>ACM Transactions on Programming Languages and
Systems</em>. 9. 4. October 1987. Available online:
<a href=
"http://portal.acm.org/citation.cfm?id=30392&amp;coll=Portal">
ACM Digital Library</a>.
</li>
<li>Daniel P. Friedman and Christopher T. Haynes.
"Constraining Control". <em>Proceedings of the Twelfth
Annual Symposium on Principles of Programming
Languages</em>. January 1985.
</li>
<li>Matthias Felleisen. "Transliterating Prolog into
Scheme". Indiana University. Computer Science Technical
Report 182. October 1985.
</li>
<li>Christopher T. Haynes, Daniel P. Friedman and
Mitchell Wand. "Obtaining Coroutines With
Continuations". <em>Journal of Computer Languages</em>.
11. 3/4. 1986.
</li>
<li>Christopher T. Haynes. "Logic Continuations". <em>
Proceedings of the Third International Conference on
Logic Programming</em>. July 1986.
</li>
<li>Matthias Felleisen, Daniel P. Friedman, Eugene E.
Kohlbecker and Bruce F. Duba. "Reasoning with
Continuations". <em>Proceedings of the Symposium on
Logic in Computer Science</em>. June 1986.
</li>
<li>Dorai Sitaram and Matthias Felleisen. "Control
Delimiters and Their Hierarchies". <em>Lisp and
Symbolic Computation: An International Journal</em>. 3.
1. January 1990. Available online: .
</li>
<li>Morry Katz and Daniel Weise. "Continuing Into the
Future: On the Interaction of Futures and First-Class
Continuations". <em>Proceedings of the 1990 ACM
Conference on Lisp and Functional Programming</em>.
June 1990. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=91628&amp;coll=Portal">
ACM Digital Library</a>.
</li>
<li>Daniel P. Friedman. "Applications of Continuations:
Invited Tutorial". <em>1988 Principles of Programming
Languages (POPL88)</em>. January 1988. Available
online: <a href=
"http://www.cs.indiana.edu/hyplan/dfried/appcont.ps">ps</a>
<a href=
"http://www.cs.indiana.edu/hyplan/dfried/appcont.pdf">
pdf</a>.
</li>
<li>Darrell Ferguson and Dwight Deugo. "Call with
Current Continuation Patterns". <em>8th Conference on
Pattern Languages of Programs</em>. September 2001.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/PLoP2001_dferguson0_1.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/PLoP2001_dferguson0_1.pdf">
pdf</a>.
</li>
<li>Olivier Danvy and Andrzej Filinski. "A Functional
Abstraction of Typed Contexts". DIKU. DIKU Rapport
89/12. July 1989. Available online: <a href=
"http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz">ps</a>.
</li>
<li>Olivier Danvy and Andrzej Filinski. "Abstracting
Control". <em>1990 ACM Conference on Lisp and
Functional Programming</em>. September 1990. Available
online: <a href=
"ftp://ftp.daimi.au.dk/pub/empl/danvy/Papers/danvy-filinski-lfp90.ps.gz">
ps</a>.
</li>
<li>William D. Clinger, Anne Hartheimer and Eric M.
Ost. "Implementation strategies for continuations".
<em>Proceedings of the 1988 ACM conference on LISP and
functional programming</em>. July 1988. Available
online: <a href=
"http://www.acm.org/pubs/citations/proceedings/lfp/62678/p124-clinger/">
ACM Digital Library</a>.
</li>
<li>Robert Hieb, R. Kent Dybvig and Carl Bruggeman.
"Representing Control in the Presence of First-Class
Continuations". <em>ACM SIGPLAN 1990 Conference on
Programming Language Design and Implementation</em>.
June 1990. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/stack.ps">ps</a>.
</li>
<li>Olivier Danvy and Andrzej Filinski. "Representing
Control: A Study of the CPS Transformation". Department
of Computing and Information Sciences, Kansas State
University. CIS-91-2. February 1991. Available online:
<a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/rrc.ps.gz">
ps</a>.
</li>
<li>Olivier Danvy and Julia L. Lawall. "Back to direct
style II: First-class continuations". <em>1992 ACM
Conference on Lisp and Functional Programming</em>.
1992. Available online: <a href=
"http://www.diku.dk/users/julia/danvy-lawall-lfp92.ps.gz">
ps</a>.
</li>
<li>Julia L. Lawall and Olivier Danvy. "Separating
Stages in the Continuation-Passing Style
Transformation". <em>Proceedings of POPL93, the 1993
ACM Symposium on Principles of Programming
Languages</em>. 1993. Available online: <a href=
"http://www.diku.dk/users/julia/lawall-danvy-popl93.ps.gz">
ps</a>.
</li>
<li>Olivier Danvy and Julia L. Lawall. "Back to direct
style II: First-class continuations". Computer Science
Department, Brandeis University. Technical Report
CS-95-179. February 1995. Available online: <a href=
"http://www.diku.dk/users/julia/danvy-lawall-lfp92-extended.ps.gz">
ps</a>.
</li>
<li>Amr Sabry and Matthias Felleisen. "Reasoning about
Programs in Continuation-Passing Style". Rice
University. TR 92-180. 1992. Available online:
<a href="http://www.ccs.neu.edu/scheme/pubs/tr92-180.ps.gz">
ps</a>.
</li>
<li>Dorai Sitaram and Matthias Felleisen. "Reasoning
with Continuations II: Full Abstraction for Models of
Control". <em>Proceedings of LFP 90</em>. 1990.
Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/lfp90-sf.ps.gz">ps</a>
<a href=
"http://www.ccs.neu.edu/scheme/pubs/lfp90-sf-correction.ps.gz">
two corrections (ps)</a>.
</li>
<li>Amr Sabry and Matthias Felleisen. "Reasoning about
Programs in Continuation-Passing Style".
<em>Proceedings of LFP 92</em>. 1992. Available online:
<a href=
"http://www.ccs.neu.edu/scheme/pubs/lfp92-sf.ps.gz">ps</a>.
</li>
<li>Amr Sabry and Matthias Felleisen. "Reasoning about
Programs in Continuation-Passing Style". <em>LISP and
Symbolic Computation</em>. 1993. Available online:
<a href=
"http://www.ccs.neu.edu/scheme/pubs/lasc93-sf.ps.gz">ps</a>.
</li>
<li>Cormac Flanagan, Amr Sabry, Bruce F. Duba and
Matthias Felleisen. "The Essence of Compiling with
Continuations". <em>Proceedings of PLDI 93</em>. 1993.
Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi93-fsdf.ps.gz">
ps</a>.
</li>
<li>Amr Sabry and Matthias Felleisen. "Is
Continuation-Passing Useful for Data Flow Analysis?".
<em>Proceedings of PLDI 94</em>. 1994. Available
online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi94-sf.ps.gz">ps</a>.
</li>
<li>Amr Sabry. "The Formal Relationship between Direct
and Continuation-passing Style Optimizing Compilers: A
Synthesis of Two Paradigms". PhD. Thesis. Rice
University. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/thesis-sabry.ps.gz">
ps</a>.
</li>
<li>Sanjeev Kumar, Carl Bruggeman and R. Kent Dybvig.
"Threads Yield Continuations". <em>Lisp and Symbolic
Computation</em>. 10, 2. May 1998. Available online:
<a href=
"http://www.cs.indiana.edu/~dyb/papers/subK.ps">ps</a>.
</li>
<li>Carl Bruggeman, Oscar Waddell and R. Kent Dybvig.
"Representing Control in the Presence of One-Shot
Continuations". <em>ACM SIGPLAN 1996 Conference on
Programming Language Design and Implementation</em>.
June 1996. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/Call-1cc-PLDI96.ps.gz">
ps</a>.
</li>
<li>Robert Hieb, R. Kent Dybvig and Claude W. Anderson
III. "Subcontinuations". <em>Lisp and Symbolic
Computation</em>. 7, 1. January 1994. Available online:
<a href=
"http://www.cs.indiana.edu/~dyb/papers/subcontinuations.ps.gz">
ps</a>.
</li>
<li>R. Kent Dybvig and Robert Hieb. "Engines from
Continuations". <em>Journal of Computer Languages</em>.
14, 2. 1989. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/engines.ps">ps</a>.
</li>
<li>Olin Shivers. "Continuations and threads:
Expressing machine concurrency directly in advanced
languages". <em>Proceedings of the Second ACM SIGPLAN
Workshop on Continuations</em>. January 1997. Available
online: <a href=
"http://www.cc.gatech.edu/fac/Olin.Shivers/cps-threads.ps">
ps</a>.
</li>
<li>Matthias Felleisen, Mitchell Wand, Daniel P.
Friedman and Bruce F. Duba. "Abstract continuations: a
mathematical semantics for handling full jumps".
<em>Proceedings of the 1988 ACM conference on LISP and
functional programming</em>. July 1988. Available
online: <a href=
"http://www.acm.org/pubs/citations/proceedings/lfp/62678/p52-felleisen/">
ACM Digital Library</a>.
</li>
<li>Julia L. Lawall and Daniel P. Friedman. "Toward
Leakage Containment". Computer Science Department,
Indiana University. February 1992. Available online:
<a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/iucstr346.ps.gz">
ps</a>.
</li>
<li>Richard A. Kelsey and Paul Hudak. "Realistic
Compilation by Program Transformation". <em>Principles
of Programming Languages (POPL89)</em>. January 1989.
Available online: <a href=
"http://citeseer.nj.nec.com/rd/0%2C179975%2C1%2C0.25%2CDownload/http://citeseer.nj.nec.com/compress/0/papers/cs/210/ftp:zSzzSzftp.nj.nec.comzSzpubzSzkelseyzSzcomp-by-prog-trans.ps.gz/kelsey89realistic.ps">
ps</a> <a href=
"http://citeseer.nj.nec.com/rd/0%2C179975%2C1%2C0.25%2CDownload/http://citeseer.nj.nec.com/cache/papers/cs/210/ftp:zSzzSzftp.nj.nec.comzSzpubzSzkelseyzSzcomp-by-prog-trans.pdf/kelsey89realistic.pdf">
pdf</a>.
</li>
<li>Julia L. Lawall. "Continuation Introduction and
Elimination in Higher-Order Programming Languages".
PhD. Thesis. Indiana University, Computer Science
Department. July 1994.
</li>
<li>Julia L. Lawall and Olivier Danvy.
"Continuation-Based Partial Evaluation". <em>1994 ACM
Conference on Lisp and Functional Programming</em>.
1994. Available online: <a href=
"http://www.diku.dk/users/julia/lawall-danvy-lfp94.ps.gz">
ps</a>.
</li>
<li>Julia L. Lawall and Olivier Danvy.
"Continuation-Based Partial Evaluation". Computer
Science Department, Brandeis University. Technical
Report CS-95-178. February 1995. Available online:
<a href=
"http://www.diku.dk/users/julia/lawall-danvy-lfp94-extended.ps.gz">
ps</a>.
</li>
<li>Steven E. Ganz, Daniel P. Friedman and Mitchell
Wand. "Trampolined Style". <em>International Conference
on Functional Programming (ICFP 99)</em>. September
1999. Available online: <a href=
"http://www.cs.indiana.edu/hyplan/sganz/publications/icfp99/paper.ps">
ps</a> <a href=
"http://www.cs.indiana.edu/hyplan/sganz/publications/icfp99/paper.pdf">
pdf</a>.
</li>
<li>Erik Hilsdale and Daniel P. Friedman. "Writing
macros in continuation-passing style". <em>Scheme and
Functional Programming 2000</em>. September 2000.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/hilsdale.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/hilsdale.pdf">
pdf</a>.
</li>
<li>Marc Feeley. "A portable implementation of
first-class continuations for unrestricted
interoperability with C in a multithreaded Scheme".
<em>Scheme and Functional Programming 2000</em>.
September 2000. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/feeley.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/feeley.pdf">
pdf</a>.
</li>
<li>Mitchell Wand. "Continuation-Based Multiprocessing
Revisited". <em>Higher-Order and Symbolic
Computation</em>. 12(3). October 1999. Available
online: <a href=
"ftp://ftp.ccs.neu.edu/pub/people/wand/papers/hosc-99-intro.ps">
ps</a>.
</li>
<li>Mitchell Wand. "Continuation-Based
Multiprocessing". <em>Higher-Order and Symbolic
Computation</em>. 12(3). October 1999. Available
online: <a href=
"ftp://ftp.ccs.neu.edu/pub/people/wand/papers/hosc-99.ps">
ps</a>.
</li>
<li>Marc Feeley. "A Better API for First-Class
Continuations". <em>2nd Workshop on Scheme and
Functional Programming</em>. September 2001. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/feeley.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/feeley.pdf">
pdf</a>.
</li>
<li>Jonathon Sobel and Daniel P. Friedman. "Recycling
Continuations". <em>1998 International Conference on
Functional Programming (ICFP'98)</em>. September 1998.
Available online: <a href=
"http://www.cs.indiana.edu/hyplan/jsobel/Recycling/recycling.ps">
ps</a> <a href=
"http://www.cs.indiana.edu/hyplan/jsobel/Recycling/recycling.pdf">
pdf</a>.
</li>
<li>Christian Queinnec. "Continuations and
conversations". <em>9th International Conference, AIMSA
2000</em>. number 1904 in Lecture Notes in Artificial
Intelligence. September 2000.
</li>
<li>Christian Queinnec. "Locality, causality and
continuations". <em>LFP '94 - ACM Symposium on Lisp and
Functional Programming</em>. June 1994. Available
online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/lcc.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/lcc.pdf">
pdf</a>.
</li>
<li>Christian Queinnec. "A library of high-level
control operators". <em>Lisp Pointers</em>. 6(4).
October 1993. Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/contlib.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/contlib.pdf">
pdf</a>.
</li>
<li>Christian Queinnec. "Continuation conscious
compilation". <em>Lisp Pointers</em>. 6(1). January
1993. Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/ccc.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/ccc.pdf">
pdf</a>.
</li>
<li>Christian Queinnec. "Continuation sensitive
compilation". Laboratoire d'Informatique de l'École
Polytechnique. Research Report LIX RR 92/14. November
1992. Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/csc.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/csc.pdf">
pdf</a>.
</li>
<li>Christian Queinnec and Bernard Serpette. "A Dynamic
Extent Control Operator for Partial Continuations".
<em>POPL '91 - Eighteenth Annual ACM symposium on
Principles of Programming Languages</em>. January 1991.
Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/popl6.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/popl6.pdf">
pdf</a>.
</li>
<li>Luc Moreau and Christian Queinnec. "Partial
Continuations as the Difference of Continuations". <em>
International Conference on Programming Language
Implementation and Logic Programming (PLILP'94)</em>.
number 844 in Lecture Notes in Computer Science.
September 1994. Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/pc.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/pc.pdf">
pdf</a>.
</li>
<li>Ching-Lin Wang. "A Continuation-based Language
Embedded in Scheme". <em>Journal of Computer
Languages</em>. Vol. 17. Num. 1. 1992.
</li>
<li>Ching-Lin Wang. "Obtaining Lazy Evaluation with
Continuations in Scheme". <em>Information Processing
Letters</em>. Vol. 35. 1990.
</li>
</ul>
<p>
<img width="1" height="40" border="0" src=
"./imgs/dot_clear.gif">
</p>
<div class="collophon" align="right">
Last modified: Saturday, August 11th, 2012
4:55:46pm<br>
2024-06-16 09:58:08 -04:00
HTML generated using <a href=
"http://celtic.benderweb.net/webit/">WebIt!</a>.
</div>
</td>
</tr>
</table>
</body>
</html>