Y. Futamura. Program evaluation and generalized partial computation. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 685--692, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....analyze the structure of the cycle. Therefore, we can compute partial solutions in a preprocessing manner (all possible solutions if finitely or only a subset otherwise) If some variables will be instantiated in the course of further computation, we can update the partial solutions (see also e.g. [Fut88] on partial evaluation) Furthermore, cycle unification helps us to transform recursive programs to iterative ones. The iterative structure can be compiled such that a proof might be detected faster than with the depth first search of Prolog. One of the important applications is datalogic, i.e. ....

Y. Futamura. Program evaluation and generalized partial computation. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 685--692, 1988.

....certain trivial differences. The main difference between the two is that the former also maintains negative information, i.e. the information that a test failed, and this is maintained in the form of constraints (see perfect driving [34] Generalized partial computation (GPC) due to Futamura [25], has a similar effect and power as supercompilation, but has arbitrary tests rather than just patterns and equality tests. The underlying logic for the tests can be any logic system, for example predicate logic, and may be undecidable for certain logic formulas. In this view, positive ....

Y. Futamura. Program evaluation and generalized partial computation. In International Conference on Fifth Generation Computer Systems, pp. 1--8, 1988.

....as well as some more dramatic optimizations. This is done by driving, i.e. unfolding and propagation of information, and generalization (Turchin, 1988) a form of abstraction which enables folding. The decision when to generalize is taken online. Generalized partial computation (GPC) due to Futamura (1988), has similar effects and power as supercompilation, but requires the use of a theorem prover. The above methodologies have been developed for functional languages. Similar methodologies are also being studied for other language paradigms, e.g. partial deduction in logic programming (Lloyd and ....

Futamura, Y. 1988. Program evaluation and generalized partial computation. In International Conference on Fifth Generation Computer Systems, pages 1--8, Tokyo, Japan.

....value. If it is, then by explicitly adding an assignment in the truth branch of the conditional and copying the statements which use x into both branches, the statements in the truth branch can be specialized with respect to this common value for x. This example of generalized partial computation [15, 16] has proven useful both with the Sun RPC as well as with application generation. This binding time improvement is possible because the binding time analysis is flow sensitive. The second example shows how return sensitivity is crucial to specialize the excerpt of the Sun RPC client code [21] shown ....

Y. Futamura. Program evaluation and generalized partial computation. In International Conference on Fifth Generation Computer Systems, Tokyo, Japan, pages 1-- 8, 1988.

No context found.

Y. Futamura. Program evaluation and generalized partial computation. In International Conference on Fifth Generation Computer Systems, Tokyo, Japan, pages 1--8, 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