R. Gluck and M.H. S rensen. A Roadmap to Metacomputation by Supercompilation. In O. Danvy, R. Gluck, and P. Thiemann, editors, Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany, pages 137-160. Springer LNCS 1110, 1996. @ NUS Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Forward Slicing by Partial Evaluation - Vidal (Correct)
....in order to remove unnecessary function symbols. Hence, partial evaluation constructs a new, residual program. In contrast, program slicing should preserve the structure of the original program: statements can be (totally or partially) deleted but new statements cannot be introduced. Following [12], partial evaluators can be classi ed into the following categories: monovariant : each function of the original program gives rise to (at most) one residual function, polyvariant : each function of the original program may give rise to one or more residual functions, monogenetic: each ....
R. Gluck and M.H. S rensen. A Roadmap to Metacomputation by Supercompilation. In O. Danvy, R. Gluck, and P. Thiemann, editors, Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany, pages 137-160. Springer LNCS 1110, 1996.
Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2001) (Correct)
.... technique using the de nition, unfolding, and folding rules [45] with the following two restrictions: i) each new predicate introduced by the de nition rule is de ned by precisely one nonrecursive clause whose body consists of precisely one atom (in this sense, according to the terminology of [16], partial deduction is said to be monogenetic) and (ii) the folding rule uses only clauses introduced by the de nition rule. In what follows the de nition and folding rules which comply with restrictions (i) and (ii) are called atomic de nition and atomic folding, respectively. In Section 3 ....
R. Gluck and M. H. S rensen. A roadmap to metacomputation by supercompilation. In O. Danvy, R. Gluck, and P. Thiemann, editors, Partial Evaluation, Lecture Notes in Computer Science 1110, pages 137-160. Springer, 1996.
Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2002) (Correct)
.... using the familiar de nition, unfolding, and folding rules [37] with the following two restrictions: i) each new predicate introduced by the de nition rule is de ned by precisely one non recursive clause whose body consists of precisely one atom (in this sense, according to the terminology of [13], partial evaluation of logic programs is said to be monogenetic) and (ii) the folding rule uses only clauses introduced by the de nition rule. In what follows the de nition and folding rules which comply with restrictions (i) and (ii) are called atomic de nition and atomic folding, ....
R. Gluck and M. H. S rensen. A roadmap to metacomputation by supercompilation. In O. Danvy, R. Guck, and P. Thiemann, editors, Partial Evaluation, Lecture Notes in Computer Science 1110, pages 137-160. Springer, 1996.
From Checking to Inference via Driving and Dag Grammars - Secher, Sørensen (2002) (3 citations) (Correct)
....ys Cons iscons ys x xs 3 7 7 7 7 7 5 : D represents a call to same where the arguments are unknown. E represents the body of same: a pattern match on the variable xs and a call to iscons with three arguments (cf. Example 1) The order of the arrows is important, since it 1 Gl uck S rensen [4] have presented a method for preventing non termination and performing generalisations of dangerous terms, as it were, based on certain quasi orders. With a few extensions, this method can be applied to our language. We can prove that such an extended method will indeed guarantee termination of ....
....soundness for termination. What is common to both ours and the above methods is that they all build upon the ground breaking work of Turchin and co workers. The rst English paper that contains examples of program inversion by driving seems to be [15] For more references, see S rensen Gl uck [4]. Grammars The idea of approximating functional programs by grammars is not new. For instance, Jones [5] presents a ow analysis for non strict languages by means of tree grammars. Based on this work, the second author has developed a technique using tree grammars to approximate termination ....
Gl uck, R., and S rensen, M. A roadmap to metacomputation by supercompilation. In Partial Evaluation (1996), O. Danvy, R. Gluck, and P. Thiemann, Eds., vol. 1110 of Lecture Notes in Computer Science, Springer-Verlag, pp. 137-160.
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.