Term Graph Rewriting

Term Graph Rewriting
Author: M. R. Sleep
Publisher:
Total Pages: 408
Release: 1993-06-08
Genre: Computers
ISBN:

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.

Processes, Terms and Cycles: Steps on the Road to Infinity

Processes, Terms and Cycles: Steps on the Road to Infinity
Author: Aart Middeldorp
Publisher: Springer Science & Business Media
Total Pages: 655
Release: 2005-12-13
Genre: Computers
ISBN: 354030911X

This Festschrift is dedicated to Jan Willem Klop on the occasion of his 60th birthday. The volume comprises a total of 23 scientific papers by close friends and colleagues, written specifically for this book. The papers are different in nature: some report on new research, others have the character of a survey, and again others are mainly expository. Every contribution has been thoroughly refereed at least twice. In many cases the first round of referee reports led to significant revision of the original paper, which was again reviewed. The articles especially focus upon the lambda calculus, term rewriting and process algebra, the fields to which Jan Willem Klop has made fundamental contributions.

Term Rewriting Systems

Term Rewriting Systems
Author: Terese
Publisher: Cambridge University Press
Total Pages: 926
Release: 2003-03-20
Genre: Computers
ISBN: 9780521391153

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.

Rewriting Techniques and Applications

Rewriting Techniques and Applications
Author: Harald Ganzinger
Publisher: Springer Science & Business Media
Total Pages: 456
Release: 1996-07
Genre: Computers
ISBN: 9783540614647

This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines.

Rewriting Techniques and Applications

Rewriting Techniques and Applications
Author: Claude Kirchner
Publisher: Springer
Total Pages: 501
Release: 2015-03-19
Genre: Computers
ISBN: 3662215519

This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite techniques in theorem proving" (L. Bachmair), "Proving properties of typed lambda terms: realizability, covers, and sheaves" (J. Gallier), and "On some algorithmic problems for groups and monoids" (S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.

Foundations of Software Science and Computation Structures

Foundations of Software Science and Computation Structures
Author: Furio Honsell
Publisher: Springer
Total Pages: 425
Release: 2007-12-03
Genre: Computers
ISBN: 3540453156

ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

Strong Sequentiality of Left-linear Overlapping Term Rewriting Systems

Strong Sequentiality of Left-linear Overlapping Term Rewriting Systems
Author: Yoshihito Toyama
Publisher:
Total Pages: 23
Release: 1991
Genre: Rewriting systems (Computer science)
ISBN:

Abstract: "Huet and Lévy showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, the index reduction strategy is normalizing. This paper extends their result to overlapping term rewriting systems. We show that index reduction is normalizing for the class of strongly sequential left- linear term rewriting systems in which every critical pair can be joined with root balanced reductions."

Algebraic and Logic Programming

Algebraic and Logic Programming
Author: Michael Hanus
Publisher: Springer Science & Business Media
Total Pages: 308
Release: 1997-08-20
Genre: Computers
ISBN: 9783540634591

This book constitutes the refereed proceedings of the 6th International Conference on Algebraic and Logic Programming, ALP '97 and the 3rd International Workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997. The 18 revised full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logic programming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods.