Sold Out
Book Categories |
Invited Talk: Rewrite-Based Automated Reasoning: Challenges Ahead | 1 | |
Fine-Grained Concurrent Completion | 3 | |
AC-Complete Unification and its Application to Theorem Proving | 18 | |
Superposition Theorem Proving for Abelian Groups Represented as Integer Modules | 33 | |
Symideal Grobner Bases | 48 | |
Termination of Constructor Systems | 63 | |
Dummy Elimination in Equational Rewriting | 78 | |
On Proving Termination by Innermost Termination | 93 | |
A Recursive Path Ordering for Higher-Order Terms in [eta]-Long [beta]-Normal Form | 108 | |
Higher-Order Superposition for Dependent Types | 123 | |
Higher-Order Narrowing with Definitional Trees | 138 | |
Invited Talk: Design of a Proof Assistant | 153 | |
A Compiler for Nondeterministic Term Rewriting Systems | 154 | |
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Normalisation | 169 | |
Confluence Properties of Extensional and Non-Extensional [lambda]-Calculi with Explicit Substitutions | 184 | |
On the Power of Simple Diagrams | 200 | |
Coherence for Sharing Proof Nets | 215 | |
Modularity of Termination in Term Graph Rewriting | 230 | |
Confluence of Terminating Conditional Rewrite Systems Revisited | 245 | |
Invited Talk: Applications of Rewrite Techniques in Monoids and Rings | 260 | |
Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem | 261 | |
The First-Order Theory of One-Step Rewriting is Undecidable | 276 | |
An Algorithm for Distributive Unification | 287 | |
On the Termination Problem for One-Rule Semi-Thue Systems | 302 | |
Efficient Second-Order Matching | 317 | |
Linear Second-Order Unification | 332 | |
Unification of Higher-Order Patterns in a Simply Typed Lambda-Calculus with Finite Products and Terminal Type | 347 | |
Decidable Approximations of Term Rewriting Systems | 362 | |
Semantics and Strong Sequentiality of Priority Term Rewriting Systems | 377 | |
Higher-Order Families | 392 | |
A New Proof Manager and Graphic Interface for the Larch Prover | 408 | |
ReDuX 1.5: New Facets of Rewriting | 412 | |
CiME: Completion Modulo E | 416 | |
Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover | 420 | |
EPIC: An Equational Language - Abstract Machine and Supporting Tools | 424 | |
SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories | 428 | |
On Gaining Efficiency in Completion-Based Theorem Proving | 432 | |
Author Index | 437 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionRewriting Techniques and Applications, Vol. 110
X
This Item is in Your InventoryRewriting Techniques and Applications, Vol. 110
X
You must be logged in to review the productsX
X
X
Add Rewriting Techniques and Applications, Vol. 110, This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a, Rewriting Techniques and Applications, Vol. 110 to the inventory that you are selling on WonderClubX
X
Add Rewriting Techniques and Applications, Vol. 110, This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a, Rewriting Techniques and Applications, Vol. 110 to your collection on WonderClub |