الأحد، 8 يونيو 2008



Feedback
Asynchronous exceptions in Haskell
Full text
Pdf (1.47 MB)
Source
ACM SIGPLAN Notices archiveVolume 36 , Issue 5 (May 2001) table of contents
Pages: 274 - 285
Year of Publication: 2001
ISSN:0362-1340 Also published in ...
Authors
Simon Marlow
Microsoft Research, Cambridge
Simon Peyton Jones
Microsoft Research, Cambridge
Andrew Moran
Oregon Graduate Institute
John Reppy
Bell Labs, Lucent Technologies
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7, Downloads (12 Months): 73, Citation Count: 10
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/381694.378858What is a DOI?
ABSTRACT
Asynchronous exceptions, such as timeouts are important for robust, modular programs, but are extremely difficult to program with — so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.
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.

1
Joe Armstrong , Robert Virding , Claes Wikström , Mike Williams, Concurrent programming in ERLANG (2nd ed.), Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1996

2
Ken Arnold , James Gosling, The Java programming language (2nd ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, 1998

3
Paul S. Barth , Rishiyur S. Nikhil , Arvind Nikhil, M-structures: extending a parallel, non-strict, functional language with state, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.538-568, June 1991, Cambridge, Massachusetts, United States

ليست هناك تعليقات: