000 03513nam a22006135i 4500
001 978-3-540-25979-4
003 DE-He213
005 20240423130226.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540259794
_9978-3-540-25979-4
024 7 _a10.1007/b98160
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aRewriting Techniques and Applications
_h[electronic resource] :
_b15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings /
_cedited by Vincent van Oostrom.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aX, 315 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 ;
_v3091
505 0 _aTermination Analysis of the Untyped ?-Calculus -- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems -- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms -- Monadic Second-Order Unification Is NP-Complete -- A Certified AC Matching Algorithm -- Matchbox: A Tool for Match-Bounded String Rewriting -- TORPA: Termination of Rewriting Proved Automatically -- Querying Unranked Trees with Stepwise Tree Automata -- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation -- Rewriting for Fitch Style Natural Deductions -- Efficient ?-Evaluation with Interaction Nets -- Proving Properties of Term Rewrite Systems via Logic Programs -- On the Modularity of Confluence in Infinitary Term Rewriting -- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting -- Automated Termination Proofs with AProVE -- An Approximation Based Approach to Infinitary Lambda Calculi -- Böhm-Like Trees for Term Rewriting Systems -- Dependency Pairs Revisited -- Inductive Theorems for Higher-Order Rewriting -- The Joinability and Unification Problems for Confluent Semi-constructor TRSs -- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 0 _aComputer programming.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aComputer science
_xMathematics.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aOostrom, Vincent van.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540221531
776 0 8 _iPrinted edition:
_z9783662195642
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3091
856 4 0 _uhttps://doi.org/10.1007/b98160
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c186377
_d186377