John H. Reppy  Home/Search
Context Related
| ii.uni.wroc.pl/~tom...90trreppy.ps.gz smlnj.org/compilernot...90trreppy.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ii.uni.wroc.pl/~tomasz/sml/doc... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe the design, implementation and use of a mechanism for handling asynchronous signals, such as user interrupts, in the New Jersey implementation of Standard ML. Providing this kind of mechanism is a necessary requirement for the development of real-world application programs. Our mechanism uses first-class continuations to represent the execution state at the time at which a signal occurs. It has been used to support pre-emptive scheduling in concurrency packages and for forcing... (Update)
Context of citations to this paper: More
.... in the Revised De nition [9] However, Reppy describes an extension to SML that maps asynchronous Unix signals onto New Jersey SML [17]. The story is quite di erent to ours. A signal does not raise an exception; instead, it captures the running thread as a rst class...
...interrupt frame supplied by the operating system and packaging it as a C continuation. The latter technique is well understood (Reppy 1990) but tricky to implement; it is a perfect candidate for C . When a thread can be interrupted and suspended anywhere, it is unclear...
Cited by: More
An Embedded Error Recovery and Debugging Mechanism for Scripting.. - Beazley (2001) (Correct)
Compiler Support for Lightweight Concurrency - Fisher, Reppy (2001) (Correct)
Asynchronous Exceptions in Haskell - Marlow, Jones, Moran, Reppy (2001) (Correct)
Active bibliography (related documents): More All
0.5: Preferred Embodiment of a Hardware-Assisted.. - Nilsen, Schmidt (1992) (Correct)
0.5: Higher-order Concurrency - Reppy (1992) (Correct)
0.5: Synchronising with First-Class Conditions - Afshartous (Correct)
Similar documents based on text: More All
0.1: A Theory of Weak Bisimulation for Core CML - Ferreira, Hennessy, Jeffrey (1993) (Correct)
0.1: A Framework for Interoperability - Fisher, Pucella, al. (2001) (Correct)
0.1: A semantics for ML concurrency primitives - Berry, Milner, Turner (1992) (Correct)
Related documents from co-citation: More All
15: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
13: Continuation-Based Multiprocessing - Wand - 1980
12: Compiling with Continuations (context) - Appel - 1992
BibTeX entry: (Update)
John Reppy. Asynchronous signals in Standard ML. Technical Report TR 90-1144, Computer Science Department, Cornell University, Ithaca, NY, August 1990. http://citeseer.ist.psu.edu/reppy90asynchronous.html More
@techreport{ reppy90asynchronous,
author = "John H. Reppy",
title = "Asynchronous signals in {Standard {ML}}",
number = "TR 90-1144",
year = "1990",
url = "citeseer.ist.psu.edu/reppy90asynchronous.html" }
Citations (may not include all citations):1074 The definition of standard ml (context) - Milner, Tofte et al. - 1990 ACM
220 Orbit: an optimizing compiler for scheme (context) - Kranz, Kelsey et al. - 1986 ACM DBLP
167 Generation scavenging: a non-disruptive high performance sto.. (context) - Ungar - 1984 DBLP
123 Simple generational garbage collection and fast allocation - Appel - 1989 ACM DBLP
94 Real-time concurrent collection on stock multiprocessors - Appel, Ellis et al. - 1988 ACM DBLP
70 A standard ml compiler - Appel, MacQueen - 1987 ACM DBLP
57 Continuation-based multiprocessing - Wand - 1980
55 Design of the opportunistic garbage collector (context) - Wilson, Moher - 1989
41 Implementation of Argus (context) - Liskov, Curtis et al. - 1987 ACM DBLP
32 Debugging standard ml without reverse engineering - Tolmach, Appel - 1990 ACM DBLP
26 Concurrency features for the trellis/owl language (context) - Moss ACM DBLP
23 Concurrent garbage collection on stock hardware (context) - North, Reppy - 1987 ACM DBLP
19 First-class synchronous operations in standard ml (context) - Reppy - 1989 ACM
11 Berkeley software distribution (context) - reference - 1986
6 Continuation-passing, closure-passing style - Appel, Jim - 1989 ACM DBLP
5 A runtime system - Appel - 1990 ACM DBLP
3 Type-checking first-class continuations (context) - Duba, Harper et al.
2 Concurrent programming in ml - Ramsey - 1990 ACM
2 Allocation without locking - Appel - 1989 DBLP
1 Asynchronous signals in standard ml (SML/NJ version 0.56 (context) - Reppy - 1990
1 Improving garbage collection performance in virtual memory (context) - Shaw - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ii.uni.wroc.pl/~tomasz/sml/doc/): More
Compile-time Detection of Uncaught Exceptions in Standard ML Programs - Yi (1994) (Correct)
ForML - a Pretty-Printing Facility for SML - Rohwedder (1993) (Correct)
Tree Pattern Matching for ML (Extended Abstract) - Baudinet, MacQueen (1985) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC