Christian Prehofer. On modularity in term rewriting and narrowing. In J.-P. Jouannaud, editor, Proceedings of the First International Conference on Constraints in Computational Logics,volume 845 of Lecture Notes in Computer Science, pages 253#268, Berlin, 1994. Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Final CCL report - Jouannaud (Correct)
....is still ongoing. Besides these collaborations there were a number of short visits and seminars. e.g. H. Comon in Aachen and at INRIA, J.P. Jouannaud at INRIA) 12 TUM 12.1 Research progresses on the working group topics Symbolic constraints and combination problems In the paper by C. Prehofer [85], new modularity results for solving symbolic constraints modulo an equational theory were developed. A novel modular property of equational proofs, called modularity of normalization, is examined for the union of term rewrite systems with shared symbols. An interesting application is solving ....
Christian Prehofer. On modularity in term rewriting and narrowing. In J.-P. Jouannaud, editor, Constraints in Computational Logics, volume 845 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
Modular Properties of Composable Term Rewriting Systems - Ohlebusch (1995) (40 citations) (Correct)
....that in consequence of this subtle difference the proof of Raoult and Vuillemin (1980) does not extend to composable systems. Thus it is still open whether confluence is a modular property of left linear composable TRSs. A somewhat different approach to modularity of TRSs has been presented in Prehofer (1994). This paper deals with a property called modular normalization , meaning that every R = R 1 [ R 2 normal form of some term s can be obtained by first reducing s to an R 1 normal form s# R1 and then reducing s# R1 to an R 2 normal form. Prehofer developed sufficient criteria for this ....
Prehofer, C. (1994). On modularity in term rewriting and narrowing. In Proceedings of the 1st International Conference on Constraints in Computational Logics, 253--268, Lecture Notes in Computer Science 845, Berlin: Springer Verlag.
Innocuous Constructor-Sharing Combinations - Dershowitz (1997) (4 citations) (Correct)
....we give can be refined to demand only exactly what is required by the proof. It would also be nice to have counterexamples for the necessity of each condition. Finally, we should mention that critical pair conditions for the pentagon property could be formulated, along the lines of the work in [12, 3, 23]. Appendix This section contains diagrammatic proofs of several key lemmas. We use dashed arrows for steps in R and solid for S. Proof of Lemma 7. The proof of the pentagon property P (R; S ; S ) is by induction with respect to the terminating relation S: S S S S S S S S R R R ....
Christian Prehofer. On modularity in term rewriting and narrowing. In J.-P. Jouannaud, editor, Proceedings of the First International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 253--268, Berlin, 1994. Springer-Verlag.
Innocuous Constructor-Sharing Combinations - Dershowitz (1997) (4 citations) (Correct)
No context found.
Christian Prehofer. On modularity in term rewriting and narrowing. In J.-P. Jouannaud, editor, Proceedings of the First International Conference on Constraints in Computational Logics,volume 845 of Lecture Notes in Computer Science, pages 253#268, Berlin, 1994. Springer-Verlag.
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