000 03862nam a22005775i 4500
001 978-3-540-73449-9
003 DE-He213
005 20240730190430.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540734499
_9978-3-540-73449-9
024 7 _a10.1007/978-3-540-73449-9
_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 _aTerm Rewriting and Applications
_h[electronic resource] :
_b18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings /
_cedited by Franz Baader.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXII, 422 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4533
505 0 _aFormal Verification of an Optimizing Compiler -- Challenges in Satisfiability Modulo Theories -- On a Logical Foundation for Explicit Substitutions -- Intruders with Caps -- Tom: Piggybacking Rewriting on Java -- Rewriting Approximations for Fast Prototyping of Static Analyzers -- Determining Unify-Stable Presentations -- Confluence of Pattern-Based Calculi -- A Simple Proof That Super-Consistency Implies Cut Elimination -- Bottom-Up Rewriting Is Inverse Recognizability Preserving -- Adjunction for Garbage Collection with Application to Graph Rewriting -- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers -- Symbolic Model Checking of Infinite-State Systems Using Narrowing -- Delayed Substitutions -- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems -- Termination of Rewriting with Right-Flat Rules -- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations -- On the Completeness of Context-Sensitive Order-Sorted Specifications -- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis -- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi -- Proving Termination of Rewrite Systems Using Bounds -- Sequence Unification Through Currying -- The Termination Competition -- Random Descent -- Correctness of Copy in Calculi with Letrec -- A Characterization of Medial as Rewriting Rule -- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus -- On Linear Combinations of ?-Terms -- Satisfying KBO Constraints -- Termination by Quasi-periodic Interpretations.
650 0 _aCompilers (Computer programs).
_93350
650 0 _aMachine theory.
_9142476
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aCompilers and Interpreters.
_931853
650 2 4 _aFormal Languages and Automata Theory.
_9142477
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aBaader, Franz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9142478
710 2 _aSpringerLink (Online service)
_9142479
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540734475
776 0 8 _iPrinted edition:
_z9783540840497
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4533
_9142480
856 4 0 _uhttps://doi.org/10.1007/978-3-540-73449-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93251
_d93251