Exception analysis for non-strict languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Exception analysis for non-strict languages

Full text

Pdf (241 KB)

Source

International Conference on Functional Programming archive
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming table of contents

Pittsburgh, PA, USA

Pages: 98 - 109

Year of Publication: 2002

ISBN:1-58113-487-8

Also published in ...

Authors

Kevin Glynn	Université catholique de Louvain, Belgium
Peter J. Stuckey	The University of Melbourne, Vic., Australia
Martin Sulzmann	National University of Singapore
Harald Søndergaard	The University of Melbourne, Vic., Australia

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 21, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/581478.581488 What is a DOI?

ABSTRACT

In this paper we present the first exception analysis for a non-strict language. We augment a simply-typed functional language with exceptions, and show that we can define a type-based inference system to detect uncaught exceptions. We have implemented this exception analysis in the GHC compiler for Haskell, which has been recently extended with exceptions. We give empirical evidence that the analysis is practical.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ken Arnold , James Gosling , David Holmes, The Java Programming Language, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
	2	Dirk Dussart , Fritz Henglein , Christian Mossin, Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time, Proceedings of the Second International Symposium on Static Analysis, p.118-135, September 25-27, 1995
	3	Manuel Fähndrich , Alexander Aiken, Program Analysis Using Mixed Term and Set Constraints, Proceedings of the 4th International Symposium on Static Analysis, p.114-126, September 08-10, 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	Jakob Rehof , Manuel Fähndrich, Type-base flow analysis: from polymorphic subtyping to CFL-reachability, Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.54-66, January 2001, London, United Kingdom
	6	Jeffrey S. Foster , Manuel Fähndrich , Alexander Aiken, A theory of type qualifiers, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, p.192-203, May 01-04, 1999, Atlanta, Georgia, United States
	7	Kevin Glynn , Peter J. Stuckey , Martin Sulzmann, Effective Strictness Analysis with HORN Constraints, Proceedings of the 8th International Symposium on Static Analysis, p.73-92, July 16-18, 2001
	8	Kevin Glynn , Peter J. Stuckey , Martin Sulzmann , Harald Søndergaard, Boolean Constraints for Binding-Time Analysis, Proceedings of the Second Symposium on Programs as Data Objects, p.39-62, May 21-23, 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	Pierre Jouvelot , David Gifford, Algebraic reconstruction of types and effects, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.303-310, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99623]
	11	X. Leroy. The Objective Caml system, 1996. http://pauillac.inria.fr/ocaml/.
	12	Robin Milner , Mads Tofte , Robert Harper, The Definition of Standard ML, MIT Press, Cambridge, MA, 1990
	13	François Pessaux , Xavier Leroy, Type-based analysis of uncaught exceptions, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.276-290, January 20-22, 1999, San Antonio, Texas, United States [doi>10.1145/292540.292565]
	14	Simon Peyton Jones , Alastair Reid , Fergus Henderson , Tony Hoare , Simon Marlow, A semantics for imprecise exceptions, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, p.25-36, May 01-04, 1999, Atlanta, Georgia, United States
	15	S. Peyton Jones et al. Report on the programming language Haskell~98. Technical report, February 1999. http:/haskell.org.
	16	Kwangkeun Yi, An abstract interpretation for estimating uncaught exceptions in standard ML programs, Science of Computer Programming, v.31 n.1, p.147-173, May 1998 [doi>10.1016/S0167-6423(96)00044-5]

CITED BY 2

	Marko van Dooren , Eric Steegmans, Combining the robustness of checked exceptions with the flexibility of unchecked exceptions using anchored exception declarations, ACM SIGPLAN Notices, v.40 n.10, October 2005
	Cristina David , Cristian Gherghina , Wei-Ngan Chin, Translation and optimization for a core calculus with exceptions, Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, January 19-20, 2009, Savannah, GA, USA