Buch, Englisch, Band 1631, 408 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1290 g
10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings
Buch, Englisch, Band 1631, 408 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1290 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-66201-3
Verlag: Springer
This volume contains the proceedings of the 10th International Conference on RewritingTechniques andApplicationsheldfromJuly2-4,1999inTrento, Italy, as part of the Federated Logic Conference (FLoC’99). The RTAconferences are dedicated to all aspects of term, string and graph rewriting as well as their applications such as lambda calculi, theorem-proving, functional programming, decision procedures. The program committee selected 23 papers as well as 4 system descriptions from 53 submissions of overall high quality (46 regular papers and 7 systems descriptions). The papers cover awide range of topics: constraint solving, ter- nation,deductionandhigher-orderrewriting,graphs,complexity,tree automata, context-sensitive rewriting, string rewriting and numeration systems: by - thors from countries including: France, Germany, India,Israel, Italy,Japan, The Netherlands, Poland, Portugal, Spain, USA. B. Courcelle (Univ. Bordeaux) and F. Otto (Univ. Kassel) presented - vited talks, on graph grammars and connections between rewriting and formal language theory respectively. F. van Raamsdonk (CWI, Amsterdam) gave an invited tutorial on higher-order rewriting. Wewouldliketothanktheexternalreviewersfortheircontributiontoprep- ing the program and Horatiu Cirstea for his help in maintaining the web server of the program committee.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Compiler
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
Weitere Infos & Material
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.- OnImplementation of Tree Synchronized Languages.
