Patricia Johann, John Launchbury  Home/Search
Context
Related
| ogi.edu/pub/pacsoft/2f...warmfusion.ps 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: ogi.edu/PacSoft/proje...p2_report (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In functional programming, small programs are often combined to construct larger, more complex ones. The component reuse encouraged by this modular style of programming yields many benefits, but, unfortunately, modular programs also tend to be less efficient than their monolithic counterparts. Inefficiency is significantly attributable to the construction of intermediate data structures which "glue" together the smaller program components into larger ones. Fusion is the process of removing ... (Update)
Similar documents (at the sentence level):
35.2%: Warm Fusion for the Masses: Detailing Virtual Data.. - Johann, Lewis.. (1998) (Correct)
Active bibliography (related documents): More All
0.5: Sequence Types for Functional Languages - Biagioni (1995) (Correct)
0.3: Deforestation for Higher-Order Functional Programs - Marlow (1995) (Correct)
0.2: Total Correctness by Local Improvement in Program Transformation - Sands (1995) (Correct)
Similar documents based on text: More All
0.2: Warm Fusion in Stratego: A Case Study in Generation of.. - Johann, Visser (2000) (Correct)
0.2: Warm Fusion in Stratego: A Case Study in the Generation of.. - Johann, Visser (1999) (Correct)
0.1: Software Design for Reliability and Reuse: Phase II Final.. - Hook (1997) (Correct)
BibTeX entry: (Update)
@unpublished{ johann98warm,
author = "Patricia Johann and John Launchbury",
title = "Warm Fusion for Masses: Detailing Virtual Data Structure Elimination in Fully Recursive Languages",
year = "1998",
url = "citeseer.ist.psu.edu/article/johann97warm.html" }
Citations (may not include all citations):638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
385 A Transformation System for Developing Recursive Programs - Burstall, Darlington - 1977
382 Lambda Calculi with Types - Barendregt - 1992
324 Deforestation: Transforming Programs to Eliminate Trees - Wadler - 1990
268 Proofs and Types (context) - Girard - 1989
206 Why Functional Programming Matters - Hughes - 1989
161 A Shortcut to Deforestation - Gill, Launchbury et al. - 1993
143 Theorems for Free - Wadler - 1989
131 A Fold for All Seasons - Sheard, Fegaras - 1993
97 and Parametric Polymorphism (context) - Reynolds, Abstraction - 1983
84 Law and Order in Algorithmics (context) - Fokkinga - 1992
81 Algorithmics -- Towards Programming as a Mathematical Activi.. (context) - Meertens - 1986
73 Unboxed Values as First-class Citizens in a Non-strict Funct.. - Jones, Launchbury - 1991
70 ACM Transactions on Programming Languages and Systems (context) - Turchin, of et al. - 1986
67 Formal Aspects of Computing (context) - Meertens - 1992
55 Bananas in Space: Extending Fold and Unfold to Exponential T.. - Meijer, Hutton - 1995
50 A Categorical Programming Language (context) - Hagino - 1987
46 Recursive Types Reduced to Inductive Types (context) - Freyd - 1990
45 Warm Fusion: Deriving Build-Catas from Recursive Definitions - Launchbury, Sheard - 1995
41 Theories for Algorithm Calculation (context) - Jeuring - 1993
41 Homomorphisms and Promotability (context) - Malcolm - 1989
33 Domain Theoretic Models of Polymorphism - Coquand, Gunter et al. - 1989
31 Automatic Transformation of Series Expressions into Loops (context) - Waters - 1991
28 When Will Deforestation Stop (context) - Ferguson, Wadler - 1988
21 Cheap Deforestation for Non-strict Functional Languages - Gill - 1996
21 Listlessness is Better than Laziness (context) - Wadler - 1993
18 Filter Fusion - Proebsting, Watterson - 1996
18 Denotational Semantics (context) - Schmidt - 1986
11 A Roadmap to Metacomputation by Supercompilation (context) - Gluck, Sorensen - 1996
11 Deforestation for Higher-order Functional Programs - Marlow - 1995
10 Total Correctness and Improvement in the Transformation of F.. (context) - Sands - 1994
9 Listlessness is Better than Laziness II: Composing Listless .. (context) - Wadler
7 Fold Transformations Preserving Termination Properties (context) - Amtoft - 1992
7 The nofib Benchmarking Suite (context) - Partain - 1992
4 Obviously Synchronizable Series Expressions: Part I; User's .. (context) - Waters - 1987
2 Universiteit Nijmegen (context) - Meijer, Dissertation - 1992
2 Graph Algorithms with a Functional Flavor (context) - Launchbury - 1995
2 Fold-unfold Transformations on State Monadic Transformers (context) - Johnsson - 1994
Documents on the same site (http://www.cse.ogi.edu/PacSoft/projects/SDRR/p2_report.html): More
Software Design for Reliability and Reuse: Phase II Final.. - Hook (1997) (Correct)
From ML to Ada: Strongly-typed Language Interoperability via.. - Tolmach, Oliva (1993) (Correct)
Monadic State: Axiomatization and Type Safety - John Launchbury And (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