Olivier Danvy, John Hatcliff  Home/Search
Context Related
| daimi.aau.dk/pub/e...iffloplas93.ps.gz ksu.edu/pub/CIS/Ha...pssatr9231.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: brics.dk/~danvy/research (more) From: ksu.edu/~schmidt/group.survey (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: syntax of the source language ` c : ' f:::; x : ø ; :::g ` x : ø ß ` e : ø !ø ß ` fix e : ø ß [ fx : ø 1 g ` e : ø 2 ß ` x : ø 1 : e : ø 1 !ø 2 ß ` e 0 : ø 1 !ø 2 ß ` e 1 : ø 1 ß ` @ e 0 e 1 : ø 2 ß ` e 1 : ' ß ` e 2 : ø ß ` e 3 : ø ß ` if e 1 then e 2 else e 3 : ø ß ` e 0 : ø 0 ß [ fx : ø 0 g ` e 1 : ø 1 ß ` let x = e 0 in e 1 : ø 1 ß ` e 1 : ø 1 ß ` e 2 : ø 2 ß ` pair e 1 e 2 : ø 1 \Theta ø 2 ß ` e : ø 1 \Theta ø 2 ß ` fst e : ø 1 ß ` e : ø 1 \Theta ø 2 ß ` snd e : ø 2 Fig. 2.... (Update)
Context of citations to this paper: More
...exploits the information present in the strictness types. This translation is essentially similar to the one given by Danvy and Hatcliff [DH93]. 4 1.4 Proving the Tanslation Correct The optimized translation from CBN to CBV is folklore but a correctness proof is certainly not....
.... optimisation we could want to perform is to evaluate some function arguments to weak head normal form before the function call [Bur91, NN90, DH93, Amt93]. If our language includes datatypes such as pairs or lists, then we might wish to evaluate some arguments beyond WHNF...
Cited by: More
LISP AND SYMBOLIC COMPUTATION: An International.. - Call-By-Need And.. (Correct)
Minimal Thunkification - Amtoft (1993) (Correct)
Strictness Types: An Inference Algorithm and an Application - Amtoft (1993) (Correct)
Active bibliography (related documents): More All
0.6: Representing control: a study of the CPS transformation - Danvy, Filinski (1992) (Correct)
0.2: Axioms for Recursion in Call-by-Value (Extended Abstract) - Hasegawa, Kakutani (Correct)
0.2: Axioms for Recursion in Call-by-Value - Hasegawa, Kakutani (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: How Much Non-strictness do Lenient Programs Require? - Schauser, Goldstein (1995) (Correct)
0.3: Inference of Polymorphic and Conditional Strictness Properties - Jensen (1998) (Correct)
0.3: Compiling Laziness Using Projection Types - Baker-Finch (Correct)
Related documents from co-citation: More All
19: Reasoning about programs in continuation-passing style - Sabry, Felleisen
17: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
14: Information and Computation (context) - Moggi, computation - 1991
BibTeX entry: (Update)
Olivier Danvy and John Hatcliff. CPS transformation after strictness analysis. ACM Letters on Programming Languages and Systems, 1(3):195--212, 1993. http://citeseer.ist.psu.edu/danvy93cps.html More
@article{ danvy92cpstransformation,
author = "Olivier Danvy and John Hatcliff",
title = "{CPS}-Transformation After Strictness Analysis",
journal = "ACM Letters on Programming Languages and Systems",
volume = "1",
number = "3",
month = "September",
publisher = "ACM Press",
pages = "195--212",
year = "1992",
url = "citeseer.ist.psu.edu/danvy93cps.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
221 Denotational Semantics: A Methodology for Language Developme.. (context) - Schmidt - 1986
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen
70 Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
66 Continuation semantics in typed lambda-calculi - Meyer, Wand - 1985
55 call-by-value and the -calculus (context) - Plotkin - 1975
53 Realistic compilation by program transformation - Kelsey, Hudak - 1989
53 Prentice Hall International Series in Computer Science (context) - Jones, Implementation et al. - 1987
39 Compilation of functional languages by program transformatio.. (context) - Fradet, Le M'etayer - 1991
37 Back to direct style II: First-class continuations - Danvy, Lawall
21 Proving the correctness of compiler optimisations based on a.. - Burn, M'etayer - 1992
20 Back to direct style - Danvy - 1992
14 of Cambridge Tracts in Theoretical Computer Science (context) - Nielson, Nielson - 1992
13 a way of compiling procedure statements with some comments o.. (context) - Ingerman - 1961
11 Wiley Professional Computing (context) - Nielson, Nielson et al. - 1992
5 Recursion from iteration - Filinski
2 and Talcott (context) - Danvy - 1992
1 Graph reduction and lazy continuation-passing style (context) - Okasaki, Lee et al.
1 and Hatcliff (context) - Danvy - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~danvy/research.html): More
Separating Stages in the Continuation-Passing Style.. - Lawall, Danvy (1993) (Correct)
Back to Direct Style II: First-Class Continuations - Danvy, Lawall (1995) (Correct)
The Occurrence of Continuation Parameters in CPS Terms - Danvy, Pfenning (1995) (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