Gilles Barthe, John Hatcliff, Morten Heine Sørensen  Home/Search
Context Related
| cwi.nl/pub/gilles/cw97.ps.Z diku.dk/diku/semantics/pa...D304.ps.gz cs.chalmers.se/pub/users/gi...cw97.ps.Z 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: fermivista.math.juss...ftp.cwi.nl (more) From: fermivista.math....cs.chalmers.se (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Continuation passing style (CPS) translations of typed -calculi have numerous applications. However, the range of these applications have been confined thus far by the fact that CPS translations are known only for non-dependent type systems, thus excluding a number of well-known systems, e.g., the calculus of constructions and LF. The need for more general CPS translations has appeared in several lines of recent work in which the authors are involved. We discuss the difficulties involved with... (Update)
Context of citations to this paper: More
...terms is considered. Another possibility [14] is to define the translation relative to derivations. These issues are discussed further in [4]. However, even in a fixed context, the type of a term is unique only up to fi equality. This ambiguity is resolved by choosing types in...
...logic. Subsequently, typed CPS translations and correctness results have been given for more powerful typed calculi, see, e.g. [27, 28, 8], and applied to the compilation and optimization of typed languages, see, e.g. 19, 44] Grin s discovery initiated a series of...
Cited by: More
Weak and Strong Normalization, K-redexes, and First-Order Logic - Neergaard (1999) (Correct)
High-Assurance Common Language Runtime - Appel, Walker, Shao, Trifonov (Correct)
Monad Translating Inductive and Coinductive Types - Uustalu (2003) (Correct)
Similar documents (at the sentence level):
25.8%: CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (Correct)
Active bibliography (related documents): More All
2.7: A Notion of Classical Pure Type System - Barthe, Hatcliff, Sørensen (1997) (Correct)
0.9: Explicit Substitutions for Control Operators - Barthe, Kamareddine, Ríos (1997) (Correct)
0.8: Strong Normalization from Weak Normalization in Typed.. - Sørensen (1997) (Correct)
Similar documents based on text: More All
1.2: Domain-Free Pure Type Systems - Barthe (1993) (Correct)
0.8: Weak Normalization Implies Strong Normalization in.. - Barthe, Hatcliff.. (1997) (Correct)
0.8: Type-checking Injective Pure Type Systems - Barthe (1993) (Correct)
Related documents from co-citation: More All
13: Lambda Calculi with Types - Barendregt - 1992
11: Logics and Type Systems - Geuvers - 1993
10: Domain-free pure type systems - Barthe, Sorensen - 1996
BibTeX entry: (Update)
G. Barthe, J. Hatcliff, and M.H. Sørensen. CPS-translation and applications: the cube and beyond. In O. Danvy, editor, Proceedings of the Second ACM SIGPLAN Workshop on Continuations, number NS-96-13 in BRICS Notes, pages 4/1--4/31, 1996. http://citeseer.ist.psu.edu/article/barthe96cps.html More
@incollection{ barthe96cps,
author = "Gilles Barthe and John Hatcliff and Morten Heine B. S{\o}rensen",
title = "{CPS} Translations and Applications: The Cube and Beyond (Preliminary Report)",
booktitle = "Proc.\ of 2nd {ACM} {SIGPLAN} Workshop on Continuations, {CW}'97, Paris, France, 14 Jan.\ 1997",
publisher = "BRICS, Univ.\ of {\AA}rhus",
editor = "O. Danvy",
pages = "4--1--4--31",
year = "1996",
url = "citeseer.ist.psu.edu/article/barthe96cps.html" }
Citations (may not include all citations):729 The Lambda Calculus --- Its Syntax and Semantics (context) - Barendregt - 1984
521 Compiling with Continuations (context) - Appel - 1992
382 Lambda calculi with types - Barendregt - 1992
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
259 Combinatory Logic (context) - Curry, Feys - 1958
233 The formulae-as-types notion of construction (context) - Howard
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
174 Combinatory Reduction Systems (context) - Klop - 1980
167 Natural Deduction: A proof theoretical study (context) - Prawitz - 1965
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1993
155 The essence of compiling with continuations - Flanagan, Sabry et al. - 1993
137 Introduction to Combinators and -calculus (context) - Hindley, Seldin - 1986
134 calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
132 Interpr'etation fonctionelle et 'elimination des coupres dan.. (context) - Girard - 1972
121 Intensional interpretations of functionals of finite type (context) - Tait - 1967
116 Ideas and results of proof theory (context) - Prawitz - 1970
110 A formulae-as-types notion of control - Griffin - 1990
106 Essentials of Programming Languages (context) - Friedman, Wand et al. - 1991
104 Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
83 volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
76 a better support of static data flow - Consel, Danvy - 1991
76 Control operators (context) - Felleisen, Friedman - 1986
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
72 A new constructive logic: Classical logic (context) - Girard - 1991
70 Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
69 Curry: Essays on Combinatory Logic (context) - Seldin, Hindley et al. - 1980
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991
68 Logics and Type Systems - Geuvers - 1993
66 Continuation semantics in typed lambda-calculi - Meyer, Wand - 1985
60 Extracting Constructive Contents from Classical Proofs (context) - Murthy - 1990
57 A new deconstructive logic: Linear logic - Danos, Joinet et al. - 1994
56 Explicit polymorphism and CPS conversion - Harper, Lillibridge - 1993
50 Artificial Intelligence Laboratory (context) - Jr, for et al. - 1978
46 CS Conversion: A Syntactic theory of Control and State in Im.. (context) - Felleisen, of - 1987
45 Strong normalization for a typed lambda calculus with lambda.. (context) - Nederpelt - 1973
43 candidats de reductibilit'e (context) - Gallier - 1990
42 A realizability interpretation of the theory of species (context) - Tait - 1975
41 An evaluation semantics for classical proofs (context) - Murthy - 1991
40 Strong normalization for second order classical natural dedu.. (context) - Parigot - 1993
37 A generic account of continuation-passing styles - Hatcliff, Danvy - 1994
37 Back to direct style II: First-class continuations - Danvy, Lawall - 1992
35 New notions of reduction and non-semantic proofs of fi-stron.. (context) - Kfoury, Wells - 1994
32 Classical proofs as programs (context) - Parigot - 1993
29 Is continuation passing useful for data-flow analysis - Sabry, Felleisen - 1994
24 Domain-free pure type systems - Barthe, Sorensen - 1996
24 A computational analysis of Girard's translation and LC (context) - Murthy - 1992
24 A semantic view of classical proofs: Type-theoretic (context) - Ong - 1996
22 The conservation theorem revisited - de Groote
21 A semantics of evidence of classical arithmetic (context) - Coquand - 1995
20 translation and looping combinators in pure type systems - Coquand, Herbelin - 1994
20 An early proof of normalization by (context) - Gandy
19 A complete proof synthesis method for the cube of type syste.. (context) - Dowek - 1993
17 Strong normalization from weak normalization in typed -calcu.. (context) - Sorensen - 1996
16 A CPS-translation of the ¯-calculus (context) - de Groote - 1994
14 Intuitionistic and classical natural deduction systems with .. - Sato - 1995
14 Extracting constructive content from classical proofs via co.. - Barbanera, Berardi
13 Normalization theorems for full first order classical natura.. (context) - Stalmarck - 1991
13 A second-order pattern matching algorithm for the cube of ty.. (context) - Dowek - 1991
13 Call-by-name CPS-translation as a binding-time improvement - Nielsen, Sorensen - 1995
11 Delta calculus - Rehof, Sorensen - 1994
10 Finding computational contents in classical proofs (context) - Constable, Murthy - 1990
10 Form Reduction Systems and Reductions of Contracted Forms an.. (context) - Khasidashvili - 1988
10 Delayability (context) - Karr - 1985
10 and pseudo-classical type systems: A-translation at work (context) - Murthy, hierachies - 1992
10 A simple calculus of exception handling - de Groote
10 Normalization and excluded middle (context) - Seldin - 1989
9 Continuations and simple types: A strong normalization resul.. (context) - Barbanera, Berardi - 1992
9 evaluation styles and types systems (context) - Werner - 1992
9 volume 664 of Lecture Notes in Computer Science (context) - Bezem, Groote et al. - 1993
9 the existence of long fij-normal forms in the cube (context) - Dowek, Huet et al. - 1993
8 A symmetric lambda calculus (context) - Barbanera, Berardi - 1994
7 Aspects of the Computational Content of Proofs (context) - Underwood - 1994
6 Witness extraction in classical logic through normalization (context) - Barbanera, Berardi - 1993
5 calculus and the syntactic theory of sequential control (context) - de Groote, relation - 1994
4 A constructive valuation interpretation for classical logic .. (context) - Barbanera, Berardi - 1992
4 Classical pure type systems (context) - Barthe, Hatcliff et al. - 1996
4 Polymormphic type assignment and CPS conversion (context) - Harper, Lillibridge - 1993
3 A realization of the negative interpretation of the axiom of.. (context) - Berardi, Bezem et al.
3 computations (context) - Parigot, An - 1991
3 Manuscript announced on the types mailing list (context) - Xi, strong - 1996
2 Classical proofs: Lambda calculus methods in elementary proo.. (context) - Rezus - 1991
2 The extended version of this paper appears as DIKU-Report (context) - Hatcliff, Danvy et al. - 1995
2 PTS with definitions (context) - Severi, Poll - 1994
2 Denotations for classical proofs: Preliminary results - de Groote - 1992
2 Annals of Pure and Applied Logic (context) - Krivine, storage et al. - 1994
2 Beyond BHK (context) - Rezus - 1993
1 Strong normalization in a non-deterministically typed lambda.. (context) - de Groote - 1994
1 volume 902 of Lecture Notes in Computer Science (context) - Dezani-Ciancaglini, Plotkin et al. - 1995
1 Ellies Horwood Series in Computers and their Applications (context) - Krivine, Types - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cwi.nl.html): More
The Failed Fusion of Two Mathematical Reviewing Journals.. - Siegmund-Schultze (1995) (Correct)
Applications of Scientific Visualization in a Physics.. - Spoelder, Groen (1994) (Correct)
Aggregation Models of Fractal Growth - Vicsek, Vicsek (1997) (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