ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 18 Issue 2, March 1996

Type classes in Haskell
Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip L. Wadler
Pages: 109-138
DOI: 10.1145/227699.227700
This article defines a set of type inference rules for resolving overloading introduced by type classes, as used in the functional programming language Haskell. Programs including type classes are transformed into ones which may be typed by...

Handling floating-point exceptions in numeric programs
John R. Hauser
Pages: 139-174
DOI: 10.1145/227699.227701
There are a number of schemes for handling arithmetic exceptions that can be used to improve the speed (or alternatively the reliability) of numeric code. Overflow and underflow are the most troublesome exceptions, and depending on the context...

Total correctness by local improvement in the transformation of functional programs
David Sands
Pages: 175-234
DOI: 10.1145/227699.227716
The goal of program transformation is to improve efficiency while preserving meaning. One of the best-known transformation techniques is Burstall and Darlington's unfold-fold method. Unfortunately the unfold-fold method itself guarantees neither...