Effective strictness analysis with HORN constraints

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

Volumn 2126 LNCS, Issue , 2001, Pages 73-92

  Glynn, Kevin ^a   Stuckey, Peter J ^a   Sulzmann, Martin ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC DATA-TYPES; BOOLEAN CONSTRAINT; CONSTRAINT-BASED; EFFICIENT IMPLEMENTATION; HASKELL; HIGHER ORDER FUNCTIONS; STRICTNESS ANALYSIS; STYLE LANGUAGES;

STATIC ANALYSIS;

EID: 0012619851     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47764-0_5     Document Type: Conference Paper

References (14)

1. G. L. Burn, C. L. Hankin, and S. Abramsky. The theory and practice of strictness for higher order functions. Science of Computer Programming, 7: 249-278, 1986.
2. D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In A. Mycroft, editor, Proc. Second Int. Symp. Static Analysis, Volume 983 of LNCS, pages 118-135. Springer-Verlag, 1995.
3. K. Glynn, P. J. Stuckey, M. Sulzmann, and H. Søndergaard. Boolean constraints for binding-time analysis. To appear in Second Symposium on Programs as Data Objects (PADO-II), Volume 2053 of LNCS. Springer-Verlag, 2001.
4. K. Jensen, P. Hjæresen, and M. Rosendahl. Efficient strictness analysis for haskell. In Proceedings of the First International Static Analysis Symposium, Volume 864 of LNCS, pages 346-362. Springer-Verlag, 1994.
5. T. Jensen. Disjunctive program analysis for algebraic data types. ACM Trans. on Programming Languages and Systems, 19(5): 751-803, 1997.
6. T. Jensen. Inference of polymorphic and conditional strictness properties. In Proc. Twenty-Fifth ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. ACM Press, 1998.
7. T. Kuo and P. Mishra. Strictness analysis: A new perspective based on type inference. In Functional Programming Languages and Computer Architecture, pages 260-272, September 1989.
8. A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, 1981.
9. E. Nocker. Strictness analysis using abstract reduction. In Proceedings Conference on Functional Programming Languages and Computer Architectures (FPCA '93). ACM Press, 1993.
10. S. Peyton Jones and W. Partain. Measuring the effectiveness of a simple strictness analyser. In Hammond and O'Donnell, editors, Functional Programming, Glasgow 1993, Springer Workshops in Computer Science, pages 201-220, 1993.
11. J. Seward. Beyond prototype implementations: Polymorphic projection analysis for glasgow haskell. In Proceedings of the Second International Static Analysis Symposium, Volume 983 of LNCS, pages 382-399. Springer-Verlag, 1995.
12. P. Wadler. Strictness analysis on non-flat domains. In S. Abramsky and C.L. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 266-275. Ellis Horwood, 1987.
13. P. Wadler and J. Hughes. Projections for strictness analysis. In Proceedings of the 3rd International Conference on Functional Programming Languages and Computer Architecture, Volume 274 of LNCS, pages 385-407. Springer, 1987.
14. D.A. Wright. A new technique for strictness analysis. In Proceedings of TAPSOFT, Volume 494 of LNCS, pages 235-258. Springer, 1991.