Term Rewriting Systems

Authors:
J. W. Klop;Marc Bezem;R. C. De Vrijer
Affiliations:
-;-;-
Venue:
Term Rewriting Systems
Year:
2001

Citing 0
Cited 39

P-TAC: a parallel intermediate language

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Formal Specification and Analysis of Software Architectures Using the Chemical Abstract Machine Model

IEEE Transactions on Software Engineering - Special issue on software architecture
A Formal Model for SDL Specifications Based on Timed Rewriting Logic

Automated Software Engineering
Tool-Assisted Specification and Verification of the JavaCard Platform

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A calculus of module systems

Journal of Functional Programming
Modularity of strong normalization in the algebraic-λ-cube

Journal of Functional Programming
BLOB computing

Proceedings of the 1st conference on Computing frontiers
Formalization and abstract implementation of rewriting with nested rules

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Polymorphic higher-order recursive path orderings

Journal of the ACM (JACM)
Computing with subspaces

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A calculus of open modules: call-by-need strategy and confluence

Mathematical Structures in Computer Science
A Biologically Inspired Model with Fusion and Clonation of Membranes

UC '08 Proceedings of the 7th international conference on Unconventional Computing
Analysis of Rewrite-Based Access Control Policies

Electronic Notes in Theoretical Computer Science (ENTCS)
First-class patterns

Journal of Functional Programming
Applications of infinitary lambda calculus

Information and Computation
VMTL---A Modular Termination Laboratory

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Diagrammatic Confluence and Completion

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Set functions for functional logic programming

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Regular Expressions with Numerical Constraints and Automata with Counters

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Functional logic programming

Communications of the ACM
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem

Journal of Automated Reasoning
Parallel inclusion-based points-to analysis

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
On the verification of membrane systems with dynamic structure

Natural Computing: an international journal
Infinite families of finite string rewriting systems and their confluence

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Incremental checking of well-founded recursive specifications modulo axioms

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Simulation strategy of membrane computing to characterize the structure and non-deterministic behavior of biological systems: a case study with ligand-receptor network of protein TGF-β

IVIC'11 Proceedings of the Second international conference on Visual informatics: sustaining research and innovations - Volume Part I
On the correctness of bubbling

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Generalizing newman's lemma for left-linear rewrite systems

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Constraint based strategies

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
The membership problem for regular expressions with unordered concatenation and numerical constraints

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On Explicit Substitution with Names

Journal of Automated Reasoning
Solution to the Range Problem for Combinatory Logic

Fundamenta Informaticae
What is turing's comparison between mechanism and writing worth?

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Narrowing, abstraction and constraints for proving properties of reduction relations

Rewriting Computation and Proof
Modular access control via strategic rewriting

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Synthesis of sup-interpretations: A survey

Theoretical Computer Science
Are needed redexes really needed?

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Parallel flow-sensitive pointer analysis by graph-rewriting

PACT '13 Proceedings of the 22nd international conference on Parallel architectures and compilation techniques
Confluence of aspects for sequence diagrams

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.02

Visualization

Abstract

From the Publisher:This book, the first on the subject in English, gives a readable but rigorous introduction to the theory of term rewriting systems. These are a technique used in computer science, especially functional programming, for abstract data type specification and automatic theorem-proving. The book is self-contained, and begins with a discussion of elementary systems and progresses to the most general cases that involve concepts such as second-order lambda calculus. Exercises are included throughout, and solutions to a selection of them are provided. Complete proofs of results that are often buried in the literature are also given, so researchers in functional programming, theoretical computer science, and logic will find this book useful.