Rewriting Techniques and Applications
Springer Berlin (Verlag)
978-3-540-70588-8 (ISBN)
Modular Termination of Basic Narrowing.- Linear-algebraic ?-calculus: higher-order, encodings, and confluence..- Term-Graph Rewriting Via Explicit Paths.- Finer Is Better: Abstraction Refinement for Rewriting Approximations.- A Needed Rewriting Strategy for Data-Structures with Pointers.- Effectively Checking the Finite Variant Property.- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures.- Maximal Termination.- Usable Rules for Context-Sensitive Rewrite Systems.- Combining Equational Tree Automata over AC and ACI Theories.- Closure of Hedge-Automata Languages by Hedge Rewriting.- On Normalisation of Infinitary Combinatory Reduction Systems.- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.- Arctic Termination ...Below Zero.- Logics and Automata for Totally Ordered Trees.- Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks.- Nominal Unification from a Higher-Order Perspective.- Functional-Logic Graph Parser Combinators.- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.- Tree Automata for Non-linear Arithmetic.- Confluence by Decreasing Diagrams.- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case.- Root-Labeling.- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities.- Deciding Innermost Loops.- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations.- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting.- Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof.- Reduction Under Substitution.- Normalization of Infinite Terms.
| Erscheint lt. Verlag | 4.7.2008 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIII, 457 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 718 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | Approximation • Automata • Calculus • Constraint Solving • critical pair • cryptographic protocol analysis • data structure • data structures • dependency pairs • equational tree automata • formal analysis • Functional-Logic Programming • graph parsing • Graph Rewriting • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Higher Order Rewriting • Lambda Calculus • Logic Programming • Object-oriented Languages • Optimization • parser combinators • programming calculi • Programming Language Semantics • Proof theory • proving • Rewriting • Rewriting Systems • satisfiability • Semantics • Simulation • Standardization • Static Analysis • termination • Term Rewriting • theorem proving • type inference • unification • verification |
| ISBN-10 | 3-540-70588-0 / 3540705880 |
| ISBN-13 | 978-3-540-70588-8 / 9783540705888 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
