000 | 03184nam a22004695i 4500 | ||
---|---|---|---|
001 | 978-3-540-47421-0 | ||
003 | DE-He213 | ||
005 | 20160624102023.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1987 gw | s |||| 0|eng d | ||
020 |
_a9783540474210 _9978-3-540-47421-0 |
||
024 | 7 |
_a10.1007/3-540-17220-3 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aRewriting Techniques and Applications _h[electronic resource] : _bBordeaux, France, May 25–27, 1987 Proceedings / _cedited by Pierre Lescanne. |
246 | 3 | _aSecond International Conference on Rewriting Techniques and Applications | |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
300 |
_aVIII, 288 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 ; _v256 |
|
505 | 0 | _aTerm-rewriting implementation of equational logic programming -- Optimizing equational programs -- A compiler for conditional term rewriting systems -- How to choose the weights in the Knuth Bendix ordering -- Detecting looping simplifications -- Combinatorial hypermap rewriting -- The word problem for finitely presented monoids and finite canonical rewriting systems -- Term rewriting systems with priorities -- A gap between linear and non linear term-rewriting systems -- Code generator generation based on template-driven target term rewriting -- Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction -- Groups presented by certain classes of finite length-reducing string-rewriting systems -- Some results about confluence on a given congruence class -- Ground confluence -- Structured contextual rewriting -- Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes -- Completion for rewriting modulo a congruence -- On equational theories, unification and decidability -- A general complete E-unification procedure -- Improving basic narrowing techniques -- Strategy-controlled reduction and narrowing -- Algorithmic complexity of term rewriting systems -- Optimal speedups for parallel pattern matching in trees. | |
520 | _aThis volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987. | ||
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_aLescanne, Pierre. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540172208 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v256 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-17220-3 |
942 |
_2EBK6073 _cEBK |
||
999 |
_c35367 _d35367 |