Revisiting coroutines

ACM Transactions on Programming Languages and Systems

Volumn 31, Issue 2, 2009, Pages

  De Moura, Ana Lúcia ^a   Ierusalimschy, Roberto ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Continuations; Generators; Multitasking

Indexed keywords

CONTINUATIONS; CONTROL ABSTRACTIONS; EXPRESSIVE POWER; GENERATORS; OPERATIONAL SEMANTICS; PROCEDURAL LANGUAGES;

INFORMATION THEORY;

MULTITASKING;

EID: 62149100997     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1462166.1462167     Document Type: Article

References (46)

1. ADYA, A., HOWELL, J., THEIMER, M., BOLOSKY, W. J., AND DOUCER, J. R. 2002. Cooperative task man- agement without manual stack management. In Proceedings of the USENIX Annual Technical Conference. USENIX.
2. BEHREN, R., CONDIT, J., AND BREWER, E. 2003. Why events are a bad idea (for high-concurrency servers). In Proceedings of the 9th Workshop on Hot Topics in Operating Systems (HotOS IX).
3. BIRTWISTLE, G., DAHL, O.-J., MYHRHAUG, B., AND NYGAARD, K. 1980. Simula Begin. Studentlίtteratur, Sweden.
4. BRUGGEMAN, C.,WADDELL, O., AND DYBVIG, R. 1996. Representing control in the presence of one-shot continuations. In Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI'96). ACM, 99-107. SIGPLAN Not. 31, 5.
5. CLOCKSIN, W. AND MELLISH, C. 1981. Programming in Prolog. Springer.
6. CONWAY, D. 2000. Rfc 31: Subroutines: Co-routines. http://dev.perl.org/per16/rfc/31.html.
7. CONWAY, M. 1963. Design of a separable transition-diagram compiler. Commun. ACM 6, 7, 396-408.
8. DAHL, O.-J., DIJKSTRA, E. W., AND HOARE, C. A. R. 1972. Hierarchical program structures. In Struc- tured Programming, 2nd ed. Academic Press, London.
9. DANVY, O. AND FILINSKI, A. 1990. Abstracting control. In Proceedings of the ACM Conference on LISP and Functional Programming. ACM, 151-160.
10. DYBVIG, R. AND HIEB, R. 1989. Engines from continuations. Comput. Lang. 14, 2, 109-123.
11. FELLEISEN, M. 1985. Transliterating Prolog into Scheme. Tech. rep. 182, Indiana University.
12. FELLEISEN, M. 1988. The theory and practice of first-class prompts. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL'88). ACM, 180-190.
13. FELLEISEN, M. 1990. On the expressive power of programming languages. In Proceedings of the 3rd. European Symposium on Programming (ESOP'90), 134-151.
14. FELLEISEN, M. AND FRIEDMAN, D. 1986. Control operators, the SECD-machine, and the λ-calculus. In Formal Description of Programming Concepts-Ill, M. Wirsing, Ed. North-Holland, 193-217.
15. GRISWOLD, R. AND GRISWOLD, M. 1983. The Icon Programming Language. Prentice-Hall, NJ.
16. HARPER, R., DUBA, B., HARPER, R., AND MACQUEEN, D. 1991. Typing first-class continuations in ML. In Proceedings of the 18th ACM Symposium on Principles of Programming Languages (POPL'91). ACM, 163-173.
17. HAYNES, C. T. 1987. Logic continuations. J. Logic Program. 4, 157-176.
18. HAYNES, C. T. AND FRIEDMAN, D. 1987a. Abstracting timed preemption with engines. J. Comput. Lang. 12, 2, 109-121.
19. HAYNES, C. T, FRIEDMAN, D., AND WAND, M. 1986. Obtaining coroutines with continuations. Com- put. Lang. 11, 3/4, 143-153.
20. HAYNES, C. T. AND FRIEDMAN, D. P. 1987b. Embedding continuations in procedural objects. ACM Trans. Progam.. Lang. Syst. 9, 4, 582-598.
21. HIEB, R. AND DYBVIG, R. 1990. Continuations and concurrency. In Proceedings of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM, 128-136.
22. HIEB, R., DYBVIG, R., AND ANDERSON III, C. W. 1994. Subcontinuations. Lisp Symbolic Comput. 7, 1, 83-110.
23. IERUSALIMSCHY, R. 2003. Programming in Lua. Lua.org, Rio de Janeiro, Brazil.
24. IERUSALIMSCHY, R. AND DE MOURA, A. L. 2008. Some proofs about coroutines. Monografias em Ciën- cia da Computação 04/08, PUC-Rio, Rio de Janeiro, Brazil.
25. IERUSALIMSCHY, R., FIGUEIREDO, L., AND CELES, W. 1996. Lua-An extensible extension language. Softw. Fract. & Exper. 26, 6, 635-652.
26. JOHNSON, G. AND DUGGAN, D. 1988. Stores and partial continuations as first-class objects in a language and its environment. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL'88). ACM.
27. 5 report on the algorithmic language Scheme. Higher-Order Symbolic Comput. 11, 1, 7-105.
28. KNÜTH, D. E. 1968. The Art of Computer Programming, Volume 1, Fundamental Algorithms. Addison-Wesley, Reading, MA.
29. KUMAR, S., BRUGGEMAN, C, AND DYBVIG, R. 1998. Threads yield continuations. Lisp Symbolic Com- put. 10, 3, 223-236.
30. LISKOV, B., SNYDER, A., ATKINSON, R., AND SCHAFFERT, C. 1977. Abstraction mechanisms in CLU. Commun. ACM 20, 8 (Aug.), 564-576.
31. MARLIN, C. D. 1980. Coroutines: A Programming Methodology, a Language Design and an Im- plementation. Lecture Notes in Computer Science, vol. 95, Springer.
32. MOODY, K. AND RICHARDS, M. 1980. A coroutine mechanism for BCPL. Softw. Fract. & Exper. 10,10, 765-771.
33. MOURA, A., RODRIGUEZ, N., AND IERUSALIMSCHY', R. 2004. Coroutines in Lua. J. Universal Comput. Sci. 10, 7, 910-925.
34. MURER, S., OMOHUNDRO, S., STOUTAMIRE, D., AND SZYPERSKI, C. 1996. Iteration abstraction in Sather. ACM Trans. Progam. Lang. Syst. 18, 1, 1-15.
35. PAULI, W. AND SOFFA, M. L. 1980. Coroutine behaviour and implementation. Softw, Fract. & Ex- per. 10, 3, 189-204.
36. QUEINNEC, C. AND SERPETTE, B. 1991. A dynamic extent control operator for partial continuations. In Proceedings of the 18th ACM Symposium on Principles of Programming Languages (POPL'91). ACM, 174-184.
37. RICHTER, J. 1997. Advanced Windows, 3rd ed. Microsoft Press, Redmond, WA.
38. SCHEMENAUER, N., PETERS, T., AND HETLAND, M. 2001. PEP 255: Simple generators. http://www.python.org/peps/ pep-0255.html.
39. SERRANO, M., BOUSSINOT, F., AND SERPETTE, B. 2004. Scheme fair threads. In Proceedings of the 6th SIGPLAN International Congress on Principles and Practice of Declarative Programming (PPDP), 203-214.
40. SITARAM, D. 1993. Handling control. In Proceedings of the ACM SIGPLAN'93 Confrence on Pro- gramming Language Design and Implementation (PLDΓ93). ACM, SIGPLAN Not. 28, 6.
41. SITARAM, D. 1994. Models of control and their implications for progamming language design. Ph.D. thesis, Rice University.
42. SPRINGER, G. AND FRIEDMAN, D. 1989. Scheme and the Art of Programming. MIT Press, Cambridge, MA.
43. TISMER, C. 2000. Continuations and stackless Python. In Proceedings of the 8th International Python Conference. Arlington, VA. http://www.python.org/Horkshops/2000-01/proceedings. html.
44. WAND, M. 1980. Continuation-Based multiprocessing. In Proceedings of the Lisp Conference. ACM, 19-28. Reprinted in Higher-Order Symbolic Comput. 12, 3, 285-299, 1999.
45. WAND, M. AND VAILLANCOURT, D. 2004. Relating models of backtracking. In Proceedings of the 9th ACM SIGPLAN International Conference on Functional Programming. ACM, 54-65.
46. WIRTH, N. 1985. Programming in Modula-2, 3rd, corrected ed. Springer.