Stores and partial continuations as first-class objects in a language and its environment

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130193, Issue , 1988, Pages 158-168

  Johnson, Gregory F ^a   Duggan, Dominic ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67650130422     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73560.73574     Document Type: Conference Paper

References (10)

1. J. R. Driscoll, N. Sarnak, D. D. Sleator, R. E. Tarjan. Making Data Structures Persistent. Eighteenth Annual ACM Symposium on Theory of Computing, 109-121 (1986).
2. M. Felleisen, D. P. Friedman, B. Duba, J. Merrill. Beyond Continuations. Technical Report No. 216. Indiana Computer Science Department (1987).
3. D. P. Friedman, C. T. Haynes. Constraining Control. Twelfth Annual ACM Symposium on Principles of Programming Languages (1985).
4. G. F. Johnson. GL - A Denotational Testbed with Continuations and Partial Continuations as First-Class Objects. SIGPLAN '87 Symposium on Interpreters and Interpretive Techniques, 165-176 (1987).
5. R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and Systems Sciences 17, 348-375 (1978).
6. J. Rees, W. dinger, (Eds.). The Revised Report on the Algorithmic Language Scheme. SIGPLAN Notices 21, 11 (1986).
7. J. C. Reynolds. GEDANKEN - A Simple Typeless Language based on the Principle of Completeness and the Reference Concept. CACM 13, 308-319 (1970).
8. D. Scott. Data Types as Lattices. SIAM Journal of Computing 5 (1976).
9. G. J. Sussman, G. L. Steele, Jr. Scheme: An Interpreter for an Extended Lambda Calculus. MIT Artificial Intelligence Memo 349 (1975).
10. R. D. Tennent. Principles of Programming Languages. Prentice-Hall International (1981).