Advanced Topics in Term Rewriting


Book Description

Unlike current survey articles and textbooks, here the so-called confluence and termination hierarchies play a key role. Throughout, the relationships between the properties in the hierarchies are reviewed, and it is shown that for every implication X => Y in the hierarchies, the property X is undecidable for all term rewriting systems satisfying Y. Topics covered include: the newest techniques for proving termination of rewrite systems; a comprehensive chapter on conditional term rewriting systems; a state-of-the-art survey of modularity in term rewriting, and a uniform framework for term and graph rewriting, as well as the first result on conditional graph rewriting.




Conditional Term Rewriting Systems


Book Description

This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively.




Term Rewriting Systems


Book Description

Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.




Conditional Term Rewriting Systems


Book Description

The 1st International Workshop on Conditional Term Rewriting Systems took place in Orsay (University of Paris-Sud) in July 1987, and brought together most of the researchers involved in the field. Conditional rewriting has actually known important breakthroughs during the last two years; it was the purpose of the workshop to put the results together, to present new, original contributions to the domain, and to discuss still unsolved issues. These contributions are reported in the proceedings. The main questions that have been addressed are the different semantics for conditional rewriting and their classification, possible extensions to the basic formalism, and the relationship between conditional rewriting and logic programming. Also, more practical issues such as applications and implementations of conditional term rewriting systems have been addressed. Descriptions of seven actual systems allowing conditional rewriting are included.




Conditional and Typed Rewriting Systems


Book Description

This book presents throroughly revised full versions of the 21 papers accepted for the Fourth International Workshop on Conditional and Typed Rewriting Systems, CTRS-94, held in conjunction with ICALP '94 in Jerusalem, Israel, in July 1994. The volume reports the research advances in the area of rewriting in general achieved since the predecessor workshop held in July 1992. Among the topics addressed are conditional term rewriting, typed systems, higher-order rewriting, graph rewriting, combinator-based languages, and constrained rewriting.




Conditional and Typed Rewriting Systems


Book Description

In recent years, extensions of rewriting techniques that go beyond the traditional untyped algebraic rewriting framework have been investigated and developed. Among these extensions, conditional and typed systems are particularly important, as are higher-order systems, graph rewriting systems, etc. The international CTRS (Conditional and Typed Rewriting Systems) workshops are intended to offer a forum for researchers on such extensions of rewriting techniques. This volume presents the proceedings of the second CTRS workshop, which contributed to discussion and evaluation of new directions of research. (The proceedings of the first CTRS workshop are in Lecture Notes in Computer Science, Vol. 308.) Several important directions for extensions of rewriting techniques were stressed, which are reflected in the organization of the chapters in this volume: - Theory of conditional and Horn clause systems, - Infinite terms, non-terminating systems, and termination, - Extension of Knuth-Bendix completion, - Combined systems, combined languages and modularity, - Architecture, compilers and parallel computation, - Basic frameworks for typed and order-sorted systems, - Extension of unification and narrowing techniques.




Term Graph Rewriting


Book Description

A comprehensive study and exposition on the benefits of graph and term rewriting. Contains such theoretical advances as a single pushout categorical model of graph rewriting, a new theory of transfinite term rewriting and an abstract interpretation for term graph rewriting. Includes a discussion of parallelism.




Computability, Complexity, and Languages


Book Description

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. Additions to the second edition include: extended exercise sets, which vary in difficulty; expanded section on recursion theory; new chapters on program verification and logic programming; updated references and examples throughout.




Term Rewriting and Applications


Book Description

The 18th International Conference on Rewriting Techniques and Applications, held in Paris, France in June 2007, featured presentations and discussions centering on some of the latest advances in the field. This volume presents the proceedings from that meeting. Papers cover current research on all aspects of rewriting, including applications, foundational issues, frameworks, implementations, and semantics.




Rewriting Techniques and Applications


Book Description

This volume contains the proceedings of the14thInternationalConferenceon RewritingTechniquesandApplications (RTA2003). It was held June 9-11, 2003 in Valencia, Spain, as part of RDP, theFederatedConferenceonRewriting,- ductionandProgramming, together with the International Conference on Typed Lambda Calculi and Applications (TLCA2003), the International Workshop on First-order Theorem Proving (FTP2003), the annual meeting of the IFIP Working Group 1.6 on Term Rewriting, the International Workshop on Rule- Based Programming (RULE2003), the International Workshop on Uni?cation (UNIF2003), the International Workshop on Functional and (Constraint) Logic Programming (WFLP2003), the International Workshop on Reduction Stra- gies in Rewriting and Programming (WRS2003), and the International Wo- shop on Termination (WST2003). RTA is the major forum for the presentation of research on all aspects of rewr- ing. Previous RTA conferences were held in Dijon (1985), Bordeaux (1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), New Brunswick, NJ (1996), Sitges, Barcelona (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), and Copenhagen (2002). This year, there were 61 submissions of which 57 regular research papers and 4 system descriptions, with authors from institutions in France (19.6 authors of submitted papers, of which 11.3 were accepted), USA (6.5 of 9), UK (3.5 of 4.5), Japan(3of6),Germany(2.5 of 4),TheNetherlands(2.2 of 5.2),Spain(1.5 of 4), Austria (1 of 1), Israel (0.5 of 2.5), Portugal (0 of 1), Algeria (0 of 1), Denmark (0 of 1), Canada (0 of 1), Brazil (0 of 0.6), and Poland (0 of 0.5).