Retraction Approach to CPS Transform

Higher-Order and Symbolic Computation

Volumn 11, Issue 2, 1998, Pages 145-175

  Kučan, Jakov ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

Continuation passing style; Continuations; CPS transform; Monads; Retractions

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; FORMAL LOGIC; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

CONTINUATION PASSING STYLE (CPS) TRANSFORMS; RETRACTION THEOREM;

COMPUTATIONAL LINGUISTICS;

EID: 0032292435     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010012532463     Document Type: Article

References (27)

1. Andrew W. Appel. Compiling with Continuations. Cambridge Universisty Press, 1992.
2. Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland Publishing Co., Amsterdam, second edition, 1984.
3. Roy L. Crole and Andrew M. Pitts. New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation, 98(2):171-210, June 1992.
4. Andrzej Filinski. Representing monads. In Symposium on Principles of Programming Languages, pages 446-457, Portland, Oregon, January 1994.
5. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. SIGPLAN Notices, 28(6):237-247, June 1993. Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation.
6. John Hatcliff and Olivier Danvy. A generic account of continuation-passing styles. In Proceedings of the 21st Symposium on Principles of Programming Languages, pages 458-471, Portland, Oregon, January 1994. ACM.
7. Jakov Kučan. Metatheorems about Convertibility in Typed Lambda Calculi: Applications to CPS Transform and "Free Theorems". PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, February 1997.
8. John C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76:211-249, 1988.
9. Eugenio Moggi. Computational lambda-caluclus and monads. Technical Report ECS-LFCS-88-86, University of Edinburgh, October 1988.
10. Eugenio Moggi. Computational lambda-caluclus and monads. In LICS, 1989.
11. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, July 1991.
12. David MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Control, 71(1/2):95-130, October/November 1986.
13. Albert R. Meyer and Jon G. Riecke. Continuations may be unreasonable. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 63-71, 1988.
14. Albert R. Meyer and Mitchell Wand. Continuation semantics in typed lambda-calculi (summary). In Rohit Parikh, editor, Logics of Programs: Proceedings, volume 193 of Lecture Notes in Computer Science, pages 219-224. Springer-Verlag, 1985.
15. G. D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1(2):125-159, December 1975.
16. John Reynolds. Toward a theory of type structure. In B. Robinet, editor, Programming Symposium, volume 19 of LNCS, pages 408-425. Springer-Verlag, Berlin, 1974.
17. John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4), November 1993.
18. Jon G. Riecke. Delimiting scope of side effects. In Proceedings of the 1993 Conference on Functional Programming and Computer Architecture, pages 146-158. ACM, 1993.
19. Jon G. Riecke and Ramesh Viswanathan. Isolating side effects in sequential languages. In Proceedings of Symposium on Principles of Programming Languages, 1995.
20. Amr Sabry and Matthias Felleisen. Reasoning about programs in continuation passing style. Lisp and Symbolic Computation, 6(3/4):289-360, 1993.
21. Ravi Sethi and A. Tang. Constructing call-by-value continuation semantics. Journal of the ACM, 27:580-597, 1980.
22. Guy L. Steele. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, MIT Artificial Intelligence Laboratory, 1978.
23. Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA, 1977.
24. Joseph E. Stoy. The congruence of two programming language definitions. Theoretical Computer Science, 13(2):151-174, February 1981.
25. C. Strachey and C. P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Report PRG-11, Oxford University Computing Laboratory, 1974.
26. Amr Sabry and Philip Wadler. A reflection on call-by-value. In International Conference on Functional Programing, Philadelphia, May 1996. ACM Press.
27. Philip Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2(4):461-493, December 1990.