See this document in CiteSeerX!

Explicit Polymorphism and CPS Conversion (1993)  (Make Corrections)  (56 citations)
Robert Harper, Mark Lillibridge
Conf.\ Record 20th Ann.\ ACM SIGPLAN-SIGACT Symp.\ on Principles of Programming Languages, POPL'93, Charleston, SC, USA, ??? Jan.\ 1993



  Home/Search   Context   Related

 
View or download:
hp.com/personal/Mark_Lilli...popl93.PDF
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  hp.com/personal/Mark_Lil...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We study the typing properties of CPS conversion for an extension of F# with control operators. Two classes of evaluation strategies are considered, each with call-by-name and call-by-value variants. Under the "standard" strategies, constructor abstractions are values, and constructor applications can lead to non-trivial control effects. In contrast, the "MLlike " strategies evaluate beneath constructor abstractions, reflecting the usual interpretation of programs in languages based on implicit ... (Update)

Cited by:   More
Typed Closure Conversion - Yasuhiko Minamide Greg   (Correct)
Compiling with Non-Parametric Polymorphism - Preliminary Report Robert   (Correct)
From System F to Typed Assembly Language - Greg Morrisett David (1998)   (Correct)

Similar documents (at the sentence level):
58.4%:   Explicit Polymorphism and CPS Conversion - Harper, Lillibridge (1993)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Typing First-Class Continuations in ML - Robert Harper   (Correct)
0.5:   Type Theory for Programming Languages - Harper (1994)   (Correct)
0.4:   Advanced Languages for Systems Software The Fox Project in 1994 - Harper, Lee (1994)   (Correct)

Similar documents based on text:   More   All
0.9:   Operational Interpretations of an Extension of F-omega with .. - Harper, Lillibridge (1993)   (Correct)
0.4:   Polymorphic Type Assignment and CPS Conversion - Harper, Lillibridge (1992)   (Correct)
0.3:   Exceptions Are Strictly More Powerful Than Call/CC - Lillibridge (1995)   (Correct)

Related documents from co-citation:   More   All
36:   Compiling with Continuations (context) - Appel - 1992
29:   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
22:   Unboxed objects and polymorphic typing - Leroy - 1992

BibTeX entry:   (Update)

Robert Harper and Mark Lillibridge. Explicit polymorphism and CPS conversion. In Twentieth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 206--219, January 1993. http://citeseer.ist.psu.edu/article/harper93explicit.html   More

@incollection{ harper93explicit,
    author = "Robert Harper and Mark Lillibridge",
    title = "Explicit Polymorphism and {CPS} Conversion",
    booktitle = "Conf.\ Record 20th Ann.\ {ACM} {SIGPLAN}-{SIGACT} Symp.\ on Principles of Programming Languages, {POPL}'93, Charleston, {SC}, {USA}, ??? Jan.\ 1993",
    publisher = "ACM Press",
    address = "New York",
    pages = "206--219",
    year = "1993",
    url = "citeseer.ist.psu.edu/article/harper93explicit.html" }
Citations (may not include all citations):
521   Compiling with Continuations (context) - Appel - 1992
384   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
346   Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
325   Towards a theory of type structure (context) - Reynolds - 1974
306   A syntactic approach to type soundness - Wright, Felleisen - 1991
283   Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
266   Information and Computation (context) - Coquand, Huet et al. - 1988
220   Orbit: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
184   Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
150   Edinburgh LCF: A Mechanized Logic of Computation (context) - Gordon, Milner et al. - 1979
138   Type inference for polymorphic references (context) - Tofte - 1990
132   Interpr etation Fonctionelle et Elimination des Coupures dan.. (context) - Girard - 1972
116   RABBIT: A compiler for SCHEME (context) - Steele - 1978
110   A formulae-as-types notion of control - Griffin - 1990
101   ACM Transactions on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1992
97   and parametric polymorphism (context) - Reynolds, abstraction - 1983
89   closure-passing style (context) - Appel, Jim - 1989
82   Typeful programming - Cardelli - 1989
76   Control operators (context) - Felleisen, Friedman - 1986
69   Typing first-class continuations in ML - Duba, Harper et al. - 1991
66   Continuation semantics in typed lambda calculi - Meyer, Wand - 1985
60   Extracting Constructive Content from Classical Proofs (context) - Murthy - 1990
55   Adding threads to Standard ML - Cooper, Morrisett - 1990
48   Polymorphic type assignment and cps conversion - Harper, Lillibridge - 1992
46   CS Conversion: A Syntactic Theory of Control and State in Im.. (context) - Felleisen, of - 1987
45   Information and Computation (context) - Mitchell, inference - 1988
43   candidats de reductibilit e (context) - Gallier - 1990
41   Polymorphic type inference and assignment - Leroy, Weis - 1991
35   The essence of ML (context) - Mitchell, Harper - 1988
35   Typing first-class continuations in ML - Harper, Duba et al.
34   Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
32   Logical Foundations of Functional Programming (context) - Huet - 1990
29   A theory of type polymorphism in programming languages (context) - Milner - 1978
28   Linear continuations - Filinski - 1992
27   Type Assignment in Programming Languages (context) - Martins - 1985
22   LEAP: A language with eval and polymorphism (context) - Pfenning, Lee - 1989
22   Dynamic typing in a statically-typed language (context) - Abadi, Cardelli et al. - 1989
19   First-class synchronous operations in standard ML (context) - Reppy - 1989
18   the undecidability of partial polymorphic type reconstructio.. - Pfenning - 1992
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
11   How to use lego: A preliminary user's manual (context) - Luo, Pollack et al. - 1989
8   Polymorphism by name (context) - leroy - 1993
7   Logical interpretations and computational simulations (context) - Griffin - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.hpl.hp.com/personal/Mark_Lillibridge/papers.html):   More
Operational Interpretations of an Extension of F-omega with .. - Harper, Lillibridge (1995)   (Correct)
Exceptions Are Strictly More Powerful Than Call Cc - Lillibridge (1995)   (Correct)
Extended Static Checking for Java - Flanagan, Leino, Lillibridge.. (2002)   (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