Offline partial evaluation for shift and reset

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2004, Pages 3-14

  Asai, Kenichi ^a,b  

^a Northeastern University   (United States)

^b OCHANOMIZU UNIVERSITY   (Japan)

Author keywords

Binding time analysis (BTA); Continuation passing style (CPS); CPS transformation; Delimited continuations; Logical relations; Offline partial evaluation

Indexed keywords

CONSTRAINT THEORY; EVALUATION; FORMAL LOGIC; FUNCTIONS; SEMANTICS; TIME SERIES ANALYSIS;

BINDING-TIME ANALYSIS; CONTINUATION-PASSING STYLE; LOGICAL RELATIONS; OFFLINE PARTIAL EVALUATION; PROGRAMMING TECHNIQUES;

PROGRAM DOCUMENTATION;

EID: 11244284789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014007.1014009     Document Type: Conference Paper

References (17)

1. Asai, K. "Online Partial Evaluation for Shift and Reset," ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '02), pp. 19-30 (January 2002).
2. Asai, K. "Reflecting on the Metalevel Interpreter Written in Direct Style," Presented at the International Lisp Conference 2003 (ILC 2003), New York City, 12 pages (October 2003).
3. Danvy, O. "A New One-Pass Transformation into Monadic Normal Form," Proceedings of the 12th International Conference on Compiler Construction (CC2003), LNCS 2622, pp. 77-89 (April 2003).
4. Danvy, O., and A. Filinski "A Functional Abstraction of Typed Contexts," Technical Report 89/12, DIKU, University of Copenhagen (July 1989).
5. Danvy, O., and A. Filinski "Abstracting Control," Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pp. 151-160 (June 1990).
6. Danvy, O., and A. Filinski "Representing Control, a Study of the CPS Transformation," Mathematical Structures in Computer Science, Vol. 2, No. 4, pp. 361-391 (December 1992).
7. Danvy, O., and L. R. Nielsen "A First-Order One-Pass CPS Transformation," Theoretical Computer Science, Vol. 308, Nos. 1-3, pp. 239-257 (November 2003).
8. Flanagan, C., A. Sabry, B. F. Duba, and M. Felleisen "The Essence of Compiling with Continuations," Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation (PLDI), pp. 237-247 (June 1993).
9. Gasbichler, M., and M. Sperber "Final Shift for Call/cc: Direct Implementation of Shift and Reset," Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP'02), pp. 271-282 (October 2002).
10. Henglein, F. "Efficient Type Inference for Higher-Order Binding-Time Analysis," In J. Hughes, editor, Functional Programming Languages and Computer Architecture (LNCS 523), pp. 448-472 (August 1991).
11. Jones, N. D., C. K. Gomard, and P. Sestoft Partial Evaluation and Automatic Program Generation, New York: Prentice-Hall (1993).
12. 5 Report on the Algorithmic Language Scheme," Higher-Order and Symbolic Computation, Vol. 11, No. 1, pp. 7-105, Kluwer Academic Publishers (August 1998).
13. Lawall, J. L., and O. Danvy "Continuation-Based Partial Evaluation," Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pp. 227-238 (June 1994).
14. Thiemann, P. "Towards Partial Evaluation of Full Scheme," Proceedings of Reflection'96, pp. 105-115 (April 1996).
15. Thiemann, P. J. "Cogen in Six Lines," Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP'96), pp. 180-189 (May 1996).
16. Thiemann, P. "Combinators for Program Generation," Journal of Functional Programming, Vol. 9, No. 5, pp. 483-525, Cambridge University Press (September 1999).
17. Wand, M. "Specifying the Correctness of Binding-Time Analysis," Journal of Functional Programming, Vol. 3, No. 3, pp. 365-387, Cambridge University Press (July 1993).