Operational interpretations of an extension of Fω with control operators

Journal of Functional Programming

Volumn 6, Issue 3, 1996, Pages 393-417

  Harper, Robert ^a   Lillibridge, Mark ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042901810     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001775     Document Type: Article

References (43)

1. Appel, A. W. (1992) Compiling with Continuations. Cambridge University Press.
2. Breazu-Tannen, V., Coquand, Th., Gunter, C. A. and Scedrov, A. (1991) Inheritance as implicit coercion. Information & Computation 93:172-221.
3. Burstall, R., MacQueen, D. and Sannella, D. (1980) HOPE: An experimental applicative language. Proc. 1980 LISP Conference, pp. 136-143, Stanford, CA.
4. Cardelli, L. (1989) Typeful programming. Technical Report 45, DEC Systems Research Center.
5. Cardelli, L., Martini, S., Mitchell, J. C. and Scedrov, A. (1991) An extension of System F with subtyping. Research Report 80, Digital Systems Research Center, Palo Alto, CA.
6. 4 Report on the Algorithmic Language Scheme. LISP Pointers, 5(3):1-55.
7. 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.
8. Curien, P.-L. and Ghelli, G. (1990) Coherence of subsumption. Technical Report LIENS-90-10, Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris.
9. Duba, B., Harper, R. and MacQueen, D. (1991) Typing first-class continuations in ML. 18th ACM Symposium on Principles of Programming Languages.
10. Felleisen, M. and Hieb, R. (1992) The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science 10(2):235-271.
11. Fischer, M. J. (1993) Lambda-calculus schemata. LISP and Symbolic Computation 6(3/4):259-288.
12. Projet Formel. (1987) CAML: The reference manual. Technical report, INRIA-ENS.
13. Girard, J.-Y. (1972) Interprétation Fonctionnelle et Elimination des Coupures dans l'Arithmétique d'Ordre Supérieure. PhD thesis, Université Paris VII.
14. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types: Cambridge Tracts in Theoretical Computer Science vol. 7. Cambridge University Press.
15. Gordon, M., Milner, R. and Wadsworth, C. (1979) Edinburgh LCF: A Mechanized Logic of Computation: Lecture Notes in Computer Science 78. Springer-Verlag.
16. Griffin, T. (1990) A formulae-as-types notion of control. 17th ACM Symposium on Principles of Programming Languages, San Francisco, CA.
17. Harper, R., Duba, B. and MacQueen, D. (1993) Typing first-class continuations in ML. J. Functional Programming, 3(4):465-484, October. (See also (Duba et al., 1992).).
18. Harper, R. and Lillibridge, M. (1993) Explicit polymorphism and CPS conversion. 20th ACM Symposium on Principles of Programming Languages, pp. 206-219, Charleston, SC.
19. Harper, R. and Lillibridge, M. (1992) Polymorphic type assignment and CPS conversion. In: O. Danvy and C. Talcott, editors, Proc. ACM SIGPLAN Workshop on Continuations CW92, pp. 13-22, Stanford, CA. (Published as technical report STAN-CS-92-1426.)
20. Harper, R. and Lillibridge, M. (1993) Polymorphic type assignment and CPS conversion. LISP and Symbolic Computation, 6(4):361-380, November. (See also (Harper and Lillibridge, 1992).).
21. Harper, R. and Mitchell, J. C. (1993) On the type structure of Standard ML. ACM Trans, Programming Languages and Systems, 15(2):211-252, April.
22. Harper, R. and Morrisett, G. (1994) Compiling with non-parametric polymorphism. Technical Report CMU-CS-94-122, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. (Also published as Fox Memorandum CMU-CS-FOX-94-03.)
23. Haynes, C. T., Friedman, D. P. and Wand, M. (1986) Obtaining coroutines from continuations. J. Computer Languages, 11:143-153.
24. Hudak, P. and Wadler, P. (1990) Report on the Programming Language Haskell, Version 1.0. Research Report YALEU/DCS/RR-777, Yale University.
25. Kranz, D., Kelsey, R., Rees, J., Hudak, P., Philbin, J. and Adams, N. (1986) Orbit: An optimizing compiler for Scheme. Proc. SIGPLAN Symposium on Compiler Construction, pp. 219-233.
26. Leroy, X. (1992) Unboxed objects and polymorphic typing. Conference Record of the 19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 177-188, Albuquerque, NM.
27. Leroy, X. and Mauny, M. (1992) The Caml Light system, version 0.5 - documentation and user's guide. Technical Report L-5, INRIA.
28. MacQueen, D. (1986) Using dependent types to express modular structure. 13th ACM Symposium on Principles of Programming Languages.
29. Meyer, A. R. and Wand, M. (1985) Continuation semantics in typed lambda calculi (summary). In: R. Parikh, editor, Logics of Programs: Lecture Notes in Computer Science 193, pp. 219-224. Springer-Verlag.
30. Milner, R. (1978) A theory of type polymorphism in programming languages. J. Computer and System Sciences, 17:348-375.
31. Milner, R. and Tofte, M. (1991) Commentary on Standard ML. MIT Press.
32. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. MIT Press.
33. Mitchell, J. and Harper, R. (1988) The essence of ML. 15th ACM Symposium on Principles of Programming Languages, San Diego, CA.
34. Pierce, B. C. (1993) Intersection types and bounded polymorphism. In: M. Bezem and J. F. Groote, editors, Proc. International Conference on Typed Lambda Calculi and Applications, TLCA'93, pp. 346-360, Utrecht, The Netherlands. (Springer-Verlag LNCS 664.) (To appear in Mathematical Structures in Computer Science, 1995.)
35. Pierce, B. C. (1993) Intersection types and bounded polymorphism. In: M. Bezem and J. F. Groote, editors, Proc. International Conference on Typed Lambda Calculi and Applications, TLCA'93, pp. 346-360, Utrecht, The Netherlands. (Springer-Verlag LNCS 664.) (To appear in Mathematical Structures in Computer Science, 1995.)
36. Plotkin, G. (1975) Call-by-name, call-by-value, and the lambda calculus. Theoretical Computer Science 1:125-159.
37. Reppy, J. H. (1991) CML: A higher-order concurrent language. ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 293-305.
38. Reynolds, J. C. (1972) Definitional interpreters for higher-order programming languages. Conference Record of the 25th National ACM Conference, pp. 717-740, Boston, MA.
39. Reynolds, J. C. (1974) Towards a theory of type structure. Colloq. sur la Programmation: Lecture Notes in Computer Science 19, pp. 408-423. Springer-Verlag.
40. Reynolds, J. C. (1988) Preliminary design of the programming language Forsythe. Technical Report CMU-CS-88-159, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, June.
41. Reynolds, J. C. (1993) The discoveries of continuations. LISP and Symbolic Computation 6(3/4):233-248, November.
42. Steele, Jr., G. L. (1978) RABBIT: A compiler for SCHEME. Technical Report Memo 474, MIT AI Laboratory.
43. Tofte, M. (1990) Type inference for polymorphic references. Information and Computation 89:1-34, November.