LEADER 03770oam  2200565   450 
001 996465748503316
005 20210716220535.0
010   $a3-540-48685-2
024 7 $a10.1007/3-540-48685-2
035   $a(CKB)1000000000211086
035   $a(SSID)ssj0000326352
035   $a(PQKBManifestationID)11243966
035   $a(PQKBTitleCode)TC0000326352
035   $a(PQKBWorkID)10296534
035   $a(PQKB)11217428
035   $a(DE-He213)978-3-540-48685-5
035   $a(MiAaPQ)EBC3072319
035   $a(MiAaPQ)EBC6486136
035   $a(PPN)15520100X
035   $a(EXLCZ)991000000000211086
100   $a20210716d1999      uy             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 00$aRewriting techniques and applications $e10th international conference, RTA-99 Trento, Italy, July 2-4, 1999 : proceedings /$fPaliath Narendran, Michael Rusinowitch (editors)
205   $a1st ed. 1999.
210  1$aBerlin, Heidelberg :$cSpringer,$d[1999]
210  4$d©1999
215   $a1 online resource (XII, 408 p.) 
225 1 $aLecture Notes in Computer Science ;$v1631
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-66201-4 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aSession 1 -- Solved Forms for Path Ordering Constraints -- Jeopardy -- Strategic Pattern Matching -- Session 2: -- On the Strong Normalization of Natural Deduction with Permutation-Conversions -- Normalisation in Weakly Orthogonal Rewriting -- Strong Normalization of Proof Nets Modulo Structural Congruences -- Session 3: Invited Talk -- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas -- Session 4: -- Undecidability of the Part of the Theory of Ground Term Algebra Modulo an AC Symbol -- Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting -- A New Result about the Decidability of the Existential One-Step Rewriting Theory -- Session 5: -- A Fully Syntactic AC-RPO -- Theory Path Orderings -- A Characterisation of Multiply Recursive Functions with Higman?s Lemma -- Session 6: -- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors -- Normalization via Rewrite Closures -- Test Sets for the Universal and Existential Closure of Regular Tree Languages -- Session 7: Invited Tutorial -- Higher-Order Rewriting -- Session 8: System Descriptions -- The Maude System -- TOY: A Multiparadigm Declarative System -- UniMoK: A System for Combining Equational Unification Algorithms -- : A Laboratory for Rapid Term Graph Rewriting -- Session 9: -- Decidability for Left-Linear Growing Term Rewriting Systems -- Transforming Context-Sensitive Rewrite Systems -- Context-Sensitive AC-rewriting -- Session 10: -- The Calculus of Algebraic Constructions -- HOL-??: An Intentional First-Order Expression of Higher-Order Logic -- Session 11: Invited Talk -- On the Connections between Rewriting and Formal Language Theory -- Session 12: -- A Rewrite System Associated with Quadratic Pisot Units -- Fast Rewriting of Symmetric Polynomials -- On Implementation of Tree Synchronized Languages.
410  0$aLecture notes in computer science ;$v1631.
606   $aComplexity (Linguistics)
615  0$aComplexity (Linguistics)
676   $a410
702   $aRusinowitch$b Michael
702   $aNarendran$b Paliath$f1955-
712 12$aInternational Conference on Rewriting Techniques and Applications$d(10th :$f1999 :$eTrento, Italy)
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bUtOrBLW
906   $aBOOK
912   $a996465748503316
996   $aRewriting Techniques and Applications$9774195
997   $aUNISA