Space-profiling semantics of the call-by-value lambda calculus and the CPS transformation

Electronic Notes in Theoretical Computer Science

Volumn 26, Issue , 1999, Pages 105-120

  Minamide, Yasuhiko ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); STORAGE ALLOCATION (COMPUTER); SUPERVISORY AND EXECUTIVE PROGRAMS;

FUNCTIONAL LANGUAGES; LAMBDA CALCULUS; PROGRAM TRANSFORMATIONS; SPACE-PROFILING SEMANTICS;

SEMANTICS;

EID: 18944389988     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80286-5     Document Type: Conference Paper

References (15)

1. Appel A.W. Compiling with Continuation. 1992;Cambridge University Press
2. Blelloch G.E., Greiner J. A provably time and space efficient implementation of NESL. Proc. of ACM SIGPLAN International Conference on Functional. Programming. 1996;213-225
3. Chase D.R. Safety consideration for storage allocation optimization. Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation. 1988;1-10
4. Danvy O., Filinski A. Representing control: a study of the CPS transformation. Mathematical Structures in Computer Science. 2:(4):1992;361-391
5. Fischer M. Lambda calculus schemata. Proc. of the ACM Conference on Proving Assertions About Programs, SIGPLAN Notices. 7:(1):1972
6. Flanagan C., Sabry A., Duba B.F., Felleisen M. The essence of compiling with continuations. Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation. 1993;237-247
7. Greiner J., Blelloch G.E. A provably time-efficient parallel implementation of full speculation. Proc. of ACM Symposium on Principles of Programming Languages. 1996;309-321
8. 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). 1999
9. Leroy X. Unboxed objects and polymorphic typing. Proc. of ACM Symposium on Principles of Programming Languages. 1992;177-188
10. Minamide Y., Garrigue J. On the runtime complexity of type-directed unboxing. Proc. of ACM SIGPLAN International Conference on Functional Programming. 1998;1-12
11. Morrisett G., Felleisen M., Harper R. Abstract models of memory management. Proc. of ACM Symposium on Functional Programming Languages and Computer Architecture. 1995;66-77
12. Morrisett G., Harper R. Semantics of memory management for polymorphic languages. Technical report, School of Computer Science, Carnegie Mellon University, CMU-CS-96-176. 1996
13. Plotkin G.D. Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science. 1:(2):December 1975;125-159
14. Sands D. Complexity analysis for a lazy higher-order language. Proc. of European Symposium on Programming. 1990;361-375
15. Shao Z., Appel A.W. Space-efficient closure representations. Proc. of ACM Conference on Lisp and Functional Programming. 1994;150-161