SCOPUS 정보 검색 플랫폼

Theoretical Computer Science

Volumn 136, Issue 2, 1994, Pages 333-360

On the modularity of termination of term rewriting systems

(1) Ohlebusch, Enno a

a BIELEFELD UNIVERSITY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; COMPUTER SCIENCE; SET THEORY;

COMBINED PROGRAM; CONSTRUCTOR SHARING SYSTEMS; DISJOINT UNION; FINITELY BRANCHING; MODULARITY OF TERMINATION; SYMBOLIC MANIPULATION; TERM REWRITING SYSTEMS; UNIFORM FRAMEWORK;

PROGRAMMING THEORY;

EID: 0028749648 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(94)00039-L Document Type: Article

Times cited : (31)

References (29)

1
- 0000386539
- A note on simplification orderings
- (1979) Inform. Process. Lett. , vol.9 , Issue.5 , pp. 212-215
- Dershowitz¹

2
- 84912992303
- N. Dershowitz, Hierarchical termination, in: Proc. 4th Internat. Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science, to appear.

3
- 0000029077
- Rewrite systems
- L. van Leeuwen, Elsevier, Amsterdam, Ch. 6
- (1990) Handbook of Theoretical Computer Science , vol.B , pp. 245-320
- Dershowitz¹ Jouannaud²

4
- 0018504528
- Proving termination with multiset orderings
- (1979) Comm. ACM , vol.22 , pp. 465-476
- Dershowitz¹ Manna²

5
- 0013177327
- Termersetzungssysteme
- Springer, Berlin
- (1989) Informatik-Fachberichte , vol.210
- Drosten¹

6
- 0010201664
- 0? A survey of some results in proof theory
- (1991) Ann. Pure Appl. Logic , vol.53 , pp. 199-260
- Gallier¹

7
- 0000619678
- Generalized sufficient conditions for modular termination of rewriting
- (1994) Appl. Algebra Engng Comm. Comput. , vol.5 , pp. 131-158
- Gramlich¹

8
- 84916527062
- Relating innermost, weak, uniform and modular termination of term rewriting systems
- Universität Kaiserslautern
- (1993) SEKI Report
- Gramlich¹

9
- 0346375587
- Sufficient conditions for modular termination of conditional term rewriting systems
- Springer, Berlin, Lecture Notes in Computer Science
- (1993) Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems 1992 , vol.656 , pp. 128-142
- Gramlich¹

10
- 0001834942
- Term rewriting systems
- S. Abramsky, D. Gabbay, T. Maibaum, Oxford University Press, Oxford
- (1992) Handbook of Logic in Computer Science , vol.2 , pp. 1-116
- Klop¹

11
- 0011698687
- Completeness of hierarchical combinations of term rewriting systems
- Springer, Berlin, Lecture Notes in Computer Science
- (1993) Proc. 13th Conf. on the Foundations of Software Technology and Theoretical Computer Science , vol.761 , pp. 125-139
- Rao¹

12
- 4243928889
- Simple termination of hierarchical combinations of term rewriting systems
- Springer, Berlin, Lecture Notes in Computer Science
- (1994) Proc. Internat. Symp. on Theoretical Aspects of Computer Software , vol.789 , pp. 203-223
- Rao¹

13
- 0002548707
- Modularity of simple termination of term rewriting systems
- (1990) J. IPS Japan , vol.31 , pp. 633-642
- Kurihara¹ Ohuchi²

14
- 0026913059
- Modularity of simple termination of term rewriting systems with shared constructors
- (1992) Theoret. Comput. Sci. , vol.103 , pp. 273-282
- Kurihara¹ Ohuchi²

15
- 0024873046
- A sufficient condition for the termination of the direct sum of term rewriting systems
- (1989) Proc. 4th IEEE Symp. on Logic in Computer Science , pp. 396-401
- Middeldorp¹

16
- 0003447476
- Modular properties of term rewriting systems
- Vrije Universiteit te Amsterdam
- (1990) Ph.D. Thesis
- Middeldorp¹

17
- 38249003752
- Modular properties of conditional term rewriting systems
- (1993) Inform. Comput. , vol.104 , Issue.1 , pp. 110-158
- Middeldorp¹

18
- 84913006194
- Simple termination is difficult
- Springer, Berlin, Lecture Notes in Computer Science
- (1993) Proc. 5th Internat. Conf. on Rewriting Techniques and Applications , vol.690 , pp. 228-242
- Middeldorp¹ Gramlich²

19
- 0001643927
- Completeness of combinations of constructor systems
- (1993) J. Symbolic Comput. , vol.15 , Issue.3 , pp. 331-348
- Middeldorp¹ Toyama²

20
- 0002417031
- A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems
- (1993) Bull. European Assoc. Theoret. Comput. Sci. , vol.49 , pp. 178-183
- Ohlebusch¹

21
- 84868534363
- Combinations of simplifying conditional term rewriting systems
- Springer, Berlin, Lecture Notes in Computer Science
- (1993) Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems 1992 , vol.656 , pp. 113-127
- Ohlebusch¹

22
- 0029244726
- Termination is not modular for confluent variable-preserving term rewriting systems
- to appear
- (1995) Inform. Process. Lett. , vol.53
- Ohlebusch¹

23
- 85011004809
- On the modularity of confluence of constructor-sharing term rewriting systems
- Springer, Berlin, Lecture Notes in Computer Science
- (1994) Proc. 19th Colloq. on Trees in Algebra and Programming , vol.787 , pp. 261-275
- Ohlebusch¹

24
- 0023435204
- On termination of the direct sum of term rewriting systems
- (1987) Inform. Process. Lett. , vol.26 , pp. 65-70
- Rusinowitch¹

25
- 84889605546
- Extensions and comparison of simplification orderings
- Springer, Berlin, Lecture Notes in Computer Science
- (1989) Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications , vol.355 , pp. 434-448
- Steinbach¹

26
- 0023345304
- Counterexamples to termination for the direct sum of term rewriting systems
- (1987) Inform. Process. Lett. , vol.25 , pp. 141-143
- Toyama¹

27
- 0023252439
- On the Church—Rosser property for the direct sum of term rewriting systems
- (1987) J. ACM , vol.34 , Issue.1 , pp. 128-143
- Toyama¹

28
- 85027665834
- Termination for the direct sum of left-linear term rewriting systems
- Springer, Berlin, Lecture Notes in Computer Science
- (1989) Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications , vol.355 , pp. 477-491
- Toyama¹ Klop² Barendregt³

29
- 84974774120
- Termination of term rewriting by interpretation
- Springer, Berlin, Lecture Notes in Computer Science
- (1993) Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems 1992 , vol.656 , pp. 155-167
- Zantema¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.