A new criterion for safe program transformations

Electronic Notes in Theoretical Computer Science

Volumn 41, Issue 3, 2001, Pages 20-34

  Minamide, Yasuhiko ^a,b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILATION METHODS; FUNCTIONAL LANGUAGES; PERFORMANCE METRICS; PROGRAM TRANSFORMATIONS;

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; MATHEMATICAL TRANSFORMATIONS; MEASUREMENT THEORY; PERFORMANCE; PROGRAM COMPILERS; SEMANTICS; SUPERVISORY AND EXECUTIVE PROGRAMS;

PROGRAM TRANSLATORS;

EID: 18944370847     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80871-5     Document Type: Article

References (13)

1. Appel A.W. "Compiling with Continuation" 1992;Cambridge University Press
2. Bakewell A. and C. Runciman, A model for comparing the space usage of lazy evaluators, in: 2nd International Conference on Principles and Practice of Declarative Programming (PPDP 2000), 2000.
3. Blelloch, G. E. and J. Greiner, A provably time and space efficient implementation ofNESL, in: Proc. of ACM SIGPLAN International Conference on Functional Programming, 1996, pp. 213-225.
4. Danvy O., Filinski A. Representing control: a study of the CPS transformation. Mathematical Structures in Computer Science. 2:1992;361-391
5. Flanagan C., A. Sabry, B. F. Duba and M. Felleisen, The essence of compiling with continuations, in: Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation, 1993, pp. 237-247.
6. Greiner J. and G. E. Blelloch, A provably time-efficient parallel implementation of full speculation, in: Proc. of ACM Symposium on Principles of Programming Languages, 1996, pp. 309-321.
7. Gustavsson J., Sands D. A foundation for space-safe transformations of call-by-need programs. Proc. of the Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS99. ENTCS 26:1999
8. Minamide Y. A space-profiling semantics of call-by-value lambda calculus and the CPS transformation. Proc. of the Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS99). ENTCS 26:1999
9. Minamide Y. and J. Garrigue, On the runtime complexity of type-directed unboxing, in: Proc. of ACM SIGPLAN International Conference on Functional Programming, 1998, pp. 1-12.
10. Ohori A. and N. Yoshida, Type inference with rank 1 polymorphism for type-directed compilation of ML, in: Proc. of ACM SIGPLAN International Conference on Functional Programming, 1999, pp. 160- 171.
11. Santos, A. L., "Compilation by Transformation in Non-strict Functional Languages," Ph.D. thesis, Department of Computing Science, University of Glasgow (1995).
12. Shao Z., Flexible representation analysis, in: Proc. of ACM SIGPLAN International Conference on Functional Programming, 1997, pp. 85-98.
13. Tarditi D., G. Morrisett, P. Cheng, C. Stone, R. Harper and P. Lee, TIL: A type-directed optimizing compiler for ML, in: Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation, 1996, pp. 181-192.