7. RTA 1996:
New Brunswick,
NJ,
USA
Harald Ganzinger (Ed.):
Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings.
Lecture Notes in Computer Science 1103 Springer 1996, ISBN 3-540-61464-8 BibTeX
@proceedings{DBLP:conf/rta/1996,
editor = {Harald Ganzinger},
title = {Rewriting Techniques and Applications, 7th International Conference,
RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings},
booktitle = {RTA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1103},
year = {1996},
isbn = {3-540-61464-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Regular Papers
- Deepak Kapur:
Rewrite-Based Automated Reasoning: Challenges Ahead.
1-2 BibTeX
- Claude Kirchner, Christopher Lynch, Christelle Scharff:
Fine-Grained Concurrent Completion.
3-17 BibTeX
- Alexandre Boudet, Evelyne Contejean, Claude Marché:
AC-Complete Unification and its Application to Theorem Proving.
18-32 BibTeX
- Jürgen Stuber:
Superposition Theorem Proving for Albelian Groups Represented as Integer Modules.
33-47 BibTeX
- Manfred Göbel:
Symideal Gröbner Bases.
48-62 BibTeX
- Thomas Arts, Jürgen Giesl:
Termination of Constructor Systems.
63-77 BibTeX
- Maria C. F. Ferreira:
Dummy Elimination in Equational Rewriting.
78-92 BibTeX
- Bernhard Gramlich:
On Proving Termination by Innermost Termination.
93-107 BibTeX
- Jean-Pierre Jouannaud, Albert Rubio:
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form.
108-122 BibTeX
- Roberto Virga:
Higher-Order Superposition for Dependent Types.
123-137 BibTeX
- Michael Hanus, Christian Prehofer:
Higher-Order Narrowing with Definitional Trees.
138-152 BibTeX
- Gérard P. Huet:
Design Proof Assistant (Abstract).
153 BibTeX
- Marian Vittek:
A Compiler for Nondeterministic Term Rewriting Systems.
154-167 BibTeX
- Roel Bloo, Kristoffer Høgsbro Rose:
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Nomalisation.
169-183 BibTeX
- Delia Kesner:
Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract).
184-199 BibTeX
- Roberto Di Cosmo:
On the Power of Simple Diagrams.
200-214 BibTeX
- Stefano Guerrini, Simone Martini, Andrea Masini:
Coherence for Sharing Proof Nets.
215-229 BibTeX
- M. R. K. Krishna Rao:
Modularity of Termination in Term Graph Rewriting.
230-244 BibTeX
- Bernhard Gramlich, Claus-Peter Wirth:
Confluence of Terminating Conditional Rewrite Systems Revisited.
245-259 BibTeX
- Klaus Madlener:
Applications of Rewrite Techniques in Monoids and Rings (Abstract).
260 BibTeX
- Christoph Lüth:
Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem.
261-275 BibTeX
- Ralf Treinen:
The First-Order Theory of One-Step Rewriting is Undecidable.
276-286 BibTeX
- Manfred Schmidt-Schauß:
An Algorithm for Distributive Unification.
287-301 BibTeX
- Géraud Sénizergues:
On the Termination Problem for One-Rule Semi-Thue System.
302-316 BibTeX
- Régis Curien, Zhenyu Qian, Hui Shi:
Efficient Second-Order Matching.
317-331 BibTeX
- Jordi Levy:
Linear Second-Order Unification.
332-346 BibTeX
- Roland Fettig, Bernd Löchner:
Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus with Finite Products and terminal Type.
347-361 BibTeX
- Florent Jacquemard:
Decidable Approximations of Term Rewriting Systems.
362-376 BibTeX
- Masahiko Sakai, Yoshihito Toyama:
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
377-391 BibTeX
- Vincent van Oostrom:
Higher-Order Families.
392-407 BibTeX
System Descriptions
Copyright © Sat May 16 23:36:09 2009
by Michael Ley (ley@uni-trier.de)
