Research Catalog

Rewriting techniques and applications : 7th international conference, RTA-96, New Brunswick, NJ, USA, July 1996 : proceedings

Title
Rewriting techniques and applications : 7th international conference, RTA-96, New Brunswick, NJ, USA, July 1996 : proceedings / Harald Ganzinger (ed.).
Publication
New York : Springer, 1996.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextRequest in advance QA267 .I555 1996Off-site

Holdings

Details

Additional Authors
  • Ganzinger, H. (Harald), 1950-
  • International Conference on Rewriting Techniques and Applications (7th : 1996 : New Brunswick, N.J.)
Description
xi, 435 pages : illustrations; 24 cm.
Series Statement
Lecture notes in computer science ; 1103
Uniform Title
Lecture notes in computer science ; 1103.
Subjects
Bibliography (note)
  • Includes bibliographical references and index.
Contents
  • Invited Talk: Rewrite-Based Automated Reasoning: Challenges Ahead / Deepak Kapur -- Fine-Grained Concurrent Completion / Claude Kirchner, Christopher Lynch and Christelle Scharff -- AC-Complete Unification and its Application to Theorem Proving / Alexandre Boudet, Evelyne Contejean and Claude Marche -- Superposition Theorem Proving for Abelian Groups Represented as Integer Modules / Jurgen Stuber -- Symideal Grobner Bases / Manfred Gobel -- Termination of Constructor Systems / Thomas Arts and Jurgen Giesl -- Dummy Elimination in Equational Rewriting / M. C. F. Ferreira -- On Proving Termination by Innermost Termination / Bernhard Gramlich -- A Recursive Path Ordering for Higher-Order Terms in [eta]-Long [beta]-Normal Form / Jean-Pierre Jouannaud and Albert Rubio -- Higher-Order Superposition for Dependent Types / Roberto Virga -- Higher-Order Narrowing with Definitional Trees / Michael Hanus and Christian Prehofer -- Invited Talk: Design of a Proof Assistant / Gerard Huet --
  • A Compiler for Nondeterministic Term Rewriting Systems / Marian Vittek -- Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Normalisation / Roel Bloo and Kristoffer H. Rose -- Confluence Properties of Extensional and Non-Extensional [lambda]-Calculi with Explicit Substitutions / Delia Kesner -- On the Power of Simple Diagrams / Roberto Di Cosmo -- Coherence for Sharing Proof Nets / S. Guerrini, S. Martini and A. Masini -- Modularity of Termination in Term Graph Rewriting / M. R. K. Krishna Rao -- Confluence of Terminating Conditional Rewrite Systems Revisited / Bernhard Gramlich and Claus-Peter Wirth -- Invited Talk: Applications of Rewrite Techniques in Monoids and Rings / Klaus Madlener -- Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem / Christoph Luth -- The First-Order Theory of One-Step Rewriting is Undecidable / Ralf Treinen -- An Algorithm for Distributive Unification / Manfred Schmidt-Schauss --
  • On the Termination Problem for One-Rule Semi-Thue Systems / Geraud Senizergues -- Efficient Second-Order Matching / Regis Curien, Zhenyu Qian and Hui Shi -- Linear Second-Order Unification / Jordi Levy -- Unification of Higher-Order Patterns in a Simply Typed Lambda-Calculus with Finite Products and Terminal Type / Roland Fettig and Bernd Lochner -- Decidable Approximations of Term Rewriting Systems / Florent Jacquemard -- Semantics and Strong Sequentiality of Priority Term Rewriting Systems / Masahiko Sakai and Yoshihito Toyama -- Higher-Order Families / Vincent van Oostrom -- A New Proof Manager and Graphic Interface for the Larch Prover / Frederic Voisin -- ReDuX 1.5: New Facets of Rewriting / Reinhard Bundgen, Carsten Sinz and Jochen Walter -- CiME: Completion Modulo E / Evelyne Contejean and Claude Marche -- Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover / Mark T. Vandevoorde and Deepak Kapur --
  • EPIC: An Equational Language - Abstract Machine and Supporting Tools / H. R. Walters and J. F. Th. Kamperman -- SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories / Narjes Berregeb, Adel Bouhoula and Michael Rusinowitch -- On Gaining Efficiency in Completion-Based Theorem Proving / Thomas Hillenbrand, Arnim Buch and Roland Fettig.
ISBN
3540614648 (Berlin : softcover : alk. paper)
LCCN
96026788
OCLC
ocm34932874
Owning Institutions
Columbia University Libraries