Jonathan Martin and Michael Leuschel. Sonic partial deduction. In Dines Bjrner, Manfred Broy, and Alexander V. Zamulin, editors, Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, number 1755 in Lecture Notes in Computer Science, pages 101--112, Akademgorodok, Novosibirsk, Russia, July 1999. Springer-Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....into a KMPlike residual program. Such partial evaluators include Futamura s Generalized Partial Computation [26] Smith s partial evaluator for constraint logic programming languages [48] Queinnec and Ge#roy s intelligent backtracking [46] supercompilation [28, 29, 49, 50, 51] partial deduction [44], partial evaluators for functional logic programs [4, 40] and the composition of a memoizing interpreter and a standard partial evaluator [27] Like Similix, none of these partial evaluators has been proven correct and there are no guarantees about the resources required to produce residual ....

Jonathan Martin and Michael Leuschel. Sonic partial deduction. In Dines Bjrner, Manfred Broy, and Alexander V. Zamulin, editors, Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, number 1755 in Lecture Notes in Computer Science, pages 101--112, Akademgorodok, Novosibirsk, Russia, July 1999. Springer-Verlag.

....of enclosing conditional tests, and for Queinnec and Ge#roy s intelligent backtracking system [19] where abstract descriptions of the matched and unmatched patterns are maintained across success and failure continuations. Other partial evaluators that pass the KMP test include partial deduction [18] and partial evaluators for functional logic programs [1, 17] A generic way to make a given partial evaluator more powerful is the interpretive approach where an interpreter is inserted between a partial evaluator and a source program. Depending on how the interpreter is written, one can use a ....

Jonathan Martin and Michael Leuschel. Sonic partial deduction. In Dines Bjrner, Manfred Broy, and Alexander V. Zamulin, editors, Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, number 1755 in Lecture Notes in Computer Science, pages 101--112, Akademgorodok, Novosibirsk, Russia, July 1999. Springer-Verlag.

....and the simple nonvar tests at run time. But as said above, perhaps due to lack of a good application (for languages with delay, speed is more important than safety) there seems to be no work on generating such conditions. Another hybrid approach is taken in a recent work independent of ours [26]. This work also starts from the termination condition. When it is violated, the size of the term w.r.t. the norm used in the termination condition and the maximal reduction of the size in a single iteration is used to compute the number of unfolding steps. The program is transformed and calls to ....

J. Martin. Sonic Partial Deduction. Technical Report, Dept. Elec. and Comp. Sc., University of Southampton, January 1998.

....logen even surpasses both of them (for exdepth, grammar, regexp:r1 and regexp:r2) Being a pure offline system, logen cannot pass the KMP test, which can be seen in the timings for match:kmp in Table 2. To be able to pass the KMP test, more sophisticated local control would be required, see [56] and the discussion below. To be fair, both ecce and mixtus are fully automatic systems guaranteeing termination, while for logen further work will be needed so that the binding type classifications used in the above benchmarks can be derived automatically (while still ensuring termination) We ....

....analysis by themselves) The local control component of our generating extensions is still rather limited: either a call is always reducible or never reducible. To remedy this problem, and to allow any kind of partially instantiated data, an extension of our cogen approach has been developed in [56]. This approach uses a sounding analysis (at specialisation time) to measure the minimum depth of partially instantiated terms. The result of this analysis is then used to control the unfolding and ensure termination. This approach allows more aggressive unfolding than the technique presented in ....

[Article contains additional citation context not shown here]

J. Martin and M. Leuschel. Sonic partial deduction. In Proceedings of the Third International Ershov Conference on Perspectives of System Informatics, LNCS, Novosibirsk, Russia, 1999. Springer-Verlag. To appear.

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