Typing first-class continuations in ML

Journal of Functional Programming

Volumn 3, Issue 4, 1993, Pages 465-484

  Duba, Bruce F ^a   Macqueen, David ^b   Harper, R ^c  

^a RICE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84972049003     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S095679680000085X     Document Type: Article

References (42)

1. Appel, A. W. and MacQueen, D. B. (1991) Standard ML of New Jersey. In J. Maluszynski and M. Wirsing, editors, Third International Symposium on Programming Language Implementation and Logic Programming, pp. 1-13, August. Springer-Verlag.
2. Clinger, W., Friedman, D. P. and Wand, M. (1985) A scheme for higher-level semantic algebra. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, pp. 237-250. Cambridge University Press.
3. Cooper, E. C. and Morrisett, J. G. (1990) Adding threads to Standard ML. Technical Report CMU-CS-90-186, School of Computer Science, Carnegie Mellon University.
4. Damas, L. and Milner, R. (1982) Principal type schemes for functional programs. In Ninth ACM Symposium on Principles of Programming Languages, pp. 207-212.
5. Duba, B., Harper, R. and MacQueen, D. (1991) Typing first-class continuations in ML. In Eighteenth ACM Symposium on Principles of Programming Languages, January.
6. Dybvig, R. K. and Hieb, B. (1989) Engines from continuations. Journal of Computer Languages, 14(2): 109-124.
7. Evans, A. (1968) PAL-a language designed for teaching programming linguistics. In Proc. ACM 23rd National Conference, pp. 395-403, Princeton. ACM, Brandin Systems Press.
8. Felleisen, M. (1985) Transliterating Prolog into Scheme. Technical Report 182, Indiana University Computer Science Department.
9. Felleisen, M. (1988) The theory and practice of first-class prompts. In Fifteenth ACM Symposium on Principles of Programming Languages, pp. 180-190, San Diego, CA. ACM.
10. Felleisen, M. and Friedman, D. (1986) Control operators, the SECD machine, and the Xcalculus. In Formal Description of Programming Concepts III. North-Holland, Amsterdam.
11. Felleisen, M., Friedman, D., Kohlbecker, E. and Duba, B. (1986) Reasoning with continuations. In First Symposium on Logic in Computer Science. IEEE, June.
12. Felleisen, M., Friedman, D., Kohlbecker, E. and Duba, B. (1987) A syntactic theory of sequential control. Theoretical Computer Science, 52 (3): 205-237.
13. Filinski, A. (1989) Declarative continuations: An investigation of duality in programming language semantics in Summer Conference on Category Theory and Computer Science, Manchester, UK, volume 389 of Lecture Notes in Computer Science. Springer-Verlag.
14. Filinski, A. (1989) Declarative continuations and categorical duality. Master's thesis. University of Copenhagen, Denmark, August. (DIKU Report 89/11.)
15. Friedman, D. P., Haynes, C. T. and Kohlbecker, E. (1985) Programming with continuations. In P. Pepper, editor, Program Transformations and Programming Environments, pages 263-274. Springer-Verlag.
16. Griffin, T. (1990) A formulae-as-types notion of control. In Seventeenth ACM Symposium on Principles of Programming Languages, San Francisco, CA, January. ACM.
17. Griffin, G. T. (1992) Logical interpretations and computational simulations. Technical memoranda, AT & T Bell Laboratories, in preparation.
18. Harper, R. and Lillibridge, M. (1992) Polymorphic type assignment and CPS conversion. In O. Danvy and C. Talcott, editors, Proceedings of the ACM SIGPLAN Work-shop on Continuations CW92, pp. 13-22, Stanford, CA 94305, June. Department of Computer Science, Stanford University. Published as technical report STAN-CS-92-1426.
19. Haynes, C. T. (1987) Logic continuations. Journal of Logic Programming, 4: 157-176.
20. Haynes, C. T. and Friedman, D. P. (1987) Abstracting timed preemption with engines. Journal of Computer Languages, 12: 109-121.
21. Haynes, C. T. and Friedman, D. P. (1987) Embedding continuations in procedural objects. ACM Transactions on Programming Languages and Systems, 9: 582-598.
22. Haynes, C. T., Friedman, D. P. and Wand, M. (1986) Obtaining coroutines from continuations. Journal of Computer Languages, 11: 143-153.
23. Landin, P. J. (1965) A correspondence between ALGOL-60 and Church's lambda notation. Communications of the ACM, 8: 89-101.
24. Meyer, A. R. and Wand, M. (1985) Continuation semantics in typed lambda calculi (summary). In R. Parikh, editor, Logics of Programs, volume 224 of Lecture Notes in Computer Science, pp. 219-224. Springer-Verlag.
25. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. MIT Press.
26. Plotkin, G. (1980) Lambda-definability in the full type hierarchy. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pp. 363-373. Academic Press.
27. Ramsey, N. (1990) Concurrent programming in ML. Technical Report CS-TR-262-90, Computer Science Department, Princeton University.
28. Reppy, J. (1989) First-class synchronous operations in standard ML. Technical Report TR 89-1068, Computer Science Department, Cornell University, Ithaca, NY, December.
29. Reppy, J. (1990) Asynchronous signals in Standard ML (unpublished manuscript), August.
30. Reynolds, J. C. (1970) GEDANKEN-a simple typeless language based on the principle of completeness and the reference concept. Communications of the ACM, 13 (5): 308-319, May.
31. Reynolds, J. C. (1972) Definitional interpreters for higher-order programming languages. In Conference Record of the 25th National ACM Conference, pp. 717-740, Boston, August. ACM.
32. Sitaram, D. and Felleisen, M. (1990) Reasoning with continuations. II. Full abstraction for models of control. In Proc. 1990 Conference on LISP and Functional Programming, pp. 161-175, June.
33. Statman, R. (1985) Logical relations and the typed λ-calculus. Information and Control, 65: 85-97.
34. Strachey, C. and Wadsworth, C. (1974) A Mathematical Semantics for Handling Full Jumps. Technical Report Technical Monograph PRG-11, Oxford University Computing Laboratory.
35. Sufrin, B. (1979) CSP-style processes in ML (private communication).
36. Sussman, G. J. and Steele, G. L. Jr. (1975) Scheme: An Interpreter for Extended Lambda Calculus. Technical Report Memo no. 349, MIT AI Laboratory, December.
37. Talcott, C. (1988) Rum: An intensional theory of function and control abstractions. In Proc. 1987 Workshop of Foundations of Logic and Functional Programming, volume 306 of Lecture Notes in Computer Science. Springer-Verlag.
38. Tofte, M. (1988) Operational Semantics and Polymorphic Type Inference. PhD thesis, Edinburgh University, 1988. Available as Edinburgh University Laboratory for Foundations of Computer Science Technical Report ECS-LFCS-88-54.
39. Tofte, M. (1990) Type inference for polymorphic references. Information and Computation, 89: 1-34, November.
40. Wand, M. (1980) Continuation-based multiprocessing. In Conference Record of the 1980 LISP Conference, pp. 19-28.
41. Wright, A. and Felleisen, M. (1990) The nature of exceptions in polymorphic languages. Unpublished manuscript, Rice University.
42. Wright, A. K. and Felleisen, M. (1991) A Syntactic Approach to Type Soundness. Technical Report TR91-160, Department of Computer Science, Rice University. To appear in Information and Computation.