Safety of strictness analysis via term graph rewriting

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

Volumn 1824 LNCS, Issue , 2000, Pages 95-114

  Clark, David ^a   Hankin, Chris ^a   Hunt, Sebastian ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b CITY UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SEMANTICS; STATIC ANALYSIS; GRAPHIC METHODS;

ABSTRACT REDUCTION; AS GRAPH; FORMALISATION; FUNCTIONAL LANGUAGES; REWRITE SYSTEMS; REWRITING SYSTEMS; STRICTNESS ANALYSIS; TERM GRAPH REWRITING;

GRAPHIC METHODS; STATIC ANALYSIS;

EID: 34848872068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_6     Document Type: Conference Paper

References (25)

1. S. Abramsky and C.L. Hankin, editors. Abstract Interpretation of Declarative Languages. Computers and Their Applications. Ellis Horwood, 1987
2. Z. Ariola and J. W. Klop. Equational term graph rewriting. Fundamentae Informatica, 26(3,4):207-240, June 1996
3. Zena Ariola and Arvind. Properties of a first-order functional language with sharing. Theoretical Computer Science, 146(1- 2):69-108, July 1995
4. Zena Ariola and Stefan Blom. Cyclic lambda calculi. In Proc. TACS'97. Springer-Verlag, February 1997. LNCS 1281
5. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewrit ing. In Proc. PARLE 87, volume 2, pages 141-158. Springer-Verlag LNCS 259, Eindhoven, The Netherlands, June 1987
6. Erik Barendsen and Sjaak Smetsers. Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science, 6:579-612, 1996
7. Tyng-Ruey Chuang and Benjamin Goldberg. A syntactic approach to fixed point computation on finite domains. In Proc. 1992 ACM Conference on LISP and Functional Programming. ACM, June 1992
8. D. J. Clark and C. Hankin. A lattice of abstract graphs. In M. Bruynooghe and J Penjam, editors, Proc. Programming Language Implementation and Logic Programming, pages 318-331, Tallinn, Estonia, August 1993. Springer-Verlag LNCS 714
9. 9] David J. Clark. Term Graph Rewriting and Event Structures. PhD thesis, Imperial College, University of London, 1996
10. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice mode l for static analysis of programs by construction or approximation of fixed points. In Proc. Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, 1977
11. A.D. Gordon and A.M. Pitts, editors. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge University Press, 1998
12. E. Goubault and C. L. Hankin. A lattice for the abst ract interpretation of term graph rewriting systems. In Term Graph Rewriting, theory and practice, pages 131-140. John Wiley and Sons Ltd., 1993
13. J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Comparing curried and uncurried rewriting. J. Symbolic Computation, 21:15-39, 1996
14. Jan Willem Klop. Term rewriting systems. In Samson Abramsky, Dov M. Gabbay, and Tom Maibaum, edi tors, Handbook of Logic in Computer Science, volume 2, pages 1-116. Oxford University Press, New York, 1992
15. F. Nielson, H. R. Nielson, and C. L. Hankin. Principles of Program Analysis. Springer, 1999
16. E. N̈ ocker. Strictness analysis based on abstract reduction of term graph rewrite systems. In Proc. Workshop on Implementation of Lazy Functional Languages, 1988
17. E . N̈ocker. Strictness analysis using abstract reduction. In Proc. Conference on Functional Programming Languages and Computer Architectures (FPCA '93), Copenhagen, 1993. ACM Press
18. E. N̈ ocker. Efficient Functional Programming. PhD thesis, Department of Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands, 1994.
19. David Sands .Andrew Moran, Improvement in a lazy context: an operational theory for call-by-need, Proc. Twenty-sixth ACM Symposium on Principles of Programming Languages, San Antonio, Texas, January,1999.
20. M. Scḧ utz, M. Schmidt-Schauß and S. E. Panitz. Str ictness analysis by abstract reduction using a tableau calculus. In A. Mycroft, editor, Proc. Static Analysis, Second International Symposium, SAS '95, number 983 in Lecture Notes in Computer Science, pages 348-365, Glasgow, UK, Sept ember 1995. Springer Verlag
21. David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In Proc. 7'th International Conference on Functional Programming and Computer Architecture, San Diego, California, June 1995
22. M. C. J. van Eekelen, E. Goubault, C. L. Hankin, and E. N̈ocker. Abstract reduction: Towards a theory via abstract interpretation. In Term Graph Rewriting, theory and practice, pages 117-130. John Wiley and Sons Ltd., 1993
23. Vincent van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, 1994
24. Keith Wansbrough and Simon Peyton Jones. Once upon a polymorphic type. In Proc. T wenty-sixth ACM Symposium on Principles of Programming Languages, San Antonio, Texas, January 1999
25. Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 15 November 1994