Research Catalog

Rewriting techniques and applications : 10th international conference, RTA-99, Trento, Italy, July 1999, proceedings

Title
Rewriting techniques and applications : 10th international conference, RTA-99, Trento, Italy, July 1999, proceedings / Paliath Narendran, Michael Rusinowitch (eds.).
Publication
New York : Springer, 1999.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextRequest in advance QA267 .R477 1999Off-site

Holdings

Details

Additional Authors
  • Narendran, Paliath, 1955-
  • Rusinowitch, M. (Michael)
  • International Conference on Rewriting Techniques and Applications (10th : 1999 : Trento, Italy)
Description
xi, 396 pages : illustrations; 24 cm.
Series Statement
Lecture notes in computer science ; 1631
Uniform Title
Lecture notes in computer science ; 1631.
Subject
  • Rewriting systems (Computer science) > Congresses
  • Computer programming > Congresses
  • Algorithms > Congresses
Bibliography (note)
  • Includes bibliographical references and index.
Contents
Solved Forms for Path Ordering Constraints / R. Nieuwenhuis and J. M. Rivero -- Jeopardy / N. Dershowitz and S. Mitra -- Strategic Pattern Matching / E. Visser -- On the Strong Normalization of Natural Deduction with Permutation Conversions / Ph. de Groote -- Normalization in Weakly Orthogonal Rewriting / V. van Oostrom -- Strong Normalization of Proof Nets Modulo Structural Congruences / R. Di Cosmo and S. Guerrini -- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas / B. Courcelle -- Undecidability of the [actual symbol not reproducible] Part of the Theory of Ground Term Algebra Modulo an AC Symbol / J. Marcinkowski -- Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting / A.-C. Caron, F. Seynhaeve and S. Tison / [et al.] -- A New Result about the Decidability of the Existential One-Step Rewriting Theory / S. Limet and P. Rety -- A Fully Syntactic AC-RPO / A. Rubio -- Theory Path Orderings / J. Stuber -- A Characterisation of Multiply Recursive Functions with Higman's Lemma / H. Touzet -- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors / F. Baader and C. Tinelli -- Normalization via Rewrite Closures / L. Bachmair, C. R. Ramakrishnan and I. V. Ramakrishnan / [et al.] -- Test Sets for the Universal and Existential Closure of Regular Tree Languages / D. Hofbauer and M. Huber -- Higher-Order Rewriting / F. van Raamsdonk -- The Maude System / M. Clavel, F. Duran and S. Eker / [et al.] -- TOY: A Multiparadigm Declarative System / F. J. Lopez-Fraguas and J. Sanchez-Hernandez -- UniMoK: A System for Combining Equational Unification Algorithms / S. Kepser and J. Richts -- LR[superscript 2]: A Laboratory for Rapid Term Graph Rewriting / R. Verma and S. Senanayake -- Decidability for Left-Linear Growing Term Rewriting Systems / T. Nagaya and Y. Toyama -- Transforming Context-Sensitive Rewrite Systems / J. Giesl and A. Middeldorp -- Context-Sensitive AC-rewriting / M. C. F. Ferreira and A. L. Ribeiro -- The Calculus of Algebraic Constructions / F. Blanqui, J.-P. Jouannaud and M. Okada -- HOL-[Lambda][Sigma]: An Intentional First-Order Expression of Higher-Order Logic / G. Dowek, T. Hardin and C. Kirchner -- On the Connections between Rewriting and Formal Language Theory / F. Otto -- A Rewrite System Associated with Quadratic Pisot Units / C. Frougny and J. Sakarovitch -- Fast Rewriting of Symmetric Polynomials / M. Gobel -- On Implementation of Tree Synchronized Languages / F. Saubion and I. Stephan.
ISBN
3540662014 (softcover : alk. paper)
LCCN
99034032
OCLC
  • 504513883
  • ocn504513883
Owning Institutions
Columbia University Libraries