M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of 6th Int'l Symp. on Programming Language Implementation and Logic Programming, pages 370--384. Springer LNCS 844, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... an important improvement of (lazy) narrowing is the incorporation of deterministic simplification steps which can largely reduce both run time and search space in comparison to pure logic programs, since normalization can avoid the creation of useless choice points in sequential implementations [16, 17]. Program specialization refers to the technique of how to derive a specialized instance of a program to a restricted set of inputs. Particular cases include Partial Evaluation (PE) of functional [23] and logic [11, 29] programs. PE of functional programs, as in [23] is usually restricted to ....

....time and space [17] A w.r.t. is given by a normalization followed by a narrowing step . The idea of exploiting deterministic computations by including normalization has been applied to almost all narrowing strategies, e.g. basic [19, 35] innermost [10] innermost basic [19] and lazy narrowing [16]. Lazy narrowing reduces expressions at outermost narrowable positions. Narrowing at inner positions is performed only if it is demanded (by the pattern in the lhs of some rule) and contributes to some later narrowing step at an outer position. Since the notion of demanded position is not ....

[Article contains additional citation context not shown here]

M. Hanus. Combining Lazy Narrowing with Simplification. In , pages 370--384. Springer LNCS 844, 1994.

....Term Term for narrowing and a (possibly empty) sequence of rules of the form Term Term used for rewriting. This distinction is useful when nonterminating programs are considered, since the (possibly empty) terminating subset of the program rules can be safely used for simplification [Fri85, Han94a] The following grammar formalizes our language. We use the following notations in grammar rules. Terminals are character sequences enclosed within apostrophes, denotes a (possibly empty) repetition, denotes an optional part, and . denotes a choice. Program : Rule ; ....

M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of 6th Int'l Symp. on Programming Language Implementation and Logic Programming, pages 370--384. Springer LNCS 844, 1994.

.... purely logic languages like the Prolog cut operator [HKMN95] The idea of exploiting deterministic computations by including normalization has been applied to almost all narrowing strategies, e.g. basic [NRS89, R 87] innermost [Fri85] innermost basic [Hol89] LSE [BW95] and lazy narrowing [Han94a] 3 Partial Evaluation of Functional Logic Programs In this section, we introduce a generic procedure for the partial evaluation of functional logic programs and show its correctness. Our construction follows mainly the theoretical framework established in Lloyd and Shepherdson [LS91] and ....

....of using only a subset of the program rules for normalization. This is interesting when normalizing lazy narrowing is considered and programs contain terminating as well as non terminating rules, since the use of (a subset of) terminating rules for normalization is safe in this context [Han94a] In order to assess the practicality of our approach, we have benchmarked the speed and specialization achieved by the INDY system. We consider a set of benchmark programs which cover a range of (functional as well as logic) program transformation problems. The benchmarks used for the analysis ....

M. Hanus. Combining lazy narrowing with simplification. In Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming, volume 844 of Lecture Notes in Computer Science, pages 370--384, Berlin, 1994. Springer-Verlag.

No context found.

M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of 6th Int'l Symp. on Programming Language Implementation and Logic Programming, pages 370--384. Springer LNCS 844, 1994.

No context found.

M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of 6th Int'l Symp. on Programming Language Implementation and Logic Programming, pages 370--384. Springer LNCS 844, 1994.

No context found.

M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of PLILP'94, pages 370--384. Springer LNCS 844, 1994.

No context found.

M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of 6th Int'l Symp. on Programming Language Implementation and Logic Programming, pages 370--384. Springer LNCS 844, 1994.

No context found.

M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. PLILP'94, pages 370--

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