See this document in CiteSeerX!

Towards Leakage Containment  (Make Corrections)  
Julia L. Lawall, Daniel P. Friedman



  Home/Search   Context   Related

 
View or download:
indiana.edu/pub/schem...iucstr346.ps.gz
indiana.edu/indra/sch...iucstr346.ps.gz
indiana.edu/pub/techreport...TR346.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/sch...oc.publications (more)
From:  indiana.edu
(Enter author homepages)

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

Abstract: Functional programs are organized into procedures, each encapsulating a specific task. A procedure should not cause its callers to repeat its work. This forced repetition of work we call leakage. In this paper we describe several common instances of leakage, and show how they can be eliminated using an extension of continuation-passing style. 1 Introduction A goal of programming is to divide a complex task into simpler parts. In a well organized program each of these simpler tasks is... (Update)

Active bibliography (related documents):   More   All
0.3:   Representing control: a study of the CPS transformation - Danvy, Filinski (1992)   (Correct)
0.3:   Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991)   (Correct)
0.3:   Representing Control: A Study of the CPS Transformation - Danvy, Filinski (1992)   (Correct)

Similar documents based on text:   More   All
0.1:   Separating Stages in the Continuation-Passing Style.. - Lawall, Danvy (1993)   (Correct)
0.0:   Entertaining Agents: A Sociological Case Study - Foner (1997)   (Correct)
0.0:   Giving Undo Attention - Abowd, Dix (1991)   (Correct)

BibTeX entry:   (Update)

@techreport{ lawall92toward,
    author = "Julia L. Lawall and Daniel P. Friedman",
    title = "Toward leakage containment",
    number = "\#346",
    address = "Bloomington, Indiana",
    year = "1992",
    url = "citeseer.ist.psu.edu/4469.html" }
Citations (may not include all citations):
484   Common Lisp: The Language (context) - Steele - 1984
258   Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
197   Revised 3 report on the algorithmic language Scheme - Rees - 1986
81   The theory and practice of first-class prompts (context) - Felleisen - 1988
71   Lambda Calculus Schemata - Fischer - 1972
63   Laboratory for Foundations of Computer Science (context) - Harper, MacQueen et al. - 1986
61   Continuations - a mathematical semantics for handling full j.. (context) - Strachey, Wadsworth - 1974
61   Detecting global variables in denotational specifications (context) - Schmidt - 1985
51   Allyn and Bacon (context) - Schmidt - 1986
32   Listlessness is better than laziness: lazy evaluation and ga.. (context) - Wadler - 1984
18   call-by-value (context) - Plotkin - 1975
15   A functional abstraction of typed contexts - Danvy, Filinski - 1989
10   Declarative continuations and categorical duality - Filinski - 1989
10   The congruence of two programming language definitions (context) - Stoy - 1981
6   A bonus from Van Wijngaarden's device (context) - Morris - 1972
3   A variable-arity procedural interface (context) - Dybvig, Hieb - 1988
3   Programming with tighter control (context) - Danvy - 1989
1   A scheme for implementing functional values on a stack machi.. (context) - Georgeff - 1982

Documents on the same site (http://www.cs.indiana.edu/scheme-repository/doc.publications.html):   More
A Parallel Virtual Machine for Efficient Scheme Compilation - Feeley, Miller (1990)   (Correct)
Register Allocation Using Lazy Saves, Eager Restores, and .. - Burger, Waddell, Dybvig (1995)   (Correct)
A Scheme Shell - Shivers (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