Bruce F. Duba, Robert Harper, David MacQueen  Home/Search
Context Related
| cmu.edu/People/rwh/papers/c...popl91.ps cmu.edu/afs/cs/user/rwh/pub...popl91.ps cmu.edu/project/fox/mos...rwhpopl91.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: cmu.edu/People/rwh/papers...index (more) From: cmu.edu/project/fox/mosa...papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An extension of Standard ML with continuation primitives similar to those found in Scheme is considered. A number of alternative type systems are discussed, and several programming examples are given. The semantics of type assignment for a small, purely functional fragment of the language is presented, for which both a Milner-style soundness theorem and an observational soundness theorem may be established. 1 Introduction First-class continuations are a simple and natural way to provide access ... (Update)
Cited by: More
Polymorphic Type Assignment and CPS Conversion - To Appear Acm (Correct)
Explicit Polymorphism and CPS Conversion - Robert Harper Mark (1992) (Correct)
Return Types for Functional Continuations - Carl Gunter University (Correct)
Similar documents (at the sentence level):
28.7%: Typing First-Class Continuations in ML - Robert Harper (Correct)
Active bibliography (related documents): More All
0.3: Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991) (Correct)
0.3: Soft Typing - Cartwright, Fagan (1991) (Correct)
0.2: Lambda-Calculus Schemata - Fischer (1993) (Correct)
Similar documents based on text: More All
0.1: A Notion of Classical Pure Type System - Barthe, Hatcliff, al. (1997) (Correct)
0.1: A Compilation Manager for Standard ML of New Jersey - Harper, Pfenning, Lee, Rollins (1994) (Correct)
0.1: Quantum Chaos and Spectral Transitions in the Kicked.. - Kruse, Ketzmerick, Geisel (Correct)
Related documents from co-citation: More All
34: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
31: Compiling with Continuations (context) - Appel - 1992
30: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
BibTeX entry: (Update)
Bruce Duba, Robert Harper, and David MacQueen. Typing first-class continuations in ML. In Eighteenth ACM Symposium on Principles of Programming Languages, January 1991. http://citeseer.ist.psu.edu/article/duba91typing.html More
@inproceedings{ duba91typing,
author = "Bruce F. Duba and Robert Harper and David MacQueen",
title = "Typing First-Class Continuations in {ML}",
booktitle = "Conference Record of the Eighteenth Annual {ACM} Symposium on Principles of Programming Languages",
address = "Orlando, Florida",
pages = "163--173",
year = "1991",
url = "citeseer.ist.psu.edu/article/duba91typing.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
906 A structural approach to operational semantics - Plotkin - 1981
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
139 Type systems for programming languages (context) - Mitchell - 1989
137 Laboratory for the Foundations of Computer Science (context) - Milner, Tofte et al. - 1988
116 RABBIT: A compiler for SCHEME (context) - Jr - 1978
89 closure-passing style (context) - Appel, Jim - 1989
86 A correspondence between ALGOL--60 and Church's lambda notat.. (context) - Landin - 1965
81 The theory and practice of firstclass prompts (context) - Felleisen - 1988
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
66 Continuation semantics in typed lambda calculi - Meyer, Wand - 1985
57 Continuation-based multiprocessing - Wand - 1980
53 Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
52 the relation between direct and continuation semantics (context) - Reynolds - 1974
36 Reasoning with continuations II: Full abstraction for models.. - Sitaram, Felleisen - 1990
34 Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
32 Declarative continuations: An investigation of duality in pr.. (context) - Filinski - 1989
30 Information and Control (context) - Statman, the et al. - 1985
24 GEDANKEN --- a simple typeless language based on the princip.. (context) - Reynolds - 1970
24 Scheme: An interpreter for extended lambda calculus (context) - Sussman, Steele - 1975
23 Engines from continuations (context) - Dybvig, Hieb - 1989
23 Asynchronous signals in Standard ML - Reppy - 1990
20 A scheme for higher-level semantic algebra (context) - Clinger, Friedman et al. - 1985
19 First-class synchronous operations in Standard ML (context) - Reppy - 1989
18 Abstracting timed preemption with engines (context) - Haynes, Friedman - 1987
15 Obtaining coroutines from continuations (context) - Haynes, Friedman et al. - 1986
15 The completeness theorem for typing terms (context) - Hindley - 1983
12 A mathematical semantics for handling full jumps (context) - Strachey, Wadsworth - 1974
11 A formulas-as-types notion of control (context) - Griffin - 1990
11 Available as Edinburgh University Laboratory for Foundations.. (context) - Tofte, Polymorphic et al. - 1988
11 Natural semantics on the computer (context) - Cl'ement, Despeyroux et al. - 1985
10 Declarative continuations and categorical duality - Filinski - 1989
10 Haynes and Daniel P (context) - Christopher - 1987
6 PAL -- a language designed for teaching programming linguist.. (context) - Evans - 1968
6 Computer Science Department (context) - Ramsey, in et al. - 1990
4 CSP-style processes in ML (context) - Sufrin - 1989
3 Standard ML of New Jersey Reference Manual (context) - Appel, MacQueen - 1990
3 Talk at Bell Laboratories (context) - Cooper, of et al. - 1990
2 Program Transformations and Programming Environments (context) - Friedman, Haynes et al. - 1985
2 The nature of exceptions in polymorphic languages (context) - Wright, Felleisen - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/People/rwh/papers/index.html): More
Explicit Polymorphism and CPS Conversion - Harper, Lillibridge (1993) (Correct)
A Simplified Account of Polymorphic References - Harper (1993) (Correct)
On the Type Structure of Standard ML - Harper, Mitchell (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