Dorai Sitaram  Home/Search
Context Related
| rice.edu/CS/PLT/Public...pldi93s.ps.gz neu.edu/scheme/pubs/./pldi93s.ps.gz 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: rice.edu/CS/PLT/Publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Non-local control transfer and exception handling have a long tradition in higher-order programming languages such as Common Lisp, Scheme and ML. However, each language stops short of providing a full and complementary approach --- control handling is provided only if the corresponding control operator is first-order. In this work, we describe handlers in a higher-order control setting. We invoke our earlier theoretical result that all denotational models of control languages invariably... (Update)
Context of citations to this paper: More
...are useful in programming requires some experience in writing programs. In the untyped case, prompts add significant expressive power [20, 21]; we believe the examples of [20] could be typed in our system. We also conjecture that many applications that currently uses callcc...
...are useful in programming requires some experience in writing programs. In the untyped case, prompts add signi cant expressive power [20, 21]; we believe the examples of [20] could be typed in our system. We also conjecture that many applications that currently uses callcc...
Cited by: More
Return Types for Functional Continuations - Carl Gunter University (Correct)
A Replicated and Persistent Functional Programming Environment -.. - Oksanen (2001) (Correct)
The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994) (Correct)
Similar documents (at the sentence level):
46.9%: Models of Control and Their Implications for Programming Language .. - Sitaram (1994) (Correct)
Active bibliography (related documents): More All
0.3: Formal Methods - Selected Historical References - Jones, McCauley (1992) (Correct)
0.3: Reasoning with Continuations II: Full Abstraction for.. - Sitaram, Felleisen (1990) (Correct)
0.3: Threads Yield Continuations - Kumar, Bruggeman, Dybvig (1997) (Correct)
Similar documents based on text: More All
0.2: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994) (Correct)
0.1: Higher-Order Narrowing - Prehofer (1994) (Correct)
0.1: Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
Related documents from co-citation: More All
9: Compiling with Continuations (context) - Appel - 1992
9: Representing monads - Filinski - 1994
8: Reasoning with continuations II: Full abstraction for models of control - Sitaram, Felleisen - 1990
BibTeX entry: (Update)
Dorai Sitaram. Handling control. In Proceedings of the 1993 ACM Conference on Programming Language Design and Implementation, pages 147--155. ACM, 1993. http://citeseer.ist.psu.edu/sitaram93handling.html More
@inproceedings{ sitaram93handling,
author = "Dorai Sitaram",
title = "Handling Control",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "147-155",
year = "1993",
url = "citeseer.ist.psu.edu/sitaram93handling.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
484 Common Lisp: the Language (context) - Jr - 1990
484 Common Lisp: the Language (context) - Jr - 1984
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
363 Programming in Prolog (context) - Clocksin, Mellish - 1981
254 Revised 4 Report on the Algorithmic Language Scheme - Clinger, Rees - 1991
184 Definitional interpreters for higherorder programming langua.. (context) - Reynolds - 1972
86 A Correspondence between Algol 60 and Church's Lambda Notati.. (context) - Landin - 1965
81 The Theory and Practice of First-Class Prompts (context) - Felleisen - 1988
69 Typing firstclass continuations in ML - Duba, Harper et al. - 1991
66 Abstracting control - Danvy, Filinski - 1990
62 Programmer's Manual (context) - McCarthy - 1965
35 Continuations and Concurrency (context) - Hieb, Dybvig - 1990
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen et al. - 1990
27 Scheme: An interpreter for extended lambda calculus (context) - Sussman, Jr - 1975
24 A Dynamic Extent Control Operator for Partial Continuations - Queinnec, Serpette - 1991
24 Introduction to Standard ML (context) - Harper - 1986
23 Engines from Continuations (context) - Dybvig, Hieb - 1989
19 Embedding Continuations (context) - Haynes, Friedman - 1987
15 Obtaining Coroutines from Continuations (context) - Haynes, Friedman et al. - 1986
11 CS: An Extended -Calculus for Scheme (context) - Felleisen - 1988
9 Transliterating Prolog into Scheme (context) - Felleisen - 1985
7 Modeling Continuations without Continuations (context) - Sitaram, Felleisen - 1991
3 OS6: An Operating System for a Small Computer (context) - Stoy, Strachey - 1972
2 Reasoning with Continuations II: How to Get Full Abstraction.. (context) - Sitaram, Felleisen - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/PLT/Publications/): More
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998) (Correct)
Reasoning about Explicit and Implicit Representations of State - Sabry, Field (1993) (Correct)
A Practical Soft Type System for Scheme - Wright, Cartwright (1994) (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