000 04200nam a22006015i 4500
001 978-3-540-69721-3
003 DE-He213
005 20240423132513.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540697213
_9978-3-540-69721-3
024 7 _a10.1007/BFb0052355
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aRewriting Techniques and Applications
_h[electronic resource] :
_b9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings /
_cedited by Tobias Nipkow.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aX, 346 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,
_x1611-3349 ;
_v1379
505 0 _aOrigin tracking in term rewriting -- Simultaneous critical pairs and Church-Rosser property -- Church-Rosser theorems for abstract reduction modulo an equivalence relation -- Automatic monoids versus monoids with finite convergent presentations -- Decidable and undecidable second-order unification problems -- On the exponent of periodicity of minimal solutions of context equations -- Unification in extensions of shallow equational theories -- Unification and matching in process algebras -- E-unification for subsystems of S4 -- Solving disequations modulo some class of rewrite systems -- About proofs by consistency -- Normalization of S-terms is decidable -- Decidable approximations of sets of descendants and sets of normal forms -- Algorithms and reductions for rewriting problems -- The decidability of simultaneous rigid E-unification with one variable -- Ordering constraints over feature trees expressed in second-order monadic logic -- Co-definite set constraints -- Modularity of termination using dependency pairs -- Termination of associative-commutative rewriting by dependency pairs -- Termination transformation by tree lifting ordering -- Towards automated termination proofs through “freezing” -- Higher-order rewriting and partial evaluation -- SN combinators and partial combinatory algebras -- Coupling saturation-based provers by exchanging positive/negative information -- An on-line problem database.
520 _aThis book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with the assistance of 113 additional referees. The book covers all current aspects of rewriting including rewriting systems, term rewriting, string rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.
650 0 _aCompilers (Computer programs).
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aMathematical logic.
650 1 4 _aCompilers and Interpreters.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aNipkow, Tobias.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540643012
776 0 8 _iPrinted edition:
_z9783662193471
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1379
856 4 0 _uhttps://doi.org/10.1007/BFb0052355
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188476
_d188476