Carsten K. Gomard and Neil D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, North-Holland, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... l : al j al : a al j Delta a : x : e; e : x j o(e ) j : goto l; j return; j if t(x ) then l 1 else l 2 ; Figure 3: Syntax of the Flowchart Language FCL 2 The Flowchart Language FCL We present the principles of our ABPS using the simple flowchart language FCL of Gomard and Jones [17, 23, 22]. As they note, FCL is small enough to allow a clean semantic presentation, but rich enough conceptually to illustrate a multitude of issues associated with program specialization. 2.1 Syntax Figure 3 presents the syntax of FCL. An FCL program (l) b consists of a list of basic blocks b ....

Carsten K. Gomard and Neil D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, North-Holland, 1989.

....in three addres code form. The explicit stack manipulation inherent in JVM instructions is removed by introducing temporary variables. To capture the essence of the Jimple structure for our formal study of slicing and model checking, we use the simple flowchart language FCL of Gomard and Jones [24, 25, 35]. 2.1 Syntax Figure 1 presents the definition of FCL syntax. An FCL program consists of a list of parameters x , a label l of the initial block to be executed, and a non empty list b of basic blocks. Each basic block consists of a label followed a (possibly empty) list of assignments. Each ....

Carsten K. Gomard and Neil D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, North-Holland, 1989.

....on the shape of commonly used formula patterns. Section 7 discusses related work on slicing, and Section 8 summarizes and concludes with a description of future work. 2 The Flowchart Language FCL 2. 1 Syntax We take as our source language the simple flowchart language FCL of Gomard and Jones [18, 25, 19]. Figure 1 presents an FCL program that computes the power function. The input parameters the program are m and n. These variables can be referenced and assigned to throughout the program. Other variables such as result can be introduced at any time. The initial value of a variable is 0. The ....

C. Gomard and N.D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, North-Holland, 1989.

.... studied for a wide variety of programming languages [4, 9, 13, 36] Both its theoretical and practical aspects have led to major advances of the technology [10, 22, 35] Researchers have illustrated the potentials of this technology by applying it to various problems such as compiler generation [1, 15, 26, 29, 30], graphics applications [6, 25, 34] and scientific computing [7, 8, 24, 31] Ultimately, just like a compiler, a partial evaluator is a tool. As such, research in the field should also aim at developing systems capable of exploiting specialization opportunities in applications written by ....

C. K. Gomard and N. D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139-- 1144. IFIP, Amsterdam: North-Holland, 1989.

....expressed in Scheme, extended with ML like datatypes. 3.2 Imperative languages Partial evaluation of imperative programs has received much attention recently. Gomard and Jones implemented the first self applicable partial evaluator for imperative programs written in a simple flow chart language [54, 55]. They noticed how crucial it is to avoid specialization with respect to dead static variables. Meyer developed an online partial evaluator for a subset of Pascal [84] Nirkhe and Pugh [91] describe a partial evaluator for hard realtime problems where programs are constrained by the user to keep a ....

C. K. Gomard and N. D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, North-Holland, 1989.

....may be found in [2, 3, 4, 5, 32, 88] 9. 2 Partial evaluators Imperative languages: Early papers on partial evaluation for imperative languages include [34, 36, 37] Bulyonkov and Ershov reported a self applicable partial evaluator for a flow chart language [25] so did Gomard and Jones [50]. Gluck et al. created a (non self applicable) specializer for numeral algorithms in Fortran [11, 47] Andersen [6, 8, 9] developed two systems for specialization of C programs; see Section 6.3. Lisp and Scheme: The first major partial evaluator for Lisp was Redfun, reported by Beckman et al. ....

C. K. Gomard and N. D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, Amsterdam: North-Holland, 1989.

No context found.

Carsten K. Gomard and Neil D. Jones. Compiler generation by partial evaluation. In G. X. Ritter, editor, Information Processing '89. Proceedings of the IFIP 11th World Computer Congress, pages 1139--1144. IFIP, North-Holland, 1989.

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