3 citations found. Retrieving documents...
Charles Farnum. Pattern-based languages for prototyping compiler optimizers. PhD thesis, Computer Science Division---EECS, University of California, Berkeley, December 1990. Available as technical report UCB//CSD-90-608.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Statically Checkable Pattern Abstractions - Fähndrich, Boyland (1997)   (2 citations)  (Correct)

....only a syntactically fixed number of initial nodes of each tree. Second, patterns cannot be used with abstract data types. Third, patterns cannot be named and reused. All problems hamper program development, maintenance, and evolution. A number of proposals have addressed the first problem [8, 2, 6, 12], but without addressing the second one. Effort partially sponsored by the Defense Advanced Research Projects Agency, and Rome Laboratory, Air Force Materiel Command, USAF, under agreement number F30602 97 2 0241. The U.S. Government is authorized to reproduce and distribute reprints for ....

....v) r] let x1 = s1 and : and xn = sn in e] Figure 5: Translation of canonicalized patterns to Standard ML. 7 Related Work A class of work extends Hoffman and O Donnell s [9] simple matchers with complex operations such as the subtree operator of Trafola [8] the vertical iterator of Dora [2, 6], and Queinnec and Geffroy s recursive tree operator [12] All these extensions match recognizable forests, but do not address pattern abstraction per se. Aitken and Reppy s abstract value constructors (AVC) 1] form a subclass of our named patterns without alternation, recursion or node creation. ....

Charles Farnum. Pattern-based languages for prototyping compiler optimizers. PhD thesis, Computer Science Division---EECS, University of California, Berkeley, December 1990. Available as technical report UCB//CSD-90-608.


Building Program Optimizers with Rewriting Strategies - Visser, Benaissa, Tolmach (1998)   (32 citations)  (Correct)

....generators. The component is specified in a high level language from which the program generator produces its implementation. Program optimizers are difficult labor intensive components that are usually still developed manually, despite many attempts at producing optimizer generators (e.g. [19, 12, 28, 25, 18, 11]) This work was supported, in part, by the US Air Force Materiel Command under contract F19628 93 C 0069 and by the National Science Foundation under grant CCR 9503383. To appear in P. Hudak and C. Queinnec (editors) The 1998 International Conference on Functional Programming (ICFP 98) ACM, ....

....of the specific domain of term transformation. 8 Related Work Program Optimization There have been many attempts to build frameworks for program analysis and optimization, often using special purpose formalisms. The systems closest to ours in spirit are probably OPTRAN [19] and Dora Tess [12]. Like our system, these are based on ideas from term rewriting and emphasize separating the declarative specification of rewrite rules from the strategy to be used in applying them. Unlike our system, however, they support only a fixed set of pre defined strategy options, and the same strategy ....

Charles Donald Farnum. Pattern-Based Languages for Prototyping of Compiler Optimizers. PhD thesis, University of California, Berkeley, 1990. Technical Report CSD-90-608.


Proteus: An Adaptable Presentation System for a Software.. - Munson (1994)   (7 citations)  (Correct)

.... PrevArrow2 NodeShell NextShell NextLine1 NextLine2 NextLine3 NextArrow1 NextArrow2 ; The description of tree transformations is an area of active interest among programming language researchers because of its applicability to certain problems in compilation and in specification based programming [18, 25]. Interactions with Box Layout Attributes The box layout service was originally designed to meet the needs of the text medium. It is well suited to text because text paragraphs are usually aligned with the axes of the Cartesian plane. Exceptions to this rule occur primarily in text for ....

Charles Donald Farnum. Pattern-Based Languages for Prototyping of Compiler Optimizers. PhD dissertation, Computer Science Division, University of California, Berkeley, California, December 1990. Available as Technical Report No. UCB/CSD 90/608.

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