Christian Prehofer  Home/Search
Context Related
| www4.in.tum.de/pub...hofer_1ICo1994.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: www4.in.tum.de/publ/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Weintroduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normalization with R = R1 + R2 may be obtained by first normalizing with R1 followed byanR2 normalization. (Update)
Context of citations to this paper: More
.... 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....
...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...
Cited by: More
Innocuous Constructor-Sharing Combinations - Dershowitz (1997) (Correct)
Final CCL report - Jouannaud (Correct)
Modular Properties of Composable Term Rewriting Systems - Ohlebusch (1995) (Correct)
Active bibliography (related documents): More All
2.0: On Modularity in Term Rewriting and Narrowing - Prehofer (1994) (Correct)
0.2: Semantic Unification for Convergent Systems - Mitra (1994) (Correct)
0.2: The Integration of Functions into Logic Programming: A Survey - Hanus (1994) (Correct)
Similar documents based on text: More All
0.2: Higher-Order Narrowing with Convergent - Systems Christian Prehofer (1995) (Correct)
0.2: Higher-Order Narrowing with Convergent Systems - Prehofer (1995) (Correct)
0.1: An Efficient Constraint Language for Polymorphic Order-sorted.. - Prehofer (1992) (Correct)
Related documents from co-citation: More All
3: Modularity of Simple Termination of Term Rewriting Systems (context) - Kurihara, Ohuchi - 1990
3: Rewrite systems - Dershowitz, Jouannaud - 1990
3: Completeness of Combinations of Constructor Systems - Middeldorp, Toyama - 1993
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/prehofer94modularity.html More
@inproceedings{ prehofer94modularity,
author = "Christian Prehofer",
title = "On Modularity in Term Rewriting and Narrowing",
booktitle = "Proceedings of the First International Conference on Constraints in Computational Logics, Munich (Germany)",
volume = "845",
publisher = "Springer-Verlag",
editor = "J.-P.~Jouannaud",
year = "1994",
url = "citeseer.ist.psu.edu/prehofer94modularity.html" }
Citations (may not include all citations):171 A needed narrowing strategy - Antoy, Echahed et al. - 1994
126 Canonical forms and unification (context) - Hullot - 1980
87 Narrowing as the operational semantics of functional languag.. (context) - Reddy - 1985
79 the Church-Rosser property for the direct sum of term rewrit.. (context) - Toyama - 1987
63 Modular Properties of Term Rewriting Systems (context) - Middeldorp - 1991
50 Generalized sufficient conditions for modular termination of.. - Gramlich - 1992
48 Basic narrowing revisited (context) - Nutt, R'ety - 1990
34 and termination (context) - Bachmair, Dershowitz et al. - 1986
29 Theoretical Computer Science (context) - Bosco, Giovanetti et al. - 1988
22 Modular aspects of properties of term rewriting systems rela.. (context) - Middeldorp - 1989
19 Relative Termination (context) - Geser - 1990
17 Lazy unification with simplification - Hanus - 1994
14 The integration of functions into logic programming: A surve.. - Hanus - 1994
14 Operational and semantic equivalences between recursive prog.. (context) - Raoult, Vuillemin - 1980
14 Some termination criteria for narrowing and E-narrowing (context) - Christian - 1990
13 Completeness of hierarchical combinations of term rewriting .. (context) - Rao - 1993
13 An optimal narrowing strategy for general canonical systems (context) - Bockmayr, Krischer et al. - 1992
13 Decidable matching for convergent systems - Dershowitz, Mitra et al.
4 The union of rewrite systems (context) - Stroetmann - 1992
2 Narrowing with inductively defined functions (context) - Bockmayr - 1986
2 Operationelle Semantik axiomatisch spezifizierter Abstrakter.. (context) - Nipkow, Weikum - 1982
1 th International ConferenceonAutomatedDeduction (context) - Kapur - 1992
Documents on the same site (http://www4.in.tum.de/publ/papers/): More
The Amsterdam Manifesto on OCL - Cook, Kleppe, Mitchell, Rumpe.. (1999) (Correct)
Structured Specifications and Implementation of.. - Walicki, Broy (1995) (Correct)
Modeling Dynamic Component Interfaces - Huber, Rausch, Rumpe (1998) (Correct)
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