Robert Harper, Bruce F. Duba, David MacQueen  Home/Search
Context Related
Links: ACM DBLP | rice.edu/CS/PLT/Publi...jfp93hdm.ps.gz neu.edu/scheme/pubs/....jfp93hdm.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: An extension of 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. A continuation-based operational semantics is defined for a small, purely functional, language, and the soundness of the Damas-Milner polymorphic type assignment system with respect to this semantics is proved. The full Damas-Milner type system is shown to be unsound in the presence of first-class... (Update)
Cited by: More
Polymorphic Type Assignment and CPS Conversion - To Appear Acm (Correct)
Relational Interpretations of Recursive Types in an.. - Lars Birkedal And (1997) (Correct)
A Programming Language for Probabilistic Computation - Park (2005) (Correct)
Similar documents (at the sentence level):
20.8%: Typing First-Class Continuations in ML - Duba, Harper, MacQueen (1991) (Correct)
Active bibliography (related documents): More All
0.5: Explicit Polymorphism and CPS Conversion - Harper, Lillibridge (1993) (Correct)
0.4: Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991) (Correct)
0.3: Models of Control and Their Implications for Programming Language .. - Sitaram (1994) (Correct)
Similar documents based on text: More All
0.4: Exceptions Are Strictly More Powerful Than Call Cc - Lillibridge (1995) (Correct)
0.1: Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura (1998) (Correct)
0.1: A Polymorphic Language With First-Class Modules - Ophel (1995) (Correct)
Related documents from co-citation: More All
17: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
16: Continuation semantics in typed lambda calculi - Meyer, Wand - 1985
16: Typing first-class continuations in ML - Duba, Harper et al. - 1991
BibTeX entry: (Update)
Robert Harper, Bruce Duba, and David MacQueen. Typing first-class continuations in ML. Revised and expanded version of [8]. To appear, Journal of Functional Programming. http://citeseer.ist.psu.edu/harper92typing.html More
@article{ harper91typing,
author = "Robert Harper and Bruce F. Duba and David MacQueen",
title = "Typing First-Class Continuations in {ML}",
booktitle = "Conf.\ Record 18th Ann.\ {ACM} {SIGPLAN}-{SIGACT} Symp.\ on Principles of Programming Languages, {POPL}'91, Orlando, {FL}, ??? Jan.\ 1991",
publisher = "ACM Press",
address = "New York",
pages = "163--173",
year = "1991",
url = "citeseer.ist.psu.edu/harper92typing.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
343 Principal type schemes for functional programs (context) - Damas, Milner - 1982
306 A syntactic approach to type soundness - Wright, Felleisen - 1991
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972 ACM DBLP
178 Standard ML of New Jersey - Appel, MacQueen - 1991 DBLP
138 Type inference for polymorphic references (context) - Tofte - 1990 ACM DBLP
110 A formulae-as-types notion of control - Griffin - 1990 DBLP
86 A correspondence between ALGOL--60 and Church's lambda notat.. (context) - Landin - 1965
81 The theory and practice of first-class prompts (context) - Felleisen - 1988 ACM DBLP
76 Control operators (context) - Felleisen, Friedman - 1986
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987 ACM DBLP
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991 ACM DBLP
66 Continuation semantics in typed lambda calculi - Meyer, Wand - 1985
57 Continuation-based multiprocessing - Wand - 1980 ACM DBLP
53 Lambda-definability in the full type hierarchy (context) - Plotkin - 1980
48 Polymorphic type assignment and cps conversion - Harper, Lillibridge - 1992 ACM DBLP
36 Reasoning with continuations II: Full abstraction for models.. - Sitaram, Felleisen - 1990 ACM DBLP
34 Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986 DBLP
32 Declarative continuations: An investigation of duality in pr.. (context) - Filinski - 1989 DBLP
30 Information and Control (context) - Statman, the et al. - 1985
24 GEDANKEN --- a simple typeless languages based on the princi.. (context) - Reynolds - 1970
24 Scheme: An interpreter for extended lambda calculus (context) - Sussman, Lewis - 1975
23 Engines from continuations (context) - Dybvig, Hieb - 1989 ACM DBLP
23 Asynchronous signals in Standard ML - Reppy - 1990
21 Journal of Logic Programming (context) - Haynes - 1987
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 ACM
18 Abstracting timed preemption with engines (context) - Haynes, Friedman - 1987
18 Programming with continuations (context) - Friedman, Haynes et al. - 1985
15 Obtaining coroutines from continuations (context) - Haynes, Friedman et al. - 1986
12 A mathematical semantics for handling full jumps (context) - Strachey, Wadsworth - 1974
11 Available as Edinburgh University Laboratory for Foundations.. (context) - Tofte, Polymorphic et al. - 1988
10 Declarative continuations and categorical duality - Filinski - 1989
10 Haynes and Daniel P (context) - Christopher - 1987
9 Transliterating Prolog into Scheme (context) - Felleisen - 1985
7 Logical interpretations and computational simulations (context) - Griffin - 1992
6 Computer Science Department (context) - Ramsey, in et al. - 1990
6 PAL -- a language designed for teaching programming linguist.. (context) - Evans - 1968
4 CSP-style processes in ML (context) - Sufrin - 1989
3 Talk at Bell Laboratories (context) - Cooper, of et al. - 1990
2 The nature of exceptions in polymorphic lannguages (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.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