Natarajan Shankar  Home/Search
Context Related
| sri.com/pub/users/shan...lopstr01.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sri.com/users/sh...shankarpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Functional programs are more amenable to rigorous mathematical analysis than imperative programs, but are typically less ef- cient in terms of execution space and time. The update of aggregate data structures, such as arrays, are a signi cant source of space/time ine ciencies in functional programming. Imperative programs can execute such updates in place, whereas the semantics of functional languages require aggregate data structures to be copied and updated. In many functional... (Update)
Cited by: More
Technical Report SRI-CSL-03-05 - November Updated January (Correct)
Similar documents (at the sentence level):
15.8%: Static Analysis for Safe Destructive Updates (Extended Abstract) - Shankar (2001) (Correct)
Active bibliography (related documents): More All
0.5: Efficiently Executing PVS - Shankar (Correct)
0.3: Automatic Accurate Stack Space and Heap Space Analysis.. - Unnikrishnan, Stoller, .. (2000) (Correct)
0.3: A Practical Approach to Structure Reuse of Arrays in Single.. - Andreas Kagedal (1997) (Correct)
Similar documents based on text: More All
0.4: Verification by Abstraction - Shankar (Correct)
0.2: Little Engines of Proof - Shankar (2002) (Correct)
0.1: Formal Verification of a Combination Decision Procedure - Ford, Shankar (2002) (Correct)
BibTeX entry: (Update)
Natarajan Shankar. Static analysis for safe destructive updates in a functional language. In A. Pettorossi, editor, 11th International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR 01), volume 2372 of Lecture Notes in Computer Science, pages 1--24, Paphos, Cyprus, November 2002. Springer-Verlag. http://citeseer.ist.psu.edu/article/shankar01static.html More
@misc{ shankar02static,
author = "N. Shankar",
title = "Static analysis for safe destructive updates in a functional language",
text = "Natarajan Shankar. Static analysis for safe destructive updates in a functional
language. In A. Pettorossi, editor, 11th International Workshop on Logic-based
Program Synthesis and Transformation (LOPSTR 01), volume 2372 of Lecture
Notes in Computer Science, pages 1--24, Paphos, Cyprus, November 2002. Springer-Verlag.",
year = "2002",
url = "citeseer.ist.psu.edu/article/shankar01static.html" }
Citations (may not include all citations):184 Linear types can change the world - Wadler - 1990
113 Computer Science Laboratory (context) - Owre, Shankar et al. - 1997
78 PVS: A prototype veri cation system (context) - Owre, Rushby et al. - 1992
72 A semantic model of reference counting and its abstraction - Hudak - 1986
62 How to declare an imperative - Wadler - 1997
51 the expressive power of programming languages - Felleisen - 1990
20 Set constraints for destructive array update optimization - Wand, Clinger - 1998
17 Path semantics (context) - Bloss, Hudak - 1987
17 Order-of-evaluation analysis for destructive updates in stri.. - Sastry, Clinger et al. - 1993
16 Copy elimination in functional languages (context) - Gopinath, Hennessy - 1989
15 Path analysis and the optimization of nonstrict functional l.. (context) - Bloss - 1994
12 A uniform treatment of order of evaluation and aggregate upd.. - Draghicescu, Purushothaman - 1993
9 How to make destructive updates less destructive - Odersky - 1991
5 A new solution to the hidden copy problem - Goyal, Paige - 1998
2 The implementation and eciency of arrays in Clean (context) - van Groningen - 1996
1 Using annotation to make recursion equations behave (context) - Schwarz - 1982
1 Synthesi and transformation logic program using unfoldfold p.. (context) - Pettorossi, Synthesis et al. - 1999
1 Improving memory utilization in transforming recursive progr.. (context) - Pettorossi - 1978
Documents on the same site (http://www.csl.sri.com/users/shankar/shankar-papers.html): More
Proof Search in First-order Linear Logic and Other Cut-free.. - Lincoln, Shankar (1994) (Correct)
Formal Verification of a Combination Decision Procedure - Ford, Shankar (2002) (Correct)
Proof Search in the Intuitionistic Sequent Calculus - Appeared In Proc (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC