000 04277nam a22005775i 4500
001 978-3-540-36835-9
003 DE-He213
005 20240730185247.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540368359
_9978-3-540-36835-9
024 7 _a10.1007/11805618
_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] :
_b17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings /
_cedited by Frank Pfenning.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIV, 418 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 ;
_v4098
505 0 _aFLoC Plenary Talk -- Formal Verification of Infinite State Systems Using Boolean Methods -- Session 1. Constraints and Optimization -- Solving Partial Order Constraints for LPO Termination -- Computationally Equivalent Elimination of Conditions -- On the Correctness of Bubbling -- Propositional Tree Automata -- Session 2. Equational Reasoning -- Generalizing Newman's Lemma for Left-Linear Rewrite Systems -- Unions of Equational Monadic Theories -- Modular Church-Rosser Modulo -- Session 3. System Verification -- Hierarchical Combination of Intruder Theories -- Feasible Trace Reconstruction for Rewriting Approximations -- Invited Talk -- Rewriting Models of Boolean Programs -- Session 4. Lambda Calculus -- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus -- A Terminating and Confluent Linear Lambda Calculus -- A Lambda-Calculus with Constructors -- Structural Proof Theory as Rewriting -- Session 5. Theorem Proving -- Checking Conservativity of Overloaded Definitions in Higher-Order Logic -- Certified Higher-Order Recursive Path Ordering -- Dealing with Non-orientable Equations in Rewriting Induction -- Session 6. System Descriptions -- TPA: Termination Proved Automatically -- RAPT: A Program Transformation System Based on Term Rewriting -- The CL-Atse Protocol Analyser -- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker -- Invited Talk -- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages -- Session 7. Termination -- Predictive Labeling -- Termination of String Rewriting with Matrix Interpretations -- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems -- Proving Positive Almost Sure Termination Under Strategies -- Session 8. Higher-Order Rewriting andUnification -- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property -- Higher-Order Orderings for Normal Rewriting -- Bounded Second-Order Unification Is NP-Complete.
650 0 _aCompilers (Computer programs).
_93350
650 0 _aMachine theory.
_9138578
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.
_9138579
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 _aPfenning, Frank.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9138580
710 2 _aSpringerLink (Online service)
_9138581
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540368342
776 0 8 _iPrinted edition:
_z9783540827245
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4098
_9138582
856 4 0 _uhttps://doi.org/10.1007/11805618
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92732
_d92732