Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Rewriting Techniques and Applications: 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991. Proceedings > Decidability of confluence and termination of monadic term rewriting systems
Rewriting Techniques and Applications: 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991. Proceedings |
Ronald V. Book
Springer Berlin Heidelberg
Rewriting Techniques and Applications: 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991. Proceedings
Decidability of confluence and termination of monadic term rewriting systems
Authors

Kai Salomaa

ARI Id

1664943054524_4168784

Access

Not Available Free

Pages

275-286

DOI

10.1007/3-540-53904-2_103

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-53904-2_103

Table of Contents of Book
Showing 1 to 20 of 42 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Transfinite reductions in orthogonal term rewriting systems
J. R. Kennaway; J. W. Klop; M. R. Sleep; F. J. de Vries
1-12
Redex capturing in term graph rewriting (concise version)
William M. Farmer; Ronald J. Watro
13-24
Rewriting, and equational unification: the higher-order cases
D. A. Wolfram
25-36
Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
Daniel J. Dougherty
37-48
Incremental termination proofs and the length of derivations
Frank Drewes; Clemens Lautemann
49-61
Time bounded rewrite systems and termination proofs by generalized embedding
Dieter Hofbauer
62-73
Detecting redundant narrowing derivations by the LSE-SL reducibility test
Stefan Krischer; Alexander Bockmayr
74-85
Unification, weak unification, upper bound, lower bound, and generalization problems
Franz Baader
86-97
AC unification through order-sorted AC1 unification
Eric Domenjoud
98-111
Narrowing directed by a graph of terms
Jacques Chabin; Pierre Réty
112-123
Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification
Franz Baader; Werner Nutt
124-135
Undecidable properties of syntactic theories
Francis Klay
136-149
Goal directed strategies for paramodulation
Wayne Snyder; Christopher Lynch
150-161
Minimal solutions of linear diophantine systems: bounds and algorithms
Loïc Pottier
162-173
Proofs in parameterized specifications
Hélène Kirchner
174-187
Completeness of combinations of constructor systems
Aart Middeldorp; Yoshihito Toyama
188-199
Modular higher-order E-unification
Tobias Nipkow; Zhenyu Qian
200-214
On confluence for weakly normalizing systems
Pierre-Louis Curien; Giorgio Ghelli
215-225
Program transformation and rewriting
Françoise Bellegarde
226-239
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 42 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings