Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Rewriting Techniques and Applications: 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings > TRAM: An abstract machine for order-sorted conditional term rewriting systems
Rewriting Techniques and Applications: 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings |
Hubert Comon
Springer Berlin Heidelberg
Rewriting Techniques and Applications: 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings
TRAM: An abstract machine for order-sorted conditional term rewriting systems
Authors

Kazuhiro Ogata; Koichi Ohhara; Kokichi Futatsugi

ARI Id

1664815147394_3630265

Access

Not Available Free

Pages

335-338

DOI

10.1007/3-540-62950-5_84

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-62950-5_84

Table of Contents of Book
Showing 1 to 20 of 30 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Well-behaved search and the Robbins problem
William McCune
1-7
Goal-Directed Completion using SOUR Graphs
Christopher Lynch
8-22
Shostak's congruence closure as completion
Deepak Kapur
23-37
Conditional equational specifications of data types with partial operations for inductive theorem proving
Ulrich Kühler; Claus-Peter Wirth
38-52
Cross-sections for finitely presented monoids with decidable word problems
Friedrich Otto; Masashi Katsura; Yuji Kobayashi
53-67
New undecidability results for finitely presented monoids
Andrea Sattler-Klein
68-82
On the property of preserving regularity for string-rewriting systems
Friedrich Otto
83-97
Rewrite systems for natural, integral, and rational arithmetic
Evelyne Contejean; Claude Marché; Landy Rabehasaina
98-112
D-bases for polynomial ideals over commutative noetherian rings
Leo Bachmair; Ashish Tiwari
113-127
On the word problem for free lattices
Georg Struth
128-141
A total, ground path ordering for proving termination of AC-rewrite systems
Deepak Kapur; G. Sivakumar
142-156
Proving innermost normalisation automatically
Thomas Arts; Jürgen Giesl
157-171
Termination of context-sensitive rewriting
H. Zantema
172-186
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
Michio Oyamaguchi; Yoshikatsu Ohta
187-201
Innocuous constructor-sharing combinations
Nachum Dershowitz
202-216
Scott's conjecture is true, position sensitive weights
Samuel M. H. W. Perlo-Freeman; Péter Prőhle
217-227
Two-dimensional rewriting
Yves Lafont
228-229
A complete axiomatisation for the inclusion of series-parallel partial orders
Denis Bechet; Philippe de Groote; Christian Retoré
230-240
Undecidability of the first order theory of one-step right ground rewriting
Jerzy Marcinkowski
241-253
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 30 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings