Amazon cover image
Image from Amazon.com

Rewriting techniques and applications : Bordeaux, France, May 25-27, 1987, proceedings / edited by Pierre Lescanne.

Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 256.Publication details: Berlin ; New York : Springer-Verlag, ©1987.Description: 1 online resource (vi, 285 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540474210
  • 3540474218
Subject(s): Genre/Form: Additional physical formats: Print version:: Rewriting techniques and applications.DDC classification:
  • 511.3 19
LOC classification:
  • QA267 .R48 1987
Other classification:
  • 54.70
  • 54.50
  • 54.60
Online resources:
Contents:
Invited Lecture: M.J. O'Donnell: Term-Rewriting Implementation of Equational Logic Programming -- Implementation: R. Strandh: Optimizing Equational Programs -- S. Kaplan: A Compiler for Conditional Term Rewriting Systems -- Termination: U. Martin: How to choose the weights in the Knuth Bendix ordering. P. Purdom: Detecting Looping Simplifications -- Theoretical Aspects 1: E. Sopena: Combinatorial Hypermap Rewriting. F. Otto, C. Squier: The Word Problem for finitely presented Monoids and Finite Canonical Rewriting Systems -- Families of Rewriting Systems: J.C.M. Baeten, J.A. Bergstra, J.W. Klop: Term Rewriting Systems with Priorities. M. Dauchet, F. De Comite: A gap between Linear and Non-Linear Term-Rewriting Systems -- Code Generation: M. Mazaud, R. Rakotozafy, A. Szumachowski-Despland: Code Generator Generation based on template-driven target term rewriting -- Theoretical Aspects 2: M. Benois: Descendants of Regular Language in a class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. K. Madlener, F. Otto: Groups presented by certain Classes of Finite Length-Reducing string Rewriting Systems. F. Otto: Some Results about Confluence on a given Congruence Class -- Confluence: R. Gbel: Ground Confluence -- Qian Zhenyu: Structured Contextual Rewriting -- Completion: H. Kirchner: Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes -- L. Bachmair, N. Dershowitz: Completion for rewriting modulo a congruence -- Unification: H.J. Brckert, A. Herold, M. Schmidt-Schau: On Equational Theories, Unification and Decidability -- J.H. Gallier, W. Snyder: A General complete E-unification procedure -- Unification by Narrowing: P. Rty: Improving basic narrowing techniques. P. Padawitz: Strategy-Controlled Reduction and Narrowing -- Efficiency of Rewriting: C. Choppy, S. Kaplan, M. Soria: Algorithmic complexity of term rewriting systems. R. Ramesh, I.V. Ramakrishnan: Optimal Speedups for parallel pattern matching in trees.
Action note:
  • digitized 2011 HathiTrust Digital Library committed to preserve
Summary: This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL

Invited Lecture: M.J. O'Donnell: Term-Rewriting Implementation of Equational Logic Programming -- Implementation: R. Strandh: Optimizing Equational Programs -- S. Kaplan: A Compiler for Conditional Term Rewriting Systems -- Termination: U. Martin: How to choose the weights in the Knuth Bendix ordering. P. Purdom: Detecting Looping Simplifications -- Theoretical Aspects 1: E. Sopena: Combinatorial Hypermap Rewriting. F. Otto, C. Squier: The Word Problem for finitely presented Monoids and Finite Canonical Rewriting Systems -- Families of Rewriting Systems: J.C.M. Baeten, J.A. Bergstra, J.W. Klop: Term Rewriting Systems with Priorities. M. Dauchet, F. De Comite: A gap between Linear and Non-Linear Term-Rewriting Systems -- Code Generation: M. Mazaud, R. Rakotozafy, A. Szumachowski-Despland: Code Generator Generation based on template-driven target term rewriting -- Theoretical Aspects 2: M. Benois: Descendants of Regular Language in a class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. K. Madlener, F. Otto: Groups presented by certain Classes of Finite Length-Reducing string Rewriting Systems. F. Otto: Some Results about Confluence on a given Congruence Class -- Confluence: R. Gbel: Ground Confluence -- Qian Zhenyu: Structured Contextual Rewriting -- Completion: H. Kirchner: Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes -- L. Bachmair, N. Dershowitz: Completion for rewriting modulo a congruence -- Unification: H.J. Brckert, A. Herold, M. Schmidt-Schau: On Equational Theories, Unification and Decidability -- J.H. Gallier, W. Snyder: A General complete E-unification procedure -- Unification by Narrowing: P. Rty: Improving basic narrowing techniques. P. Padawitz: Strategy-Controlled Reduction and Narrowing -- Efficiency of Rewriting: C. Choppy, S. Kaplan, M. Soria: Algorithmic complexity of term rewriting systems. R. Ramesh, I.V. Ramakrishnan: Optimal Speedups for parallel pattern matching in trees.

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

Print version record.

Powered by Koha