Conference proceedings
© 1987

Rewriting Techniques and Applications

Bordeaux, France, May 25-27, 1987. Proceedings

Editors:

Pierre Lescanne

Pierre Lescanne

View editor publications

You can also search for this editor in PubMed Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 256)

8698 Accesses
187 Citations

Sections

Table of contents
About this book
Keywords
Bibliographic Information
Publish with us

Buy it now

Softcover Book USD 49.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Learn about institutional subscriptions

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (23 papers)

Front Matter

PDF
Term-rewriting implementation of equational logic programming
- Michael J. O'Donnell
Pages 1-12
Optimizing equational programs
- Robert Strandh
Pages 13-24
A compiler for conditional term rewriting systems
- Stéphane Kaplan
Pages 25-41
How to choose the weights in the Knuth Bendix ordering
- Ursula Martin
Pages 42-53
Detecting looping simplifications
- Paul Walton Purdom Jr.
Pages 54-61
Combinatorial hypermap rewriting
- Eric Sopena
Pages 62-73
The word problem for finitely presented monoids and finite canonical rewriting systems
- Craig Squier, Friedrich Otto
Pages 74-82
Term rewriting systems with priorities
- J. C. M. Baeten, J. A. Bergstra, J. W. Klop
Pages 83-94
A gap between linear and non linear term-rewriting systems
- M. Dauchet, DE Comite
Pages 95-104
Code generator generation based on template-driven target term rewriting
- Annie Despland, Monique Mazaud, Raymond Rakotozafy
Pages 105-120
Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction
- M. Benois
Pages 121-132
Groups presented by certain classes of finite length-reducing string-rewriting systems
- Klaus Madlener, Friedrich Otto
Pages 133-144
Some results about confluence on a given congruence class
- Friedrich Otto
Pages 145-155
Ground confluence
- Richard Göbel
Pages 156-167
Structured contextual rewriting
- Qian Zhenyu
Pages 168-179
Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes
- Hélène Kirchner
Pages 180-191
Completion for rewriting modulo a congruence
- Leo Bachmair, Nachum Dershowitz
Pages 192-203
On equational theories, unification and decidability
- Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß
Pages 204-215
A general complete E-unification procedure
- Jean H. Gallier, Wayne Snyder
Pages 216-227

About this book

This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.

Keywords

Bibliographic Information

Book Title: Rewriting Techniques and Applications
Book Subtitle: Bordeaux, France, May 25-27, 1987. Proceedings
Editors: Pierre Lescanne
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-17220-3
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1987
Softcover ISBN: 978-3-540-17220-8Published: 14 May 1987
eBook ISBN: 978-3-540-47421-0Published: 29 June 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 288
Topics: Mathematical Logic and Formal Languages, Logics and Meanings of Programs, Mathematical Logic and Foundations

Publish with us

Policies and ethics

Access via your institution

Buy it now

Softcover Book USD 49.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Learn about institutional subscriptions