W. Chin, A. Goh, and S. Khoo. Effective Optimisation of Multiple Traversals in Lazy Languages. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, San Antonio, Texas, USA (Technical Report BRICS-NS-99-1), pages 119--130. University of Aarhus, DK, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Tupling for Functional-Logic Programs - Moreno (2002) (Correct)
....make it possible the optimizations to be pursued [10, 22, 20] In this paper, we propose a fully automatic tupling algorithm (based on folding unfolding) which uses an incremental eureka generator. In contrast with prior non automatic approaches (tupling has only been semi automated to some extent [11, 12]) where eurekas are generated by a complicate pre process that uses complex data structures and or produces redundant computations, our approach is fully automatic and covers most practical cases. The key point of our algorithm is a simple eureka generator that, in an incremental way, produces an ....
....the considered data structures more than once. As it is well known in the literature, tupling is very complicated and automatic tupling algorithms either result in high runtime cost (which prevents them from being employed in a real system) or they succeed only for a restricted class of programs [11, 12]. Our approach drops out some of these limitations by automating a realistic and practicable tupling algorithm that optimizes functional logic programs. There are several important remarks to do regarding our algorithm. A key point is the way in which eureka definitions are derived. In contrast ....
W. Chin, A. Goh, and S. Khoo. Effective Optimisation of Multiple Traversals in Lazy Languages. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, San Antonio, Texas, USA (Technical Report BRICS-NS-99-1), pages 119--130. University of Aarhus, DK, 1999.
Transformation-based Strategies for Lazy Functional.. - Alpuente, Falaschi.. (1999) (Correct)
....inner function call builds up a composite object which is used by the outer call, and composing these two calls into one has the effect to avoid the generation of the intermediate data structure. The composition can be made automatically [38] whereas tupling has only been automated to some extent [9, 10]. Although a lot of literature has been devoted to proving the correctness of fold unfold systems w.r.t. the various semantics proposed for logic programs [7, 17, 25, 29, 32, 36] in functional programming the problem of correctness has received surprisingly little attention [11, 27, 34, 35] Of ....
....to become a standard in the functional logic community [20, 22] It also includes a fully automatic composition strategy based on some (apparently reasonable) heuristics. We are currently extending it in order to mechanize some (delimited form of) tupling (e.g. by using the analysis method of [9, 10]) The transformation system allows us to choose between two ways to apply the composition strategy. The first way is semi automatic, since the user has to indicate the rule in which a nested 13 Table 1. Benchmark results. Benchmarks Rw1 RT1 Rw2 RT2 Speedup ( doubleappend 3 1.77 6 1.63 10 ....
W. Chin, A. Goh, and S. Khoo. Effective Optimisation of Multiple Traversals in Lazy Languages. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, San Antonio, Texas, USA (Technical Report BRICS-NS-99-1), pages 119--130. University of Aarhus, DK, 1999.
A Transformation System for Lazy Functional Logic Programs - Alpuente, Falaschi.. (1999) (3 citations) (Correct)
....inner function call builds up a composite object which is used by the outer call, and composing these two calls into one has the effect to avoid the generation of the intermediate data structure. The composition can be made automatically [30] whereas tupling has only been automated to some extent [9, 10]. Although a lot of literature has been devoted to proving the correctness of fold unfold systems w.r.t. the various semantics proposed for logic programs [7, 13, 20, 21, 23, 28] in functional programming the problem of correctness has received surprisingly little attention [26, 27] Of the very ....
W. Chin, A. Goh, and S. Khoo. Effective Optimisation of Multiple Traversals in Lazy Languages. In Proc. of PEPM'99 (Technical Report BRICS-NS-99-1), pages 119--130. University of Aarhus, DK, 1999.
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