| Delia Kesner. Free sequentiality in orthogonal order-sorted rewriting systems with constructors. In Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNAI 607, 1992. |
....reduction in the form of a matching dag which generalizes to trees the famous construction by Knuth, Morris and Pratt of an automaton for efficiently matching strings. Although Huet and Levy s framework was extended to several kinds of rewritings (priority rewriting [8] order sorted rewriting [5], head constructors systems [4] sufficient sequentiality [7] orthogonality could not be really removed until Toyama introduced left linear root balanced systems [9] The root balanced property together with left linearity ensure the Church Rosser property, hence it replaces the nonambiguity ....
Delia Kesner. Free sequentiality in orthogonal order-sorted rewriting systems with constructors. In Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNAI 607, 1992.
....11] simpler proofs of decidability of strong sequentiality are given. In Thatte [18] the notion of left sequentiality is introduced. In Oyamaguchi [15] a class of sufficiently sequential OTRSs, which properly contains the class of strongly sequential OTRSs, is shown to be decidable. In Kesner [7] sequentiality is studied in OTRSs with order sorted alphabets. Toyama [19] generalized some results from [4] to left linear overlapping TRSs. The essential strategy, as defined in this paper, is based on a notion of descendant, which allows the tracing of all subterms, including contracted ....
Kesner D. Free sequentiality in orthogonal order-sorted rewriting systems with constructors, in Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNAI 607, 1992.
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