Bjørner, D., A. P. Ershov, N. D. Jones, Proc. Workshop on Partial Evaluation and Mixed Computation, North-Holland, 1988  Home/Search   Document Not in Database   Summary   Related Articles

....in particular applications of the two just mentioned to compiling and compiler generation. Several examples of symbolic composition are given, culminating in nontrivial applications to compiler generation [14] 18] Partial evaluation has recently become the subject of considerable interest [1]. Reasons include simplicity, efficiency and the surprising fact that self application can be used in practice to generate compilers, and a compiler generator as well. This paper makes three contributions: First, it introduces a new notation to describe the types of symbolic operations, one that ....

....composed symbolically in a way very analogous to finite transducers. For a small example, consider the three term algebras T (A) T (B) T (C) over signatures given in Figure 4. Using a natural denotational notation we now define two derivors. One is [ AB from T (A) to T (B) 0] AB = zero [[1]] AB = one [ a 1 a 2 ] AB = a 1 ] AB plus [ a 2 ] AB [ a 1 Gamma a 2 ] AB = a 1 ] AB plus (minus [ a 2 ] AB ) and the second is [ BC from T (B) to T (C) zero] BC = push(0) one] BC = push(1) b 1 plus b 2 ] BC = b 1 ] BC ; b 2 ] BC ; add [ minus b] BC = b] ....

[Article contains additional citation context not shown here]

Bjørner, D., A. P. Ershov, N. D. Jones, Proc. Workshop on Partial Evaluation and Mixed Computation, North-Holland, 1988

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