Static analysis for safe destructive updates in a functional language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2372 LNCS, Issue , 2002, Pages 1-24

  Shankar, Natarajan ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; COMPUTER CIRCUITS; DATA STRUCTURES; LOGIC PROGRAMMING; SEMANTICS; SPECIFICATION LANGUAGES; SPECIFICATIONS; STATIC ANALYSIS; COMPUTATIONAL LINGUISTICS; RECONFIGURABLE HARDWARE;

AGGREGATE DATUM; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; IMPERATIVE PROGRAMS; IN-PLACE UPDATE; MATHEMATICAL ANALYSIS; PROOF OF CORRECTNESS; SPACE AND TIME;

FUNCTIONAL PROGRAMMING;

EID: 84879467705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45607-4_1     Document Type: Conference Paper

References (18)

1. A. Bloss and P. Hudak. Path semantics. In Proceedings of the Third Workshop on the Mathematical Foundations of Programming Language Semantics, number 298 in Lecture Notes in Computer Science, pages 476-489. Springer-Verlag, 1987
2. Adrienne Bloss. Path analysis and the optimization of nonstrict functional languages. ACM Transactions on Programming Languages and Systems, 16(3):328-369, 1994
3. M. Draghicescu and S. Purushothaman. A uniform treatment of order of evaluation and aggregate update. Theoretical Computer Science, 118(2):231-262, September 1993
4. M. Felleisen. On the expressive power of programming languages. In European Symposium on Programming, number 432 in Lecture Notes in Computer Science, pages 35-75. Springer-Verlag, 1990
5. K. Gopinath and John L. Hennessy. Copy elimination in functional languages. In 16th ACM Symposium on Principles of Programming Languages. Association for Computing Machinery, January 1989
6. Deepak Goyal and Robert Paige. A new solution to the hidden copy problem. In Static Analysis Symposium, pages 327-348, 1998
7. P. Hudak. A semantic model of reference counting and its abstraction. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages. Ellis Horwood Ltd., 1987. Preliminary version appeared in Proceedings of 1986 ACM Conference on LISP and Functional Programming, August 1986, pages 351-363
8. Martin Odersky. How to make destructive updates less destructive. In Proc. 18th ACM Symposium on Principles of Programming Languages, pages 25-26, January 1991
9. S. Owre, J. M. Rushby, and N. Shankar. PVS:A prototype verification system. In Deepak Kapur, editor, 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752, Saratoga, NY, June 1992. Springer-Verlag
10. Sam Owre and Natarajan Shankar. The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park, CA, August 1997
11. A. Pettorossi. Improving memory utilization in transforming recursive programs. In J. Winkowski, editor, Proceedings of MFCS 1978, pages 416-425, Berlin, Germany, 1978. Springer-Verlag
12. Alberto Pettorossi and Maurizio Proietti. Synthesis and transformation of logic programs using unfold/fold proofs. Journal of Logic Programming, 41(2-3):197-230, 1999
13. A. V. S. Sastry, William Clinger, and Zena Ariola. Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates. In Conference on Functional Programming Languages and Computer Architecture, pages 266-275, New York, 1993. ACM Press
14. Jerald Schwarz. Using annotation to make recursion equations behave. IEEE Transactions on Software Engineering, 8(1):21-33, 1982
15. John H. G. van Groningen. The implementation and efficiency of arrays in Clean 1.1. In Proc. 8th International Workshop on Implementation of Functional Languages, IFL'96, number 1268 in Lecture Notes in Computer Science, pages 105-124. Springer-Verlag, 1996
16. P. Wadler. Linear types can change the world! In M. Broy and C. Jones, editors, Programming Concepts and Methods. North-Holland, Amsterdam, 1990
17. P. Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240-263, September 1997
18. Mitchell Wand and William D. Clinger. Set constraints for destructive array update optimization. In Proc. IEEE Conf. on Computer Languages '98, pages 184-193. IEEE, April 1998.