LEADER 03758nam  22005775  450 
001 996465689503316
005 20200706045119.0
010   $a3-540-47421-8
024 7 $a10.1007/3-540-17220-3
035   $a(CKB)1000000000230583
035   $a(SSID)ssj0000326355
035   $a(PQKBManifestationID)11912755
035   $a(PQKBTitleCode)TC0000326355
035   $a(PQKBWorkID)10267484
035   $a(PQKB)11043851
035   $a(DE-He213)978-3-540-47421-0
035   $a(PPN)155217437
035   $a(EXLCZ)991000000000230583
100   $a20121227d1987      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aRewriting Techniques and Applications$b[electronic resource] $eBordeaux, France, May 25-27, 1987. Proceedings /$fedited by Pierre Lescanne
205   $a1st ed. 1987.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987.
215   $a1 online resource (VIII, 288 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v256
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-17220-3 
327   $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.
330   $aThis volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v256
517 3 $aSecond International Conference on Rewriting Techniques and Applications
606   $aMathematical logic
606   $aComputer logic
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
615  0$aMathematical logic.
615  0$aComputer logic.
615 14$aMathematical Logic and Formal Languages.
615 24$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Foundations.
676   $a005.131
702   $aLescanne$b Pierre$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465689503316
996   $aRewriting Techniques and Applications$9774195
997   $aUNISA