A type-based escape analysis for functional languages

Journal of Functional Programming

Volumn 8, Issue 3, 1998, Pages 239-273

  Hannan, John ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032388308     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796898003025     Document Type: Article

References (22)

1. Amtoft, T. (1993) Minimal thunkification. In: Cousot, P., Falaschi, M., Filè, G. and Rauzy, A., editors, Proceedings of the 3rd International Workshop on Static Analysis: Lecture Notes in Computer Science 724, pp. 218-229. Springer-Verlag.
2. Appel, A. W. (1992) Compiling with Continuations. Cambridge University Press.
3. Baker-Finch, C. A. (1994) Type theory and projections for higher-order static analysis. In: Sestoft, P. and Sondergaard, H., editors, Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pp 43-52. ACM SIGPLAN, ACM Press.
4. Banerjee, A. and Schmidt, D. A. (1994) Stackability in the simply-typed call-by-value lambda calculus. In: Charlier, B. L., editor, First International Static Analysis Symposium: Lecture Notes in Computer Science 864, pp. 131-146. Springer-Verlag.
5. Barendregt, H., (1984) The Lambda Calculus: Its Syntax and Semantics: Studies in Logic and the Foundations of Mathematics 103. North-Holland.
6. Burns, P. H. (1996) A space efficient implementation of a functional language. Honors thesis, Pennsylvania State University, University Park, PA.
7. Damas, L. (1985) Type Assignment in Programming Languages. PhD thesis University of Edinburgh. Available as CST-33-85.
8. Goldberg, B. and Park, Y. G. (1990) Higher order escape analysis: Optimizing stack allocation in functional program implementations. In: Jones, N., editor, Proceedings of the 3rd European Symposium on Programming: Lecture Notes in Computer Science 432, pp. 152-160. Springer-Verlag.
9. Hannan, J. and Miller, D. (1992) From operational semantics to abstract machines. Mathematical Structures in Computer Science, 2(4): 415-459. (Appears in a special issue devoted to the 1990 ACM Conference on Lisp and Functional Programming.)
10. Hannan, J. and Pfenning, F. (1992) Compiler verification in LF. In: Scedrov, A., editor, Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 407-418. IEEE Press.
11. Hannan, J. (1995) Type systems for closure conversions. In: Nielson, H. R. and Solberg, K. L., editors, Participants' Proceedings of the Workshop on Types for Program Analysis, pp. 48-62. Aarhus University, DAIMI PB-493.
12. Ibarra, M. E. (1997) Verification of a type-based escape analysis for functional languages in a logical framework. Master's thesis, Pennsylvania State University, University Park, PA.
13. Kranz, D. (1988) ORBIT: An Optimizing Compiler for Scheme. PhD thesis, Yale University.
14. Kuo, T.-M. and Mishra, P. (1989) Strictness analysis: A new perspective based on type inference. Fourth International Conference on Functional Programming and Computer Architecture, pp. 260-272. ACM Press.
15. Milner, R. and Tofte, M. (1991) Co-induction in relational semantics. Theoretical Computer Science, 87(1): 209-220.
16. Milner, R. (1978) A theory of type polymorphism in programming. J. Computer and System Sciences, 17(3): 348-375.
17. Pfenning, F. (1991) Logic programming in the LF logical framework. In: Huet, G. and Plotkin, G., editors, Logical Frameworks, pp. 149-181. Cambridge University Press.
18. Sestoft, P. (1991) Analysis and Efficient Implementation of Functional Programs. Rapport nr 92/6, DIKU, Copenhagen.
19. Shao, Z. and Appel, A. W. (1994) Space-efficient closure representations. Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pp. 150-161. ACM Press.
20. Tofte, M. and Talpin, J.-P. (1994) Implementation of the typed call-by-value λ-calculus using a stack of regions. Conf. Rec. 21st ACM Symposium on Principles of Programming Languages, pp. 188-201.
21. Wand, M. and Steckler, P. (1997) Lightweight closure conversion. ACM Trans. Program. Lang. Syst., 19(1): 48-86.
22. Wright, D. A. (1991) A new technique for strictness analysis. In: Abramsky, S. and Maibaum, T., editors, TAPSOFT '91, pp. 235-258.