Willkommen, schön sind Sie da!
Logo Ex Libris

Rewriting Techniques and Applications

  • Kartonierter Einband
  • 492 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held ... Weiterlesen
20%
130.00 CHF 104.00
Sie sparen CHF 26.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held in Kaiserslautern, Germany in April 1995.
The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two problem sets, one contributed by Mark E. Stickel and Hantao Zhang and another by Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop.
The volume addresses all current aspects of rewriting techniques and their applications and thus defines the state-of-the-art in this active field of research.

Inhalt
On some mathematical logic contributions to rewriting techniques: Lost heritage.- Modularity of completeness revisited.- Automatic termination proofs with transformation orderings.- A termination ordering for higher order rewrite systems.- A complete characterization of termination of 0p 1q?1r 0s.- On narrowing, refutation proofs and constraints.- Completion for multiple reduction orderings.- Towards an efficient construction of test sets for deciding ground reducibility.- Term rewriting in contemporary resolution theorem proving.- ??!?=1 Optimizing optimal ?-calculus implementations.- Substitution tree indexing.- Concurrent garbage collection for concurrent rewriting.- Lazy rewriting and eager machinery.- A rewrite mechanism for logic programs with negation.- Level-confluence of conditional rewrite systems with extra variables in right-hand sides.- A polynomial algorithm testing partial confluence of basic semi-Thue systems.- Problems in rewriting applied to categorical concepts by the example of a computational comonad.- Relating two categorical models of term rewriting.- Towards a domain theory for termination proofs.- Higher-order rewrite systems.- Infinitary lambda calculi and böhm models.- Proving the genericity lemma by leftmost reduction is simple.- (Head-)normalization of typeable rewrite systems.- Explicit substitutions with de bruijn's levels.- A restricted form of higher-order rewriting applied to an HDL semantics.- Rewrite systems for integer arithmetic.- General solution of systems of linear diophantine equations and inequations.- Combination of constraint solving techniques: An algebraic point of view.- Some independence results for equational unification.- Regular substitution sets: A means of controlling E-unification.- DISCOUNT: A system for distributed equational deduction.- ASTRE: Towards a fully automated program transformation system.- Parallel ReDuX ? PaReDuX.- STORM: A many-to-one associative-commutative matcher.- LEMMA: A system for automated synthesis of recursive programs in equational theories.- Generating polynomial orderings for termination proofs.- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2.- Prototyping completion with constraints using computational systems.- Guiding term reduction through a neural network: Some preliminary results for the group theory.- Studying quasigroup identities by rewriting techniques: Problems and first results.- Problems in rewriting III.

Produktinformationen

Titel: Rewriting Techniques and Applications
Untertitel: 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings
Editor:
EAN: 9783540592006
ISBN: 3540592008
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Anzahl Seiten: 492
Gewicht: 739g
Größe: H235mm x B155mm x T26mm
Jahr: 1995
Auflage: 1995

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"

Zuletzt angesehen
Verlauf löschen