T. Sheard and L. Fegaras. Optimizing Algebraic Programs. OGI, Tech-report #94-004. The Extended version of this paper. Ftp-able from cse.ogi.edu:/pub/pacsoft/papers/OptAlgProg.ps. Submitted to PEPM'94. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Flattening an Object Algebra to Provide Performance - Boncz, Wilschut, Kersten (1998) (19 citations) (Correct)
....algebraic optimization has proven a powerful tool in this process. Currently, the research community tries to reuse this idea for the implementation of calculus based object query languages [ClD92] A lot of research is done in the complex area of translating such a language into an algebra [FeM95,GKG97,ShF94,SBB96], and the area of their optimization. A number of algebras on the object data model have been proposed, e.g. AQUA [LMS93] and KOLA [ChZ96] The implementation of such algebras is difficult due to the combination of the very large number of operations and the complex storage model. To our ....
T. Sheard & L. Fegaras, "Optimizing algebraic programs", OGI tech-report 94-004, Oregon Graduate Institute of Science and Technology, 1994.
Constraints to Stop Deforestation - Seidl, Sørensen (1998) (8 citations) (Correct)
....in explicit recursion patterns, although some functions can be transformed into this form automatically. Hence, there are cases where interpretive deforestation applies and algebraic approaches fail. However, the opposite is also the case. Gill [18] gives one example, and Sheard and Fegaras [56] show that a variant of their technique can obtain effects like tupling which are beyond deforestation. See also [37] We end the paper by noting that introducing a technique to ensure termination of deforestation requires some motivation, since there are several transformers with similar aims and ....
T. Sheard and L. Fegaras. Optimizing algebraic programs. Technical Report 94-004, Oregon Graduate Institute, 1994.
Optimizing Algebraic Programs - Sheard, Fegaras (1994) (2 citations) Self-citation (Sheard Fegaras) (Correct)
....step, N fails to compute the h i , this is signaled by the exception inverse and handled by normalizing the two pieces of the promotion step independently, thereby no longer introducing any inverse terms. A proof of correctness of the normalization algorithm can be found in a technical report[18]. 8 5.2 Simultaneous Traversal and the Tupling Lemma Algebraic programs make it easy to recognize situations where simultaneous traversal is applicable. Any two reductions over the same variable can be traversed simultaneously For example consider the example: len x; sum x) ....
T. Sheard and L. Fegaras. Optimizing Algebraic Programs. OGI, Tech-report #94-004. The Extended version of this paper. Ftp-able from cse.ogi.edu:/pub/pacsoft/papers/OptAlgProg.ps. Submitted to PEPM'94.
Optimizing Algebraic Programs - Sheard, Fegaras (1994) (2 citations) Self-citation (Sheard Fegaras) (Correct)
....step, N fails to compute the h i , this is signaled by the exception inverse and handled by normalizing the two pieces of the promotion step independently, thereby no longer introducing any inverse terms. A proof of correctness of the normalization algorithm can be found in a technical report[18]. 5.2 Simultaneous Traversal and the Tupling Lemma Algebraic programs make it easy to recognize situations where simultaneous traversal is applicable. Any two reductions over the same variable can be traversed simultaneously For example consider the example: len x; sum x) red[list]f nil ....
T. Sheard and L. Fegaras. Optimizing Algebraic Programs. OGI, Tech-report #94-004. The Extended version of this paper. Ftp-able from cse.ogi.edu:/pub/pacsoft/papers/OptAlgProg.ps. Submitted to PEPM'94.
Optimizing Algebraic Programs - Sheard, Fegaras (1994) (2 citations) Self-citation (Sheard Fegaras) (Correct)
....step, N fails to compute the h i , this is signaled by the exception inverse and handled by normalizing the two pieces of the promotion step independently, thereby no longer introducing any inverse terms. A proof of correctness of the normalization algorithm can be found in a technical report[18]. 5.2 Simultaneous Traversal and the Tupling Lemma Algebraic programs make it easy to recognize situations where simultaneous traversal is applicable. Any two reductions over the same variable can be traversed simultaneously For example consider the example: len x; sum x) red[list]f nil ....
T. Sheard and L. Fegaras. Optimizing Algebraic Programs. OGI, Tech-report #94-004. The Extended version of this paper. Ftp-able from cse.ogi.edu:/pub/pacsoft/papers/OptAlgProg.ps. Submitted to PEPM'94.
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