Recycling continuations

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 1, 1999, Pages 251-260

  Sobel, Jonathan ^a   Friedman, Daniel P ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17244362429     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/291251.289452     Document Type: Article

References (18)

1. Richard Bird and Philip Wadler. An Introduction to Functional Programming. Prentice-Hall, 1988.
2. Luca Cardelli. The functional abstract machine. Technical Report TR-107, Bell Labs, 1983. Bell Labs Technical Memorandum TM-83-11271-1.
3. Luca Cardelli. Compiling a functional language. In Conference Record of the 1984 ACM Symposium on LISP and functional Programming, pages 208-217. ACM Press, 1984.
4. Chih-Ping Chen and Paul Hudak. Rolling your own mutable ADT: A connection between linear types and monads. In Conference Record of POPL '97: The 24TH ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 54-66, Paris, France, January 1997. ACM Press.
5. R. Kent Dybvig. Three Implmentation Models for Scheme. PhD thesis, University of North Carolina at Chapel Hill, 1987.
6. Harry R. Lewis and Larry Denenburg. Data Structures and Their Algorithms. HarperCollins, 1991.
7. Grant Malcolm. Algebraic data types and program transformation. Science of Computer Programming, 14(2-3):255-280, September 1990.
8. th International Conference on Functional Programming Languages and Computer Architecture, number 523 in Lecture Notes in Computer Science. Springer-Verlag, 1991.
9. th International Conference on Functional Programming Languages and Computer Architecture, pages 324-333, La Jolla, June 1995. ACM Press.
10. Yasuhiko Minamide. A functional representation of data structures with a hole. In Conference Record of POPL '98: The 25TH ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press.
11. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, July 1991.
12. th International Conference on Functional Programming Languages and Computer Architecture, pages 66-77, La Jolla, June 1995. ACM Press.
13. John C. Reynolds. Definitional interpreters for higher-order programming languages. In Proceedings of the ACM National Conference, pages 717-740. ACM Press, 1972.
14. H. Schorr and W. M. Waite. An efficient machine-independent procedure for garbage collection in various list structures. Communications of the ACM, 10(8):501-506, August 1967.
15. Jeffrey D. Smith. Design and Analysis of Algorithms. PWS-KENT, Boston, 1989.
16. Mitchell Wand. Continuation-based program transformation strategies. Journal of the Association for Computing Machinery, 27(1):164-180, January 1980.
17. Benjamin Wegbreit. A space-efficient list structure tracing algorithm. IEEE Transactions on Computers, C21:1009-1010, 1972.
18. A. Van Wijngaarden. Recursive definition of syntax and semantics. In Formal Language Description Languages, pages 13-24. North-Holland, 1964.