Rewriting Techniques and Applications 10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Narendran, Paliath (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rusinowitch, Michael (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Computer Science, 1631
• Θέματα: Programming languages (Electronic computers).; Mathematical logic.; Computer logic.; Artificial intelligence.; Computer science-Mathematics.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Artificial Intelligence.; Symbolic and Algebraic Manipulation.

Πίνακας περιεχομένων:

• Session 1
• Solved Forms for Path Ordering Constraints
• Jeopardy
• Strategic Pattern Matching
• Session 2:
• On the Strong Normalization of Natural Deduction with Permutation-Conversions
• Normalisation in Weakly Orthogonal Rewriting
• Strong Normalization of Proof Nets Modulo Structural Congruences
• Session 3: Invited Talk
• Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas
• Session 4:
• Undecidability of the Part of the Theory of Ground Term Algebra Modulo an AC Symbol
• Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting
• A New Result about the Decidability of the Existential One-Step Rewriting Theory
• Session 5:
• A Fully Syntactic AC-RPO
• Theory Path Orderings
• A Characterisation of Multiply Recursive Functions with Higman's Lemma
• Session 6:
• Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
• Normalization via Rewrite Closures
• Test Sets for the Universal and Existential Closure of Regular Tree Languages
• Session 7: Invited Tutorial
• Higher-Order Rewriting
• Session 8: System Descriptions
• The Maude System
• TOY: A Multiparadigm Declarative System
• UniMoK: A System for Combining Equational Unification Algorithms
• : A Laboratory for Rapid Term Graph Rewriting
• Session 9:
• Decidability for Left-Linear Growing Term Rewriting Systems
• Transforming Context-Sensitive Rewrite Systems
• Context-Sensitive AC-rewriting
• Session 10:
• The Calculus of Algebraic Constructions
• HOL-??: An Intentional First-Order Expression of Higher-Order Logic
• Session 11: Invited Talk
• On the Connections between Rewriting and Formal Language Theory
• Session 12:
• A Rewrite System Associated with Quadratic Pisot Units
• Fast Rewriting of Symmetric Polynomials
• On Implementation of Tree Synchronized Languages.