D. A. Smith. Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. In Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....making them able to pass the KMP test [49] i.e. to specialize the original quadratic string matching program 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 ....

Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Paul Hudak and Neil D. Jones, editors, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices, Vol. 26, No 9, pages 62--71, New Haven, Connecticut, June 1991. ACM Press.

.... will not formally prove that the target programs indeed implement the KMP BM algorithms, as this would require a rather heavy machinery; no attention will be paid to the complexity of the preprocessing phase; as it is a rather common exercise to achieve the KMP algorithm by PE (see e.g. Smi91] for a survey) we primarily focus upon the BM algorithm. 7.2 The KMP method This is the method described in [KMP77] As made explicit in [AHU74, Algorithm 9.3] it amounts to constructing from p a DFA which given s as input enters its accepting state exactly at the end of the first occurrence ....

Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut. (Sigplan Notices, vol. 26, no. 9), 1991.

....of a pattern in a text, a partial evaluator specializes this string matcher with respect to a pattern and yields a residual program that traverses the text in linear time. The problem was first stated by Yoshihiko Futamura in 1987 [15] and since then, it has given rise to a variety of solutions [2, 3, 10, 13, 14, 16, 19, 25, 28, 29, 32, 33]. For 15 years, however, it has also been pointed out that the traditional solution only solves half of the problem. Indeed, the Knuth Morris Pratt matcher first produces a next table in time linear in the length of the pattern and then traverses the text in time linear in the length of the ....

.... this e#ect, one can either rewrite the matcher so that backtracking only depends on static data (such a rewriting is known as a binding time improvement or a staging transformation [27] and use a simple partial evaluator [4, 10] or keep the matcher as is and use a sophisticated partial evaluator [13, 29, 32]. In this article, the starting point is a staged quadratic3 time matcher and a simple memoizing partial evaluator, such as Similix, where specialization points are dynamic conditionals and dynamic functions [6] Figure 1 displays a staged matcher similar to the ones developed in the literature ....

Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Hudak and Jones [20], pages 62--71.

....of safe programs (see Theorem 6) 3.2 An Example of Partial Deduction: String Matching In this section we illustrate the partial deduction strategy by means of a well known program specialization example which consists in specializing a general string matching program w.r.t. a given pattern (see [11, 13, 43] for a similar example) Given a program for searching a pattern in a string, and a xed ground pattern p, we want to derive a new, specialized program for searching the pattern p in a given string. Now we present a general program, called Match, for searching a pattern P in a string S in fa; bg ....

....M for the program Match Pos is fmatch pos( append( length( g. We leave it to the reader to verify that Match Pos satis es M . The derivation we will perform using the Determinization Strategy is more challenging than the ones presented in the literature (see, for instance, [11, 12, 13, 15, 43]) because an occurrence of the pattern P in the string S is speci ed in the initial program (see clause 1) in a nondeterministic way by stipulating the existence of two substrings L and R such that S is the concatenation of L, P , and R. We want to specialize the Match Pos program w.r.t. the ....

[Article contains additional citation context not shown here]

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Proceedings ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pages 62-71. ACM Press, 1991. 73

....specialized pattern matcher for a given pattern. In this example we de ne a general matching relation between strings which is expressed as a constraint logic program. Our derivation generalizes the derivations of the Knuth Morris Pratt matcher [19] which were presented, among others, in [10 12, 15, 23, 24]. As in the case of that matcher, we derive a program which behaves like a deterministic nite automaton with transitions labelled by constraints, rather than symbols of the strings. We improve over the derivations of specialized pattern matchers presented in [10 12, 15, 24] because we start from ....

....among others, in [10 12, 15, 23, 24] As in the case of that matcher, we derive a program which behaves like a deterministic nite automaton with transitions labelled by constraints, rather than symbols of the strings. We improve over the derivations of specialized pattern matchers presented in [10 12, 15, 24] because we start from a nondeterministic speci cation of the matcher, while in those papers the initial programs are deterministic. As already mentioned, the improvement over [23] is that we now deal with a general pattern matcher presented as a constraint logic program. In our example we de ....

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. PEPM '91, SIGPLAN Notices, 26, 9, 62-71. ACM Press, 1991.

....Takano has no concept of generalisation and will therefore terminate only for a small class of programs. If one abandons simple functional languages and considers logic programming and constraint logic programming, several accounts exist of equivalent transformation power, e.g. Smith and Hickey [102, 40], Lafave and Gallagher [58, 59] In these frameworks, search and or constraint solving facilities of the logic language provides the necessary machinery to avoid redundant computations. In this field, great efforts have been made to produce optimal specialisation, and at the same time to ensure ....

SMITH, D. Partial evaluation of pattern matching in constraint logic programming. In PEPM'91 [2], pp. 62-71. SRI,NSI,N, M. Turchin's supercompiler revisited. Master's thesis, Department of Computer Science, University of Copenhagen, 1994. DIKU- rapport 94/17.

....matcher for a given pattern. In this example we de ne a more general matching relation between strings which is expressed as a constraint logic program. Our derivation generalizes the derivations of the Knuth Morris Pratt matcher which were presented, among others, in [8] 9] 10] 13] 19] [20]. As in the case of that matcher, we derive a program which is a deterministic nite automaton with transitions labelled by constraints, rather than symbols of the strings. We improve over the derivations of specialized pattern matchers presented in [8] 9] 10] 13] 20] because we start from ....

....[9] 10] 13] 19] 20] As in the case of that matcher, we derive a program which is a deterministic nite automaton with transitions labelled by constraints, rather than symbols of the strings. We improve over the derivations of specialized pattern matchers presented in [8] 9] 10] 13] [20] because we start from a nondeterministic speci cation of the matcher, while in those papers the initial programs are deterministic. As already mentioned, the improvement over [19] is that we now deal with a general pattern matcher presented as a constraint logic program. In our example we de ....

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. PEPM '91, SIGPLAN Notices, 26, 9, 62-71. ACM Press, 1991.

....applying these rules to every predicate associated with the visited nodes. Apparently, their generalisation operation is based on syntactic equality (and probably the msg operator) This makes it dicult to assess the generality of their method. However, their techniques were successfully applied [Smi91] to derive the Knuth Morris Pratt pattern matcher from a semi naive program using nite domain constraints. By contrast we can accommodate nite as well as in nite domains provided some satis ability procedures are provided. Recently Howe and King [HK99] use the results of analysis based on convex ....

Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In PEPM, SIGPLAN Notices Vol. 26 No. 9, pages 62-71. ACM Press, 1991.

....by specialization with respect to the pattern. Indeed, this KMP test has become a popular benchmark for partial evaluators and related systems [21] The systems that pass the KMP test have the ability to infer information about the unknown input based on the form of enclosing conditional tests [6, 20, 21]. Such capability, however, goes beyond standard partial evaluation. Another approach is to rewrite a naive string matcher to make it more amenable to standard partial evaluation by augmenting the implementation with static data recording the results of tests on the dynamic data: A standard ....

....[8, 9] maintains more information during the transformation process than does partial evaluation. More precisely, positive information is maintained; positive supercompilation of a naive string matcher and a pattern results in a linear matcher that may perform redundant tests. In contrast, Smith [20] observes that a partial evaluator for a family of constraint logic programming languages succeeds in generating linear matchers that do not perform redundant tests, because negative information is also maintained. The same is true for Generalized Partial Computation [6] where a theorem prover is ....

Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Hudak and Jones [11], pages 62--71.

....for the program Match Pos is match pos( append ( length( g. We leave it to the reader to verify that Match Pos satis es M . 29 The derivation we will perform using the Determinization Strategy is more challenging than the ones presented in the literature (see, for instance, [12, 35]) because an occurrence of the pattern in the string is speci ed in the initial program via the append predicate which denotes list concatenation. We want to specialize the Match Pos program w.r.t. the atom match pos( a; a; b] S; N ) Thus, we introduce the de nition clause: 6. sp match pos(S; ....

....automaton with counters which is deterministic, except for the states corresponding to the predicates new4 and new5 where all strings are accepted. A similar derivation cannot be performed by usual partial evaluation techniques without a prior transformation into failure continuation passing style [35]. 34 6.3 From Regular Expressions to Finite Automata In this example we show the derivation of a deterministic nite automaton by specializing a general parser for regular expressions w.r.t. a given regular expression. The initial program Reg Expr for testing whether or not a string belongs to ....

[Article contains additional citation context not shown here]

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Proceedings ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pages 62-71. ACM Press, 1991.

....computation [FN88] and supercompilation [Leu95] In fact, any technique that allows the propagation of the negative binding information will pass the KMP test. For generalised partial computation and supercompilation, this information is represented explicitly. In addition, partial deduction [Smi91] partial evaluation of narrowing based functional logic programs [AFJV97] and partial evaluation based on Mix pass the KMP test [CD89] For example, specialising the tail recursive pattern matching program using the SP partial deduction system [Gal91] the residual program generated given the ....

D. A. Smith. Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. In Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press, 1991.

....The program in the above example is actually almost a CLP program, and we could go one step further and also specialise CLP programs. As Algorithm 5. 16 is based on the structure FT we conjecture that an adaptation of our technique might yield a refined specialisation technique for CLP(FT ) [60, 61, 62]. Also, it is actually not very difficult to adapt the framework of Section 4.2 to work on CLP programs instead of ordinary logic programs we just have to require that equality is handled in the same manner as in logic programming. However, establishing the correctness will become much more ....

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In N. D. Jones and P. Hudak, editors, ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press Sigplan Notices 26(9), 1991.

....of generalisation and will therefore terminate only for a small class of programs. When one abandons simple functional languages (as treated in the present paper) and considers logic programming and constraint logic programming, several accounts exist of equivalent transformation power, e.g. [16, 8, 10, 11]. In these frameworks, search and or constraint solving facilities of the logic language provides the necessary machinery to avoid redundant computations. In this field, great efforts have been made to produce optimal specialisation, and at the same time to ensure termination, see e.g. 12, 13] ....

D. Smith. Partial evaluation of pattern matching in constraint logic programming. In PEPM'91 [1], pages 62--71.

.... algorithm, as shown in [18] This is a classical problem in program transformation; for references see [19] Neither partial evaluation nor deforestation can achieve this transformation, as explained in [19] Partial deduction achieves the same effect in the logic programming context [4, 17] as driving in the functional setting [5] This is not surprising given the close relation of driving and partial deduction [8] Here is one branch of the finite partial process tree: 1) case 2 (A; A; B] ss; A; A; B] ss) 2) if 3 (A; A; B] s 1 ; ss 1 ; A; A; B] s 1 : ss 1 ) 3) ....

D.A. Smith. Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. PEPM'91. 62-71, ACM Press 1991.

....Fig. 14. Information propagation. the outcome of tests. In constraint based propagation the transformer explicitly maintains sets of constraints recording previous tests (restrictions [84, 34] Depending on the programming language other abstract properties may be propagated, e.g. [72, 15, 77, 43]. Evaluation strategy. One can view a program transformer as an extension of an interpreter, e.g. 34, 31, 61, 74] This implies that the transformer has an evaluation strategy that it inherits from the underlying interpreter. More concretely, the transformer processes nested function calls in ....

D. Smith. Partial evaluation of pattern matching in constraint logic programming. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 62--71. ACM Press, 1991.

....are applied to the goals in the next step of transformation, much like in clauses (5) and (8) of positive driving. This explains why, unlike the situation in the functional case, partial deducers for Prolog can derive KMP matchers from a general Prolog matcher similar to our general matcher (Smith, 1991). 8 More Applications of Positive Supercompilation We consider more applications of positive supercompilation: specialization (Subsection 8.1) composition, Subsection 8.2) and other effects (Subsection 8.3) 8.1 Specialization Positive supercompilation can perform program specialization. For ....

Smith, D.A. 1991. Partial evaluation of pattern matching in constraint logic programming languages. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71, ACM Press.

....study. There are also connections between supercompilation and transformation, in particular partial evaluation, of logic programs. Unlike the situation in the functional case, partial evaluators for Prolog can derive KMP matchers from general Prolog matchers similar to our tail recursive matcher [Smi91]. This is because partial evaluators for Prolog propagate information (by unification) in a way similar to that in supercompilation. Possible gains from a detailed correspondence may, again, be significant. ....

D. A. Smith. Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. In ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation. Ed. N. D. Jones & P. Hudak, pp.62-71, ACM Press 1991.

....in greater specialisation than was possible without the constraints. We will extend the constraint solver for other kinds of constraints, in order to increase the specialisation even further. This has been shown to be possible in the partial evaluation of constraint logic programming languages [Smi91], in which the constraint domains were extended from one with equality and disequality, to CLP(Bool) and CLP(Finite Domain) Because of this increased information passing, they were able to generate KMP pattern matchers for finite trees and Boolean relations. This extension should yield similar ....

D. A. Smith. Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. In Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press, 1991. This article was processed using the L A T E X macro package with LLNCS style

....strategy for the specialization of a multi pattern matching program and we derive a very efficient semi deterministic program. A similar specialization could not be performed by usual partial evaluation techniques without a prior transformation into failure continuation passing style form [17]. We are given the initial program: 1. mmatch( P jPs] S; N ) match(P; S; N ) 2. mmatch( P jPs] S; N ) mmatch(Ps ; S; N ) 3. match(P; S; N ) app(Y; R; S) app(L; P; Y ) len(L; N ) 4. len( 0) 5. len( HjT ] s(N ) len(T; N ) 6. app( L; L) 7. app( AjL1] L2; AjL3] ....

D.A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. Proc. PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pp. 62--71. ACM Press, 1991.

....must be expanded in some cases. Furthermore, SP s results are obtained without departing from the SLDNF framework. The well known example of the Knuth Morris Pratt string matching transformation is handled, for instance, although other researchers have used constraints to process this example [30], 6] SP makes no attempt to handle cuts, side effects and other non declarative aspects of Prolog, as is done by Mixtus [25] SP is not yet self applicable, since the SP system is not written declaratively. This remains an important goal; an effort will shortly be made to rewrite SP in a ....

Smith, D.A.; Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages; in PEPM'91, Proc. of the ACM Symposium on Partial Evaluation and Semantics-Based Program Transformation; SIGPLAN Notices Vol. 26, No. 9, September 1991.

....a case split rule based on type information, in the sense that they assume that the arguments of the predicate match are lists. We do not use any type information at all. Moreover, the derivation in [21] is not guided by an automatic strategy. Very simple initial programs are considered also in [23], but in that paper the derivation requires a preliminary transformation into the so called failure continuation passing style . Similarly to the KMP example, also the published derivations by partial deduction of specialized parsers from general parsers, use rather clever deterministic initial ....

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Proceedings ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pages 62--71. ACM Press, 1991.

....almost a CLP program, and we could go one step further and also specialise CLP programs. As the concrete algorithm of [22] briefly described in Section 2. 1, is based on the structure FT we conjecture that an adaptation of our technique might yield a refined specialisation technique for CLP(FT ) [30, 31, 32]. Also, it is actually not very difficult to adapt the framework of Section 3.2 to work on CLP programs instead of ordinary logic programs we just have to require that equality is handled in the same manner as in logic programming. However, establishing the correctness will become much more ....

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In N. D. Jones and P. Hudak, editors, ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press Sigplan Notices 26(9), 1991.

....specify an infinite set of substitutions. Another similar kind of constraints has been used in [11] to define a generalisation operator for machine learning which respects a set of counter examples. Our constraint programming language also resembles the CLP(FT ) language with dif constraints in [17, 18]. An adaptation of our technique might yield a useful abstraction operator for CLP(FT ) In conclusion, we have presented an almost perfect abstraction operator for partial deduction. The operator ensures termination and correctness (through the closedness and independence conditions of [12] of ....

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In N. D. Jones and P. Hudak, editors, ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press Sigplan Notices 26(9), 1991.

No context found.

D. A. Smith. Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. In Partial Evaluation and Semantics-Based Program Manipulation, pages 62--71. ACM Press, 1991.

No context found.

D. A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In N. D. Jones and P. Hudak, editors, ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 62-71. ACM Press Sigplan Notices 26(9), 1991.

First 50 documents

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