LEADER 06021nam 22007935 450 001 9910143461903321 005 20250730110253.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(BIP)5690320 035 $a(EXLCZ)991000000000211086 100 $a20121227d1999 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications $e10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings /$fedited by Paliath Narendran, Michael Rusinowitch 205 $a1st ed. 1999. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1999. 215 $a1 online resource (XII, 408 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v1631 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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 -- OnImplementation of Tree Synchronized Languages. 330 $aThis volume contains the proceedings of the 10th International Conference on RewritingTechniques andApplicationsheldfromJuly2-4,1999inTrento, Italy, as part of the Federated Logic Conference (FLoC'99). The RTAconferences are dedicated to all aspects of term, string and graph rewriting as well as their applications such as lambda calculi, theorem-proving, functional programming, decision procedures. The program committee selected 23 papers as well as 4 system descriptions from 53 submissions of overall high quality (46 regular papers and 7 systems descriptions). The papers cover awide range of topics: constraint solving, ter- nation,deductionandhigher-orderrewriting,graphs,complexity,tree automata, context-sensitive rewriting, string rewriting and numeration systems::: by - thors from countries including: France, Germany, India,Israel, Italy,Japan, The Netherlands, Poland, Portugal, Spain, USA. B. Courcelle (Univ. Bordeaux) and F. Otto (Univ. Kassel) presented - vited talks, on graph grammars and connections between rewriting and formal language theory respectively. F. van Raamsdonk (CWI, Amsterdam) gave an invited tutorial on higher-order rewriting. Wewouldliketothanktheexternalreviewersfortheircontributiontoprep- ing the program and Horatiu Cirstea for his help in maintaining the web server of the program committee. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v1631 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aComputer science 606 $aArtificial intelligence 606 $aComputer science$xMathematics 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aArtificial Intelligence 606 $aSymbolic and Algebraic Manipulation 615 0$aCompilers (Computer programs) 615 0$aMachine theory. 615 0$aComputer science. 615 0$aArtificial intelligence. 615 0$aComputer science$xMathematics. 615 14$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aArtificial Intelligence. 615 24$aSymbolic and Algebraic Manipulation. 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$bMiAaPQ 906 $aBOOK 912 $a9910143461903321 996 $aRewriting Techniques and Applications$9774195 997 $aUNINA LEADER 00838nlm 2200265Ia 450 001 996663870103316 005 20250624101422.0 100 $a19840611d1684---- uy | 101 0 $aeng 102 $aUK 135 $adrcnu 200 1 $a<> jovial crew, or, The merry beggars$ea comedy as it is acted at the Theatre Royal$fby Richard Brome, Gent 210 1 $aLondon$cPrinted for Joseph Hindmarsh$d1684 215 $aTesto elettronico (PDF) ([2], 59 p.) 230 $aBase dati testuale 300 $aRiproduzione dell'originale presso la Harvard University Library 606 0 $aTeatro inglese$2BNCF 676 $a822 700 1$aBROME,$bRichard$fd. 1652?$0793120 801 0$aIT$bcba$cREICAT 912 $a996663870103316 959 $aEB 969 $aER 996 $aJovial crew, or, The merry beggars$94399094 997 $aUNISA