A semantics for imprecise exceptions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A semantics for imprecise exceptions

Full text

Pdf (1.60 MB)

Source

Conference on Programming Language Design and Implementation archive
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation table of contents

Atlanta, Georgia, United States

Pages: 25 - 36

Year of Publication: 1999

ISBN:1-58113-094-5

Also published in ...

Authors

Simon Peyton Jones	Microsoft Research Ltd., Cambridge
Alastair Reid	Yale University
Fergus Henderson	The University of Melbourne
Tony Hoare	Cambridge University Computer Laboratory
Simon Marlow	Microsoft Research Ltd., Cambridge

Sponsors

SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 38, Citation Count: 16

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/301618.301637 What is a DOI?

ABSTRACT

Some modern superscalar microprocessors provide only imprecise exceptions. That is, they do not guarantee to report the same exception that would be encountered by a straightforward sequential execution of the program. In exchange, they offer increased performance or decreased chip area (which amount to much the same thing).This performance/precision tradeoff has not so far been much explored at the programming language level. In this paper we propose a design for imprecise exceptions in the lazy functional programming language Haskell. We discuss several designs, and conclude that imprecision is essential if the language is still to enjoy its current rich algebra of transformations. We sketch a precise semantics for the language extended with exceptions.The paper shows how to extend Haskell with exceptions without crippling the language or its compilers. We do not yet have enough experience of using the new mechanism to know whether it strikes an appropriate balance between expressiveness and performance.

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.

	7	High Performance Fortran Forum. High Performance Fortran language specification. Scientific Programming, 2(1-2):1-170, 1993.
	8	Yu Hu , S. Lennart Johnsson, Implementing O(N) N-body algorithms efficiently in data-parallel languages, Scientific Programming, v.5 n.4, p.337-364, Winter 1996
	9	Y. Charlie Hu , S. Lennart Johnsson , Shang-Hua Teng, High performance Fortran for highly irregular problems, Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.13-24, June 18-21, 1997, Las Vegas, Nevada, United States
	10	Charles H. Koelbel , David B. Loveman , Robert S. Schreiber , Guy L. Steele, Jr. , Mary E. Zosel, The high performance Fortran handbook, MIT Press, Cambridge, MA, 1994
	11	C. McCurdy. Efficient techniques for n-body simulation on distributed memory architectures. Master's thesis, Dept. of Computer Science, Rice University, 1999. Forthcoming.
	12	P. Mehrotra and J. yah Rosendale. Compiling high level constructs to distributed memory architectures. In Proceedings of the dth Conference on Hypercube Concurrent Computers and Applications, Monterey, CA, Mar. 1989.
	13	H. Sagan. $pace-FillingCurves. Springer-Verlag, New York, NY, 1994.
	14	Joel Saltz , Kathleen Crowley , Ravi Mirchandaney , Harry Berryman, Run-time scheduling and execution of loops on message passing machines, Journal of Parallel and Distributed Computing, v.8 n.4, p.303-312, Apr. 1990 [doi>10.1016/0743-7315(90)90129-D]
	15	M. S. Warren , J. K. Salmon, A parallel hashed Oct-Tree N-body algorithm, Proceedings of the 1993 ACM/IEEE conference on Supercomputing, p.12-21, December 1993, Portland, Oregon, United States [doi>10.1145/169627.169640]
	16	Steven Cameron Woo , Moriyoshi Ohara , Evan Torrie , Jaswinder Pal Singh , Anoop Gupta, The SPLASH-2 programs: characterization and methodological considerations, Proceedings of the 22nd annual international symposium on Computer architecture, p.24-36, June 22-24, 1995, S. Margherita Ligure, Italy

CITED BY 16

	Simon Marlow, Developing a high-performance web server in Concurrent Haskell, Journal of Functional Programming, v.12 n.5, p.359-374, July 2002
	Simon Marlow, An extensible dynamically-typed hierarchy of exceptions, Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, September 17-17, 2006, Portland, Oregon, USA
	Bernard Pope , Lee Naish, Practical aspects of declarative debugging in Haskell 98, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, p.230-240, August 27-29, 2003, Uppsala, Sweden
	Kevin Glynn , Peter J. Stuckey , Martin Sulzmann , Harald Søndergaard, Exception analysis for non-strict languages, ACM SIGPLAN Notices, v.37 n.9, p.98-109, September 2002
	Simon Marlow , Simon Peyton Jones , Andrew Moran , John Reppy, Asynchronous exceptions in Haskell, ACM SIGPLAN Notices, v.36 n.5, p.274-285, May 2001
	Clem Baker-Finch , Kevin Glynn , Simon Peyton Jones, Constructed product result analysis for Haskell, Journal of Functional Programming, v.14 n.2, p.211-245, March 2004
	Nick Benton , Andrew Kennedy, Exceptional syntax, Journal of Functional Programming, v.11 n.4, p.395-410, July 2001
	Keith Hanna, Interactive visual functional programming, ACM SIGPLAN Notices, v.37 n.9, p.145-156, September 2002
	Don Stewart , Manuel M. T. Chakravarty, Dynamic applications from the ground up, Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, p.27-38, September 30-30, 2005, Tallinn, Estonia
	V. Krishna Nandivada , Suresh Jagannathan, Dynamic state restoration using versioning exceptions, Higher-Order and Symbolic Computation, v.19 n.1, p.101-124, March 2006
	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
	Philip Wadler , Peter Thiemann, The marriage of effects and monads, ACM Transactions on Computational Logic (TOCL), v.4 n.1, p.1-32, January 2003
	Matthew Arnold , Michael Hsiao , Ulrich Kremer , Barbara G. Ryder, Exploring the Interaction between Java's Implicitly Thrown Exceptions and Instruction Scheduling, International Journal of Parallel Programming, v.29 n.2, p.111-137, April 2001
	Robert Ennals , Simon Peyton Jones, Optimistic evaluation: an adaptive evaluation strategy for non-strict programs, ACM SIGPLAN Notices, v.38 n.9, p.287-298, September 2003
	Takeshi Ogasawara , Hideaki Komatsu , Toshio Nakatani, EDO: Exception-directed optimization in java, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.1, p.70-105, January 2006
	Paul Hudak , John Hughes , Simon Peyton Jones , Philip Wadler, A history of Haskell: being lazy with class, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.12-1-12-55, June 09-10, 2007, San Diego, California