Threads yield continuations

Higher-Order and Symbolic Computation

Volumn 10, Issue 3, 1998, Pages 223-236

  Kumar, Sanjeev ^a   Bruggeman, Carl ^b   Dybvig, R Kent ^c  

^a Princeton University   (United States)

^b The University of Texas at Arlington   (United States)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Concurrency; Continuations; Control delimiters; Control operators; Threads

Indexed keywords

EID: 54649084559     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. Birrell, A., Guttag, J.V., Horning, J.J., and Levin, R. Synchronization primitives for a multiprocessor: A formal specification. In Proceedings of the Eleventh Symposium on Operating Systems Principles, Nov. 1987, pp. 94-102.
2. Bruggeman, C., Waddell, O., and Dybvig, R.K. Representing control in the presence of one-shot continuations. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation, May 1996, pp. 99-107.
3. Clocksin, W.F. and Mellish, C.S. Programming in Prolog. Springer-Verlag, second edition, 1984.
4. Cooper, E.G. and Morrisett, J.G. Adding threads to standard ML. Technical Report CMU-CS-90-186, Computer Science Department, Carnegie Mellon University, Dec. 1990.
5. Danvy, O. and Filinski, A. Representing control: A study of CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391 (1992).
6. Dybvig, R.K. and Hieb, R. Engines from continuations. Computer Languages, 14(2): 109-123 (1989).
7. Felleisen, M. Transliterating prolog into scheme. Technical Report 182, Indiana University, Oct. 1985.
8. Felleisen, M. The theory and practice of first-class prompts. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, Jan. 1988, pp. 180-190.
9. Felleisen, M., Friedman, O.P., Duba, B., and Merrill, J. Beyond continuations. Technical Report 216, Indiana University Computer Science Department, 1987.
10. Felleisen, M., Wand, M., Friedman, D.P., and Duba, B.F. Abstract continuations: A mathematical semantics for handling full functional jumps. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, July 1988, pp. 52-62.
11. Friedman, O.P., Haynes, C.T., and Wand, M. Obtaining coroutines with continuations. Computer Languages, 11(3/4): 143-153 (1986).
12. Gunter, C.A., Rémy, R., and Riecke, J.G. A generalization of exceptions and control in ML-like languages. In Proceedings of the ACM Conference on Functional Programming and Computer Architecture, June 1995.
13. Halstead, R.H., Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538 (Oct. 1985).
14. Haynes, C.T. Logic continuations. LISP Pointers, 157-176 (1987).
15. Haynes, C.T. and Friedman, O.P. Engines build process abstractions. In Proceedings of the 1984 ACM Conference on Lisp and Functional Programming, Aug. 1984, pp. 18-24.
16. Hieb, R. and Dybvig, R.K. Continuations and concurrency. In Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1990.
17. Hieb, R., Dybvig, R.K.,andAnderson, C.W., III. Subcontinuations. Lisp and Symbolic Computation, 7(1):83110 (Mar. 1994).
18. Hieb, R., Dybvig, R.K., and Bruggeman, C. Representing control in the presence of first-class continuations. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, June 1990, pp. 66-77.
19. Hoare, C.A.R. Monitors: An operating system structuring concept. Communications of the ACM, 17(10):549-557 (1974).
20. Jagannathan, S. and Philbin, J. A customizable substrate for concurrent languages. In ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, June 1992.
21. Jagannathan, S. and Philbin, J. A foundation for an efficient multi-threaded Scheme system. In Proceedings of the 1992 Conference on Lisp and Functional Programming, June 1992.
22. Katz, M. and Weise, D. Continuing into the future: On the interaction of futures and first-class continuations. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, June 1990, pp. 176-184.
23. Komiya, T. and Yuasa, T. Indefinite one-time continuation. Transactions Information Processing Society of Japan, 37(1):92-100 (1996).
24. Lampson, B.W. and Redell, D.D. Experience with processes and monitors in Mesa. Communications of the ACM, 23(2): 105-117 (1980).
25. Miller, J.S. MultiScheme: A parallel processing system based on MIT scheme. Ph.D. thesis, Massachusetts Institute of Technology, Sept. 1987.
26. Queinnec, C. and Serpette, B. A dynamic extent control operator for partial continuations. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Jan. 1991, pp. 174-184.
27. Sitaram, D. and Felleisen, M. Control delimiters and their hierarchies. Lisp and Symbolic Computation, 3(l):67-99(Jan. 1990).
28. Sussman, G.J. and Steele, G.L., Jr. Scheme: An interpreter for extended lambda calculus. AI Memo 349, Massachusetts Institute of Technology Artificial Intelligence Lab, 1975.
29. Tolmach, A. and Morrisett, J.G. A portable multiprocessor interface for standard ML of New Jersey. Technical Report TR-376-92, Princeton University, June 1992.
30. Wand, M. Continuation-based multiprocessing. In Conference Record of the 1980 Lisp Conference, Aug. 1980, pp. 19-28.