Rewriting Techniques and Applications de Jieh Hsiang

Rewriting Techniques and Applications: 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings: Lecture Notes in Computer Science, cartea 914

Jieh Hsiang

en Limba Engleză Paperback – 22 mar 1995

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1053^.72 lei
20%

Preț: 337^.82 lei
20%

Preț: 339^.43 lei
20%

Preț: 449^.99 lei
20%

Preț: 238^.01 lei
20%

Preț: 337^.82 lei
20%

Preț: 438^.69 lei
Preț: 446^.28 lei
20%

Preț: 341^.10 lei
20%

Preț: 148^.66 lei
20%

Preț: 310^.26 lei
20%

Preț: 256^.27 lei
20%

Preț: 640^.52 lei
17%

Preț: 427^.22 lei
20%

Preț: 650^.20 lei
20%

Preț: 307^.71 lei
20%

Preț: 1067^.33 lei
20%

Preț: 587^.17 lei
Preț: 378^.43 lei
20%

Preț: 334^.54 lei
15%

Preț: 435^.36 lei
20%

Preț: 607^.39 lei
20%

Preț: 538^.29 lei
Preț: 389^.48 lei
20%

Preț: 326^.98 lei
20%

Preț: 1404^.34 lei
20%

Preț: 1016^.88 lei
20%

Preț: 575^.04 lei
20%

Preț: 575^.48 lei
20%

Preț: 579^.12 lei
20%

Preț: 757^.61 lei
15%

Preț: 576^.20 lei
17%

Preț: 360^.19 lei
20%

Preț: 504^.57 lei
20%

Preț: 172^.69 lei
20%

Preț: 369^.12 lei
20%

Preț: 350^.92 lei
20%

Preț: 581^.57 lei
Preț: 407^.85 lei
20%

Preț: 592^.06 lei
20%

Preț: 757^.61 lei
20%

Preț: 819^.86 lei
20%

Preț: 649^.49 lei
20%

Preț: 347^.62 lei
20%

Preț: 309^.90 lei
20%

Preț: 122^.89 lei

Cuprins

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 fordistributed 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.