Gilles Barthe  Home/Search
Context Related
| sop.inria.fr/lemme/perso...hosc99.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: sop.inria.fr/lemme/perso...publis (more) (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 has been conned by the fact that CPS translations are known for non-dependent type systems only, thus excluding well-known systems like the calculus of constructions (CC) and the logical frameworks (LF). This paper presents techniques for CPS translating systems with dependent types, with an emphasis on pure type-theoretical applications. (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):
36.3%: CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (Correct)
Active bibliography (related documents): More All
0.8: A Notion of Classical Pure Type System - Barthe, Hatcliff, al. (1997) (Correct)
0.5: An Induction Principle for Pure Type Systems - Barthe, Hatcliff, Sørensen (2000) (Correct)
0.5: The Relevance of Proof-Irrelevance: A Meta-Theoretical Study of.. - Barthe (Correct)
Similar documents based on text: More All
0.9: CPS Translating Inductive and Coinductive Types (Extended.. - Barthe, Uustalu (2002) (Correct)
0.9: Domain-Free Pure Type Systems - Barthe, Sørensen (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/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/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
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
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
221 Denotational Semantics: A Methodology for Language Developme.. (context) - Schmidt - 1986
210 TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1996
186 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
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
146 The Glasgow Haskell compiler: a technical overview - Jones, Hall et al. - 1993
138 Typed closure conversion - Minamide, Morrisett et al. - 1996
137 Introduction to Combinators and -calculus (context) - Hindley, Seldin - 1986
116 Ideas and results of proof theory (context) - Prawitz - 1970
110 Eliminating array bound checking through dependent types - Xi, Pfenning - 1998
106 Essentials of Programming Languages (context) - Friedman, Wand et al. - 1991
101 ACM Transactions on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1993
79 A type-based compiler for Standard ML - Shao, Appel - 1995
76 Control operators (context) - Felleisen, Friedman
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al.
70 Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
69 Curry: Essays on Combinatory Logic (context) - Seldin, Hindley et al. - 1980
68 Logics and Type Systems - Geuvers - 1993
66 Continuation semantics in typed lambda-calculi - Meyer, Wand
60 Extracting Constructive Contents from Classical Proofs (context) - Murthy - 1990
56 Explicit polymorphism and CPS conversion - Harper, Lillibridge
51 A framework for dening logics (context) - Harper, Honsell et al.
46 CS Conversion: A Syntactic theory of Control and State in Im.. (context) - Felleisen, of - 1987
42 A realizability interpretation of the theory of species (context) - Tait - 1975
39 Massachusetts Institute of Technology (context) - Jr, for et al. - 1978
37 A generic account of continuation-passing styles - Hatclioe, Danvy - 1994
37 Back to direct style II: First-class continuations - Danvy, Lawall
31 Henk: a typed intermediate language - Meijer, Jones - 1997
28 Intensional interpretations of functionals of nite type (context) - Tait
25 A modular proof of strong normalisation for the Calculus of .. (context) - Geuvers, Nederhof - 1991
24 Sound specialization in the presence of computational eoeect.. - Lawall, Thiemann - 1997
24 Domain-free pure type systems - Barthe, rensen - 1997
24 Science of Computer Programming (context) - Danvy, direct - 1994
24 Een nadere bewijstheoretische analyse van GSTT's (context) - Terlouw - 1989
20 translation and looping combinators in pure type systems - Coquand, Herbelin - 1994
20 An early proof of normalization by (context) - Gandy
17 Strong normalization from weak normalization in typed -calcu.. (context) - rensen - 1997
16 Type dependence and constructive mathematics (context) - Berardi - 1990
15 CPS-translation and applications: the cube and beyond - Barthe, Hatclioe et al. - 1996
15 Constructive natural deduction and its (context) - Longo, Moggi - 1991
13 Denitional Interpreters for Higher-Order Programming Languag.. (context) - Reynolds - 1972
13 Call-by-name CPS-translation as a binding-time improvement - Nielsen, rensen - 1995
12 The conservation theorem revisited - de Groote - 1993
12 A notion of classical pure type system - Barthe, Hatclioe et al. - 1997
11 Delta calculus - Rehof, rensen - 1994
10 Type specialisation for imperative languages - Dussart, Hughes et al.
10 Normalization and excluded middle (context) - Seldin
9 evaluation styles and types systems (context) - Werner - 1992
9 the existence of long fij-normal forms in the cube (context) - Dowek, Huet et al. - 1993
8 Weak Normalization implies Strong Normalization in Generaliz.. - Barthe, Hatclioe et al. - 1997
6 Note on Axiomatizing the Semantics of Control Operators (context) - Sabry - 1996
5 Monadic type systems: Pure type systems for impure settings - Barthe, Hatclioe et al. - 1997
5 An induction principle for Pure Type Systems - Barthe, Hatclioe et al. - 1998
4 A computational formalization for partial evaluation (context) - Hatclioe, Danvy
4 Polymormphic type assignment and CPS conversion (context) - Harper, Lillibridge - 1993
3 Cayenne: spice up your programming with dependent types (context) - Augustsson - 1998
3 Weak and strong normalisations in typed -calculi (context) - Xi - 1997
3 A formulae-as-types notion of control (context) - GriOEn
2 a better support of static data AEow (context) - Consel, Danvy - 1991
1 A ReAEection on Call-by-value (context) - Sabry, Wadler
1 Normalization theorems for full rst order classical natural .. (context) - St - 1991
1 limination des coupres dans l'arithm#tique d'ordre sup#rieur (context) - Girard, tation - 1972
1 Department of Computing and Information Sciences (context) - Barthe, Hatclioe et al. - 1998
1 Is continuation passing useful for data-AEow analysis (context) - Sabry, Felleisen - 1994
1 ReAEections on reAEections (context) - Barthe, Hatclioe et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sop.inria.fr/lemme/personnel/Gilles.Barthe/publis.html): More
Constructor Subtyping - Barthe, Frade (1999) (Correct)
Setoids in Type Theory - Barthe, Capretta, Pons (2000) (Correct)
A Formal Executable Semantics of the JavaCard Platform - Barthe, Dufay, Jakubiec.. (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