Exception analysis for non-strict languages

Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard

Research output: Contribution to conferencePaperpeer-review

8 Citations (Scopus)

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.

Original languageEnglish
Pages98-109
Number of pages12
Publication statusPublished - 1 Dec 2002
Externally publishedYes
EventProceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02) - Pittsburgh, United States of America
Duration: 4 Oct 20026 Oct 2002

Conference

ConferenceProceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02)
CountryUnited States of America
CityPittsburgh
Period4/10/026/10/02

Keywords

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

Cite this