Dorai Sitaram  Home/Search
Context Related
Links: ACM | neu.edu/scheme/pub...esissitaram.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: neu.edu/scheme/pubs/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This work uses denotational models to understand and improve the part of a programming language concerned with non-local control operators. These operators let the programmer identify and restore arbitrary control contexts in the program execution path, and thus form a powerful component of many modern programming languages. We use a variety of denotational models to tackle the issues of (1) describing a control language mathematically, and (2) using the model's apparatus to obtain information... (Update)
Context of citations to this paper: More
...we develop below. Haynes and Friedman [12, 13] introduce the engine facility to model timed preemption; variants can also be found in [5, 6, 31]. Engines differ from our groups in a number of ways. Engines are defined in a sequential framework and are used to simulate...
...which we develop below. Haynes and Friedman [19, 20] introduce the engine facility to model timed preemption; variants can also be found in [8, 9, 48]. Engines differ from our groups in a number of ways. Engines are defined in a sequential framework and are used to simulate...
Cited by: More
Distributed Computations Driven by Resource Consumption - Moreau, Queinnec (1998) (Correct)
On the Finiteness of Resources in Distributed Computing - Moreau, Queinnec (1997) (Correct)
Similar documents (at the sentence level):
8.4%: Handling Control - Sitaram (1993) (Correct)
Active bibliography (related documents): More All
1.0: Reasoning with Continuations II: Full Abstraction for.. - Sitaram, Felleisen (1990) (Correct)
0.5: Type Evolution and Instance Adaptation - Clamen (1992) (Correct)
0.4: Threads Yield Continuations - Kumar, Bruggeman, Dybvig (1997) (Correct)
Similar documents based on text: More All
2.5: Models of Control and Their Implications for Programming Language .. - Sitaram (1994) (Correct)
0.3: Behavioral Software Contracts - Findler (Correct)
0.3: Effective Static Debugging via Componential Set-Based Analysis - Flanagan (1997) (Correct)
Related documents from co-citation: More All
4: Speculative computation in multilisp (context) - Osborne - 1990
2: Programming in Scheme (context) - Eisenberg - 1988
2: Abstracting timed preemption with engines (context) - Haynes, Friedman - 1987
BibTeX entry: (Update)
Dorai Sitaram. Models of Control and Their Implications for Programming Language Design. PhD thesis, Rice University, Houston, Texas, April 1994. http://citeseer.ist.psu.edu/article/sitaram94models.html More
@phdthesis{ sitaram94models,
author = "Dorai Sitaram",
title = "Models of Control and Their Implications for Programming Language Design",
pages = "166",
year = "1994",
url = "citeseer.ist.psu.edu/article/sitaram94models.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
1002 Programming Language (context) - Stroustrup - 1991
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
521 Compiling with Continuations (context) - Appel - 1992 ACM
484 Common Lisp: the Language (context) - Jr ACM
476 Programming Language (context) - Kernighan, Ritchie - 1988
440 The Art of Prolog (context) - Sterling, Shapiro - 1986
430 Structure and Interpretation of Computer Programs (context) - Abelson, with et al. - 1985 ACM
363 Programming in Prolog (context) - Clocksin, Mellish - 1981 ACM
306 LCF considered as a programming language (context) - Plotkin - 1977 DBLP
254 Revised 4 Report on the Algorithmic Language Scheme - Clinger, Rees - 1991
214 Domains for denotational semantics (context) - Scott - 1982 ACM DBLP
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972 ACM DBLP
95 A basis for a mathematical theory of computation - McCarthy - 1963 ACM
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
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. ACM DBLP
69 Revised report on the algorithmic language Algol (context) - Naur - 1963
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991 ACM DBLP
66 Fully abstract models of typed -calculi (context) - Milner - 1977
66 Abstracting control - Danvy, Filinski
62 Programmer's Manual (context) - McCarthy - 1965
61 Continuations: A mathematical semantics for handling full ju.. (context) - Strachey, Wadsworth - 1974 DBLP
51 the expressive power of programming languages - Felleisen
46 CS-Conversion: A Syntactic Theory of Control and State in Im.. (context) - Felleisen, of - 1987
35 Continuations and Concurrency (context) - Hieb, Dybvig - 1990 ACM DBLP
27 Scheme: An interpreter for extended lambda calculus (context) - Sussman, Jr - 1975
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen et al. - 1990
24 A Dynamic Extent Control Operator for Partial Continuations - Queinnec, Serpette - 1991 ACM DBLP
24 Introduction to Standard ML (context) - Harper - 1986
23 Engines from Continuations (context) - Dybvig, Hieb - 1989 ACM DBLP
22 Functional programming and lambda calculus (context) - Barendregt - 1990 ACM DBLP
19 Embedding Continuations (context) - Haynes, Friedman - 1987
19 Hierarchical program structure (context) - Dahl, Hoare - 1972
18 Abstracting Timed Preemption with Engines (context) - Haynes, Friedman
18 Programming with continuations (context) - Friedman, Haynes et al. - 1985
15 Obtaining Coroutines from Continuations (context) - Haynes, Friedman et al. - 1986
13 Delimiting the scope of effects - Riecke - 1993 ACM DBLP
13 Continuations may be unreasonable (context) - Meyer, Riecke ACM DBLP
12 Logic Continuations (context) - Haynes ACM DBLP
12 Lisp and Symbolic Computation (context) - Hieb, Dybvig et al. - 1994
11 CS: An Extended -Calculus for Scheme (context) - Felleisen
9 Transliterating Prolog into Scheme (context) - Felleisen - 1985
8 Relating full abstraction results for different programming .. (context) - Sieber - 1990 ACM DBLP
7 volume 95 of Lecture Notes in Computer Science (context) - Marlin, -- et al. - 1980
7 Modeling Continuations without Continuations (context) - Sitaram, Felleisen - 1991
6 Lisp and Symbolic Computation (context) - Padget, Nuyens et al. - 1993
3 OS6: An operating system for a small computer (context) - Stoy, Strachey - 1972
2 Extended direct semantics (context) - Felleisen, Cartwright - 1990
2 Apple Computer Eastern Research and Technology (context) - ---, dynamic - 1992
2 Reasoning with Continuations II: How to Get Full Abstraction.. (context) - Sitaram, Felleisen
1 st ACM SIGPLAN-SIGACT Symposium on Principles of Programming.. (context) - Filinski, Proc - 1994
1 The principles of programming languages (context) - Felleisen - 1989
1 Conference on Programming Language Design and Implementation (context) - Sitaram, Proc - 1993
Documents on the same site (http://www.ccs.neu.edu/scheme/pubs/): More
Observable Sequentiality and Full Abstraction - Cartwright, Felleisen (1992) (Correct)
Universal Domains For Sequential Computation - Kanneganti (1995) (Correct)
Typing First-Class Continuations in ML - Harper, Duba, MacQueen (1992) (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