LEADER 06406nam 22007455 450 001 996466105203316 005 20200702134204.0 010 $a3-540-49223-2 024 7 $a10.1007/3-540-59200-8 035 $a(CKB)1000000000234260 035 $a(SSID)ssj0000326348 035 $a(PQKBManifestationID)11213064 035 $a(PQKBTitleCode)TC0000326348 035 $a(PQKBWorkID)10296634 035 $a(PQKB)10828340 035 $a(DE-He213)978-3-540-49223-8 035 $a(PPN)155178210 035 $a(EXLCZ)991000000000234260 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications$b[electronic resource] $e6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings /$fedited by Jieh Hsiang 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (XII, 480 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v914 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-59200-8 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v914 606 $aProgramming languages (Electronic computers) 606 $aComputers 606 $aSoftware engineering 606 $aComputer logic 606 $aMathematical logic 606 $aComputer science?Mathematics 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 615 0$aProgramming languages (Electronic computers). 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aComputer science?Mathematics. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.13/1 702 $aHsiang$b Jieh$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Rewriting Techniques and Applications$d(6th :$f1995 :$eKaiserslautern, Germany) 906 $aBOOK 912 $a996466105203316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA LEADER 01322nam0 22002891i 450 001 UON00449055 005 20231205105033.398 100 $a20150112d1972 |0itac50 ba 101 $adut 102 $aBE 105 $a|||| 1|||| 200 1 $aActief Nederlands. 1: Een cursus op het eerste niveau voor hogere cyclus secundair onderwijs, handelsscholen, avondscholen, volwassenen, zelfstudie$fFr. Van Passel 205 $a4e druk 210 $aAntwerpen$cDe Sikkel$d1972 215 $a201 p.$cill.$d21 cm. 316 $aValore stimato$5IT-UONSI OlandLing/116 a 606 $aLINGUA OLANDESE$xManuali$3UONC043378$2FI 620 $aBE$dAntwerpen$3UONL002183 676 $a439.31$cLingue neerlandesi. Olandese$v21 700 1$aVAN PASSEL$bFrans$3UONV225103$0170819 712 $aDe Sikkel$3UONV256780$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00449055 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI Oland Ling 116 a $eSI 12138 7 116 a Valore stimato$sSottolineato 996 $aActief Nederlands. 1: Een cursus op het eerste niveau voor hogere cyclus secundair onderwijs, handelsscholen, avondscholen, volwassenen, zelfstudie$91331903 997 $aUNIOR