Exception analysis for non-strict languages

Authors:
Kevin Glynn;Peter J. Stuckey;Martin Sulzmann;Harald Søndergaard
Affiliations:
Université catholique de Louvain, Belgium;The University of Melbourne, Vic., Australia;National University of Singapore;The University of Melbourne, Vic., Australia
Venue:
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Year:
2002

Citing 10
Cited 3

Algebraic reconstruction of types and effects

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-based analysis of uncaught exceptions

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An abstract interpretation for estimating uncaught exceptions in standard ML programs

Science of Computer Programming
A semantics for imprecise exceptions

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
A theory of type qualifiers

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Type-base flow analysis: from polymorphic subtyping to CFL-reachability

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Java Programming Language

The Java Programming Language
The Definition of Standard ML

The Definition of Standard ML
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Program Analysis Using Mixed Term and Set Constraints

SAS '97 Proceedings of the 4th International Symposium on Static Analysis

Combining the robustness of checked exceptions with the flexibility of unchecked exceptions using anchored exception declarations

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Translation and optimization for a core calculus with exceptions

Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Closure operators for ROBDDs

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

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.