Exception analysis for non-strict languages

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

Research output: Contribution to conferencePaper

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, PA, 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, PA
Period4/10/026/10/02

Keywords

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

Cite this

Glynn, K., Stuckey, P. J., Sulzmann, M., & Søndergaard, H. (2002). Exception analysis for non-strict languages. 98-109. Paper presented at Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02), Pittsburgh, PA, United States of America.
Glynn, Kevin ; Stuckey, Peter J. ; Sulzmann, Martin ; Søndergaard, Harald. / Exception analysis for non-strict languages. Paper presented at Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02), Pittsburgh, PA, United States of America.12 p.
@conference{ac68d47f9c484fa1860c2ad5842455a5,
title = "Exception analysis for non-strict languages",
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.",
keywords = "Boolean constraints, Effect systems, Exceptions, Non-strict functional programming languages, Type inference",
author = "Kevin Glynn and Stuckey, {Peter J.} and Martin Sulzmann and Harald S{\o}ndergaard",
year = "2002",
month = "12",
day = "1",
language = "English",
pages = "98--109",
note = "Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02) ; Conference date: 04-10-2002 Through 06-10-2002",

}

Glynn, K, Stuckey, PJ, Sulzmann, M & Søndergaard, H 2002, 'Exception analysis for non-strict languages' Paper presented at Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02), Pittsburgh, PA, United States of America, 4/10/02 - 6/10/02, pp. 98-109.

Exception analysis for non-strict languages. / Glynn, Kevin; Stuckey, Peter J.; Sulzmann, Martin; Søndergaard, Harald.

2002. 98-109 Paper presented at Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02), Pittsburgh, PA, United States of America.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Exception analysis for non-strict languages

AU - Glynn, Kevin

AU - Stuckey, Peter J.

AU - Sulzmann, Martin

AU - Søndergaard, Harald

PY - 2002/12/1

Y1 - 2002/12/1

N2 - 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.

AB - 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.

KW - Boolean constraints

KW - Effect systems

KW - Exceptions

KW - Non-strict functional programming languages

KW - Type inference

UR - http://www.scopus.com/inward/record.url?scp=0036953866&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0036953866

SP - 98

EP - 109

ER -

Glynn K, Stuckey PJ, Sulzmann M, Søndergaard H. Exception analysis for non-strict languages. 2002. Paper presented at Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02), Pittsburgh, PA, United States of America.