Trampolined style

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 18-27

  Ganz, Steven E ^a   Friedman, Daniel P ^a   Wand, Mitchell ^b  

^a INDIANA UNIVERSITY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE STEP; MULTI-THREADING; MULTIPLE LEVELS; SINGLE LOOP; WRITING PROJECTS;

SPORTS;

EID: 17144427002     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317779     Document Type: Article

References (28)

1. Henry Baker. Cons should not cons its arguments, Part II: Cheney on the M.T.A. SIGPLAN Notices, 30(9):17-20, September 1995.
2. Alan Bawden. Reification without evaluation. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming, pages 342-351, 1988.
3. Daniel G. Bobrow and Ben Wegbreit. A model and stack implementation of multiple environments. Communications of the ACM, 16(10):591-603, October 1973.
4. David Cooper. Böhm and Jacopini's reduction of flow charts. Communications of the ACM, 10(8):463,473, August 1967. Letter to the Editor.
5. Olivier Danvy and Andrzej Filinski. Abstracting control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pages 151-160, Nice (France), June 1990. ACM, ACM Press.
6. David DeRoure. QPL3 - continuations, concurrency and communication. Technical Report CSTR 90-20, Department of Electronics and Computer Science, University of Southampton, 1990.
7. R. Kent Dybvig and Robert Hieb. Engines from continuations. Computer Languages, 14(2):109-123, 1989.
8. Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming, pages 52-62, Snowbird (Utah USA), July 1988.
9. Michael J. Fischer. Lambda-calculus schemata. Lisp and Symbolic Computation, 6(3/4):259-288, 1993. Revised from the proceedings of the 1972 ACM Conference on Proving Assertions about Programs.
10. Michael J. Fischer. Lambda-calculus schemata. Lisp and Symbolic Computation, 6(3/4):259-288, 1993. Revised from the proceedings of the 1972 ACM Conference on Proving Assertions about Programs.
11. Daniel P. Friedman and David S. Wise. An indeterminate constructor for applicative programming. In Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, pages 245-250, Las Vegas (Nevada USA), January 1980.
12. Christopher T. Haynes and Daniel P. Friedman. Abstracting timed preemption with engines. Computer Languages, 12(2):109-121, 1987.
13. Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand. Continuations and coroutines. Computer Languages, 11(3/4):143-153, 1986.
14. Robert Hieb, R. Kent Dybvig, and Claude W. Anderson. Sub continuations. Lisp and Symbolic Computation, 6:453-478, 1993.
15. Stephen Cole Kleene. Introduction to Meta-mathematics. North-Holland, 1952.
16. Sanjeev Kumar, Carl Bruggeman, and R. Kent Dybvig. Threads yield continuations. Lisp and Symbolic Computation, 10(3):223-236, May 1998.
17. th Annual IEEE Symposium on Logic in Computer Science, LICS '89, pages 14-23, Pacific Grove (California USA), June 1989. ACM, IEEE.
18. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, July 1991.
19. J. Gregory Morrisett and Andrew Tolmach. A portable multiprocessor interface for Standard ML of New Jersey. Technical Report CMU-CS-92-155, Carnegie Mellon University, June 1992. Also appears as Princeton University TR-376-92.
20. Christian Queinnec. Value transforming style. In M. Billaud, P. Castéran, M. M. Corsini, K. Musumbu, and A. Rauzy, editors, WSA '92 - Workshop on Static Analysis, number 81-82 in Bigre Journal, pages 20-28, Bordeaux (France), September 1992.
21. Christian Queinnec and David DeRoure. Design of a concurrent and distributed language. In Robert H. Halstead, Jr. and Takayasu Ito, editors, Parallel Symbolic Computing: Languages, Systems, and Applications, (US/Japan Workshop Proceedings), volume LNCS 748, pages 234-259, Boston (Massachussetts USA), October 1993.
22. John C. Reynolds. Definitional interpreters for higher order programming languages. In Proceedings of the ACM 25th National Conference, pages 717-740, Boston (Massachussetts USA), August 1972. ACM, ACM Press.
23. Olin Shivers. Continuations and threads: Expressing machine concurrency directly in advanced languages. In Proceedings of the Second ACM SIGPLAN Workshop on Continuations, pages 2-1-2-15, Paris (France), January 1997. ACM Press.
24. David Tarditi, Peter Lee, and Anurag Acharya. No assembly required: A standard ML to C compiler. ACM Letters on Programming Languages and Systems, 1(2):161-177, June 1992.
25. A. van Wijngaarden. Recursive definition of syntax and semantics. In T. B. Steel, Jr., editor, Formal Language Description Languages for Computer Programming, pages 13-24. North-Holland, 1966.
26. Philip Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pages 61-78, Nice (France), June 1990.
27. Mitchell Wand. Continuation-based multiprocessing. Higher-Order and Symbolic Computation, 12(3), 1999. Reprinted from the proceedings of the 1980 Lisp Conference, pages 19-28.
28. Mitchell Wand. Continuation-based multiprocessing. Higher-Order and Symbolic Computation, 12(3), 1999. Reprinted from the proceedings of the 1980 Lisp Conference, pages 19-28.