Exception analysis for non-strict languages

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 98-109

  Glynn, Kevin ^a   Stuckey, Peter J ^a   Sulzmann, Martin ^a,b   Søndergaard, Harald ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Boolean constraints; Effect systems; Exceptions; Non strict functional programming languages; Type inference

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING LANGUAGES; INFERENCE ENGINES; PROGRAM COMPILERS; SEMANTICS;

BOOLEAN CONSTRAINTS; FUNCTIONAL PROGRAMMING LANGUAGE; NON STRICT LANGUAGES;

DATA FLOW ANALYSIS;

EID: 0036953866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/581478.581488     Document Type: Conference Paper

References (16)

1. K. Arnold, J. Gosling, and D. Holmes. The Java Programming Language. Addison-Wesley, third edition, 2000.
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 Lecture Notes in Computer Science, pages 118-135. Springer, 1995.
3. M. Fähndrich and A. Aiken. Program analysis using mixed term and set constraints. In P. Van Hentenryck, editor, Static Analysis: Proc. Fourth Int. Symp., volume 1302 of LNCS, pages 114-126. Springer, 1997.
4. M. Fähndrich and A. Aiken. Refined type inference for ML. In First International Workshop on Types in Compilation (TIC'97), 1997.
5. M. Fähndrich and J. Rehof. Type-based flow analysis: From polymorphic subtyping to CFL reachability. In Proc. 28th ACM Symp. Principles of Programming Languages, pages 54-66. ACM Press, 2001.
6. J. S. Foster, M. Fähndrich, and A. Aiken. A theory of type qualifiers. In Proc. 1999 ACM Conf. Programming Language Design and Implementation, pages 192-203. ACM Press, 1999.
7. K. Glynn, P. J. Stuckey, and M. Sulzmann. Effective strictness analysis with Horn constraints. In P. Cousot, editor, Static Analysis: Proc. Eighth Int. Symp. Static Analysis, volume 2126 of Lecture Notes in Computer Science, pages 73-92. Springer, 2001.
8. K. Glynn, P. J. Stuckey, M. Sulzmann, and H. Søndergaard. Boolean constraints for binding-time analysis. In O. Danvy and A. Filinsky, editors, Programs as Data Objects: Proceedings of the Second Symposium, volume 2053 of LNCS, pages 39-63. Springer, 2001.
9. J. Guzmán and A. Suárez. An extended type system for exceptions. In ACM SIGPLAN Workshop on ML and Its Applications, 1994.
10. P. Jouvelot and D. Gifford. Algebraic reconstruction of types and effects. In Proc. 18th ACM Symp. Principles of Programming Languages, pages 303-310. ACM Press, 1991.
11. X. Leroy. The Objective Caml system, 1996. http://pauillac.inria.fr/ocaml/.
12. R. Milner, M. Tofte, and R.W. Harper. The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1990.
13. F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Proc. 26th ACM Symp. Principles of Programming Languages, pages 276-290. ACM Press, 1999.
14. S. L. Peyton Jones, A. Reid, T. Hoare, S. Marlow, and F. Henderson. A semantics for imprecise exceptions. In Proc. 1999 ACM SIGPLAN Conf. Programming Language Design and Implementation, pages 25-36. ACM Press, 1999.
15. S. Peyton Jones et al. Report on the programming language Haskell 98. Technical report, February 1999. http:/haskell.org.
16. K. Yi. An abstract interpretation for estimating uncaught exceptions in Standard ML programs. Science of Computer Programming, 31 (1):147-173, 1998.