Set constraints for destructive array update optimization

Journal of Functional Programming

Volumn 11, Issue 3, 2001, Pages 319-346

  Wand, Mitchell ^a   Clinger, William D ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035612136     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796801003938     Document Type: Article

References (24)

1. Aho, A. V., Sethi, R. and Ullman, J. D. (1986) Compilers: Principles, Techniques, and Tools. Addison-Wesley.
2. Aiken, A., Kozen, D., Vardi, M. and Wimmers, E. (1993) The complexity of set constraints. Computer Science Logic '93.
3. Chuang, T. and Goldberg, B. (1992) A syntactic approach to fixed point computation on finite domains. Proc. 1992 ACM Symposium on Lisp and Functional Programming, pp. 109-118.
4. Clinger, W. D. (1981) Foundations of actor semantics. PhD thesis, MIT.
5. Cousot, P. and Cousot, R. (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proceedings 4th ACM Symposium on Principles of Programming Languages, pp. 238-252.
6. Draghicescu, M. and Purushothaman, S. (1993) A uniform treatment of order of evaluation and aggregate update. Theor. Comput. Sci., 118, 231-262.
7. Flanagan, C. and Felleisen, M. (1995) Set-based analysis for full scheme and its use in soft-typing. Technical report COMP TR95-253. Department of Computer Science, Rice University.
8. Heintze, N. (1992) Set-based program analysis. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA.
9. Heintze, N. and Jaffar, J. (1990) A decision procedure for a class of set constraints. Proc. 5th IEEE Symposium on Logic in Computer Science, pp. 42-51. IEEE.
10. Hudak, Paul. (1986) A semantic model of reference counting and its abstraction. Proc. 1986 ACM Symposium on Lisp and Functional Programming, pp. 351-363. ACM.
11. Hudak, P. and Bloss, A. (1985) Avoiding copying in functional and logic programming languages. Conference record of the 12th ACM Symposium on Principles of Programming Languages, pp. 300-314. ACM.
12. Jones, N. D. (1981) Flow analysis of lambda expressions. International Colloquium on Automata, Languages, and Programming: Lecture Notes in Computer Science 115, pp. 114-128. Springer-Verlag.
13. Jones, N. D. and Muchnick, S. S. (1982) A flexible approach to interprocedural data flow analysis and progrms with recursive data structures. Conference Record of the 9th ACM Symposium on Principles of Programming Languages, pp. 66-74.
14. Nielson, F. (1985) Program transformations in a denotational setting. ACM Trans. Programming Lang. & Syst., 7(3), 359-379.
15. Palsberg, J. and Schwartzbach, M. I. (1994) Object-oriented Type Systems. Wiley.
16. Palsberg, J. and Schwartzbach, M. I. (1995) Safety analysis versus type inference. Information & Computation, 118(1), 128-141.
17. Sastry, A. V. S. and Clinger, W. (1994) Parallel destructive updating in strict functional languages. ACM Conference on Lisp and Functional Programming, pp. 263-272. (Lisp Pointers, 7(3).)
18. Sastry, A. V. S. and Clinger, W. (1994) Parallel destructive updating in strict functional languages. ACM Conference on Lisp and Functional Programming, pp. 263-272. (Lisp Pointers, 7(3).)
19. Sastry, A. V. S., Clinger, W. and Ariola, Z. (1993) Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates. Conference on Functional Programming Languages and Computer Architecture, pp. 266-275.
20. Schmidt, D. A. (1998) Data flow analysis is model checking of abstract interpretation. Proc. 1998 ACM Symposium on Principles of Programming Languages, pp. 38-48.
21. Sestoft, P. (1988) Replacing function parameters by global variables. MPhil thesis, DIKU, University of Copenhagen.
22. Shivers, O. (1991) Control-flow analysis of higher-order languages. PhD thesis, Carnegie-Mellon University.
23. Steckler, P. A. and Wand, M. (1997) Lightweight closure conversion. ACM Trans. Programming Lang. & Syst., January, 48-86. (Original version appeared in Proc. 21st Annual ACM Symposium on Principles of Programming Languages, 1994.)
24. Steckler, P. A. and Wand, M. (1997) Lightweight closure conversion. ACM Trans. Programming Lang. & Syst., January, 48-86. (Original version appeared in Proc. 21st Annual ACM Symposium on Principles of Programming Languages, 1994.)