000 | 05173nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-49223-8 | ||
003 | DE-He213 | ||
005 | 20160624102040.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1995 gw | s |||| 0|eng d | ||
020 |
_a9783540492238 _9978-3-540-49223-8 |
||
024 | 7 |
_a10.1007/3-540-59200-8 _2doi |
|
050 | 4 | _aQA76.7-76.73 | |
050 | 4 | _aQA76.76.C65 | |
072 | 7 |
_aUMX _2bicssc |
|
072 | 7 |
_aUMC _2bicssc |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
072 | 7 |
_aCOM010000 _2bisacsh |
|
082 | 0 | 4 |
_a005.13 _223 |
245 | 1 | 0 |
_aRewriting Techniques and Applications _h[electronic resource] : _b6th International Conference, RTA-95 Kaiserslautern, Germany, April 5–7, 1995 Proceedings / _cedited by Jieh Hsiang. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1995. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1995. |
|
300 |
_aXII, 480 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v914 |
|
505 | 0 | _aOn 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. | |
520 | _aThis 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 0 |
_aAlgebra _xData processing. |
|
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aHsiang, Jieh. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540592006 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v914 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-59200-8 |
942 |
_2EBK6707 _cEBK |
||
999 |
_c36001 _d36001 |