Results 1  10
of
4,406,867
Term Rewriting Systems
, 1992
"... Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstra ..."
Abstract

Cited by 613 (18 self)
 Add to MetaCart
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss
ORDERINGS FOR TERMREWRITING SYSTEMS
, 1982
"... Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree Theorem ..."
Abstract

Cited by 296 (24 self)
 Add to MetaCart
Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree
Commutativity of term rewriting systems
 In The Second FranceJapan Arti¯cial Intelligence and Computer Science Symposium
, 1987
"... Commutativity is very useful in showing the ChurchRosser property for the union of term rewriting systems. This paper studies the critical pair technique for proving commutativity of term rewriting systems. Extending the concept of critical pairs between two term rewriting systems, a sufficient con ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
Commutativity is very useful in showing the ChurchRosser property for the union of term rewriting systems. This paper studies the critical pair technique for proving commutativity of term rewriting systems. Extending the concept of critical pairs between two term rewriting systems, a sufficient
Orderal Term Rewriting Systems
"... This article describes a generalization of term rewriting system technique used as a basis for decision algorithm for equational theories. The orderal term rewriting system technique is presented. The main innovation of the proposed technique is that reductions according to some rules of such a syst ..."
Abstract
 Add to MetaCart
This article describes a generalization of term rewriting system technique used as a basis for decision algorithm for equational theories. The orderal term rewriting system technique is presented. The main innovation of the proposed technique is that reductions according to some rules of such a
Addressed Term rewriting Systems: . . .
, 2006
"... We present a formalism called Addressed Term Rewriting Systems, which can be used to model implementations of theorem proving, symbolic computation, and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are there ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a formalism called Addressed Term Rewriting Systems, which can be used to model implementations of theorem proving, symbolic computation, and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems
Counterexamples to terminating for the direct sum of term rewriting systems
 Information Processing Letters
, 1986
"... The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that the direct sum of two term rewriting systems is not terminating, even if these systems are both terminating. ..."
Abstract

Cited by 95 (2 self)
 Add to MetaCart
The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that the direct sum of two term rewriting systems is not terminating, even if these systems are both terminating.
TREE AUTOMATA AND TERM REWRITE SYSTEMS
"... I. TERM REWRITE SYSTEMS EFFECTIVELY PRESERVING RECOGNIZABILITY Tree automata and recognizable tree languagesproved to be an efficient tool in the theory of term rewrite systems, see [11] for an overview. Let \Sigma be a ranked alphabet, let R be a term rewrite system over \Sigma, and let L be a tre ..."
Abstract
 Add to MetaCart
I. TERM REWRITE SYSTEMS EFFECTIVELY PRESERVING RECOGNIZABILITY Tree automata and recognizable tree languagesproved to be an efficient tool in the theory of term rewrite systems, see [11] for an overview. Let \Sigma be a ranked alphabet, let R be a term rewrite system over \Sigma, and let L be a
Interaction Nets and Term Rewriting Systems
, 1998
"... Term rewriting systems provide a framework in which it is possible to specify and program in a traditional syntax (oriented equations). Interaction nets, on the other hand, provide a graphical syntax for the same purpose, but can be regarded as being closer to an implementation since the reductio ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
Term rewriting systems provide a framework in which it is possible to specify and program in a traditional syntax (oriented equations). Interaction nets, on the other hand, provide a graphical syntax for the same purpose, but can be regarded as being closer to an implementation since
Abstraction of Conditional Term Rewriting Systems
 Proceedings of the 1995 Int’l Symposium on Logic Programming (ILPS’95
, 1995
"... ion of Conditional Term Rewriting Systems Didier Bert and Rachid Echahed IMAGLGI, BP 53 F38041 Grenoble cedex 9, France fbert,echahedg@imag.fr Abstract This paper introduces the notion of abstract domains for constructorbased conditional term rewriting systems and defines the notion of abstr ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
ion of Conditional Term Rewriting Systems Didier Bert and Rachid Echahed IMAGLGI, BP 53 F38041 Grenoble cedex 9, France fbert,echahedg@imag.fr Abstract This paper introduces the notion of abstract domains for constructorbased conditional term rewriting systems and defines the notion
Results 1  10
of
4,406,867