Short cut fusion is correct
نویسندگان
چکیده
منابع مشابه
Short Cut Fusion: Proved and Improved
Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermediate lists from modularly constructed functional programs. Arguments that short cut fusion is correct typically appeal either to intuition or to “free theorems” — even though the latter have not been known to hold for the languages...
متن کاملShort note: Strict unwraps make worker/wrapper fusion totally correct
The worker/wrapper transformation is a general way of changing the type of a recursive definition, usually applied with an eye to increasing algorithmic efficiency. This note identifies an infelicity in the program transformations presented by Gill and Hutton (2009) and proposes a new totally correct worker/wrapper fusion rule.
متن کاملMonadic Fold, Monadic Build, Monadic Short Cut Fusion
Short cut fusion improves the efficiency of modularly constructed programs by eliminating intermediate data structures produced by one program component and immediately consumed by another. We define a combinator which expresses uniform production of data structures in monadic contexts, and is the natural counterpart to the well-known monadic fold which consumes them. Like the monadic fold, our...
متن کاملA Generalization of Short-Cut Fusion and its Correctness Proof
Short-cut fusion is a program transformation technique that uses a single, local transformation—called the foldr-build rule—to remove certain intermediate lists from modularly constructed functional programs. Arguments that short-cut fusion is correct typically appeal either to intuition or to “free theorems”—even though the latter have not been known to hold for the languages supporting higher...
متن کاملShort Cut Fusion of Recursive Programs with Computational Effects
Fusion is the process of improving the efficiency of modularly constructed programs by transforming them into monolithic equivalents. This paper defines a generalization of the standard build combinator which expresses uniform production of functorial contexts containing data of inductive types. It also proves correct a fusion rule which generalizes the fold/ build and fold/buildp rules from th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2003
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796802004409