Farnum, C. D. Pattern-Based Languages for Prototyping of Compiler Optimizers. Ph.D. dissertation, CS Division, EECS, University of California, Berkeley, Dec. 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Preliminary Proceedings of the ACM SIGPLAN Haskell Workshop.. - (editor) (2001) (Correct)
....Reactive User Interface Toolkit, based on a formal model of graphical user interfaces. The Fruit model is is based on AFRP, an adaptation of ideas from Functional Reactive Animation (Fran) 9,7] and Functional Reactive Programming (FRP) 14,27] to the arrows framework recently proposed by Hughes [15]. AFRP is based on two ideas: signals, which are functions from real valued time to values, and signal transformers, which are functions from signals to signals. Using only the AFRP model and simple mouse, keyboard and picture types, we define GUIs compositionally as signal transformers. We ....
....Defining ST as a newtype and only providing a fixed set of primitives and combinators allows us to prove that the implementation is free of space time leaks by simple structural induction on the ST type. 2. 3 Arrows Recently, Hughes proposed arrows as a basis for building combinator libraries [15]. Concretely, Arrow is a Haskell type class that denotes a computation from some input type to some result type. In his introduction to arrows [15] Hughes presents a number of examples of arrow instances, including Haskell s built in function type constructor ( and stream processors, and ....
[Article contains additional citation context not shown here]
Farnum, C. D., "Pattern-Based Languages for Prototyping of Compiler Optimizers," Ph.D. thesis, University of California, Berkeley (1990), technical Report CSD-90-608.
Playing by the Rules: Rewriting as a practical.. - Jones, Tolmach, Hoare (2001) (13 citations) (Correct)
....as in Stratego [37] Simple pattern matching. We rely on the programmer to use high level operators, such as foldr, that encapsulate control ow. Thus we don t need to provide sophisticated contextual pattern matching to identify loops or recursions, unlike systems like OPTRAN [26] Dora Tess [15], and KHEPERA [14] Nor do we have to deal with the unpredictability and possible high cost of higher order matching, as used in MAG [10] No side conditions. We work with a purely functional language, which means that many useful optimizing transformations are context independent and don t ....
Farnum, C. D., \Pattern-Based Languages for Prototyping of Compiler Optimizers," Ph.D. thesis, University of California, Berkeley (1990), technical Report CSD-90-608.
Language and Document Support in Software Development Environments - Graham (1992) (9 citations) (Correct)
....logic database. We are extending support to execution by combining the user interaction facilities with our new methods for dynamic compilation. Translation to executable code is realized as a sequence of description driven translation phases, described by efficient pattern based transformations [9]. We are developing methods to compose these transformations, so as to provide a mapping between source code and target code. Using the composed transformation, we can provide debugging support in which the user indicates all actions (for example, setting conditional breakpoints, printing or ....
C. D. Farnum. Pattern-Based Languages for Prototyping of Compiler Optimizers. PhD thesis, CS Division, EECS, University of California, Berkeley, Dec. 1990.
Design and Implementation of Tree-Transformations in Ensemble.. - Boshernitsan (1997) (Correct)
....One such schema that transforms Java for loops into while loops is presented in Figure 7. Quite obviously it is far from being self explanatory. ffl The pattern matching mechanism of TTL is very limited. In particular, one frequently wishes to match so called horizontal and vertical iterators [Farnum 1990]. These are patterns that may contain wildcards not only at leafs (vertical iterators) and match multiple children (horizontal iterators) Present implementation of TTL and the pattern matcher is not powerful enough to allow this extension. ffl As Figure 7 illustrates, one of the problems with ....
Farnum, C. D. Pattern-based languages for prototyping of compiler optimizers. Master's thesis, University of California, Berkeley, 1990.
Strategic Pattern Matching - Visser (1999) (18 citations) (Correct)
....Overlays and contexts are not supported either by ELAN or by Maude. See [22, 23] for more details on the relation between these languages. A wide range of languages introduce enhanced pattern matching features. A brief and necessarily incomplete overview follows: The transformation languages Dora [10] and TXL [6, 15] are examples of languages with some ad hoc combinations of traversal and pattern matching. Context patterns can be implemented by means of higher order matching in Prolog [17] A higher order pattern F(t) instantiates the function variable F such that application to t yields ....
C. D. Farnum. Pattern-Based Languages for Prototyping of Compiler Optimizers. PhD thesis, University of California, Berkeley, 1990. Technical Report CSD-90-608.
Unknown - (Correct)
No context found.
Farnum, C. D. Pattern-Based Languages for Prototyping of Compiler Optimizers. Ph.D. dissertation, CS Division, EECS, University of California, Berkeley, Dec. 1990.
Automatic Generation Of Data-Flow Analyzers: A Tool For Building.. - Tjiang (1993) (5 citations) (Correct)
No context found.
C. D. Farnum. Pattern-Based Languages for Prototyping of Compiler Optimizers. Ph.D. Th., University of California, Berkeley, 1990.
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