D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Words Problems in Universal Algebras, pages 263-297. J. Leech, ed. Pergamon Press, Oxford, U. K., 1970. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Architectural Specification, Exploration and.. - Ayala-Rincon.. (2002) (Correct)
....purposes. Our investigation shows that simulation at rewriting logic level may provide useful insights to guide the architectural design. Keywords: Rewriting logic, High Level Speci cation and Simulation, Design Environment. 1 Introduction Since the seminal paper of Knuth and Bendix [12], the importance and applicability of Term Rewriting Systems (TRSs) and theory has been made evident in a great variety of elds of Computer Science. A lot of work has been developed which explores the simplicity of the computational formal framework given by rewriting for its application in areas ....
D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Words Problems in Universal Algebras, pages 263-297. J. Leech, ed. Pergamon Press, Oxford, U. K., 1970.
Efficient Computation of Algebraic Operations over .. - Ayala-Rincon.. (2003) (Correct)
....architectures. We show how the conceived architectures are adapted for the efficient implementation of algebraic operations such as matrix multiplication and the Fast Fourier Transform FFT. After the seminal work of Knuth Bendix about the completion of algebraic equational specifications [17], rewriting has been successfully applied into different areas of computer science as an abstract formalism for assisting the simulation, verification and deduction of complex computational objects and processes. In the context of computer architectures, rewriting theory has been applied as a tool ....
D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Word Problems in Universal Algebras, pages 263-297. J. Leech, ed., Pergamon Press, Oxford, 1970.
Transforming CRSs into TRSs -- About Elimination of the.. - Rincón (Correct)
....of R (obtained by overlapping l 2 r 2 with l 1 r 1 at position ) It is well known that for TRSs local confluence is equivalent to joinability of all critical pairs. This result is known as the critical pair lemma, which, originally, was proved by Knuth Bendix using termination hypothesis [KB70]. Subsequently, Huet obtained the final version of the lemma without termination hypothesis [Hue80] A TRS R is said to be non overlapping if there are no critical pairs beetwen rules of R. A term is linear if every variable occurs at most once. A TRS is left linear if every left hand side of its ....
D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Words Problems in Universal Algebras, pages 263--297. J. Leech, ed. Pergamon Press, Oxford, U. K., 1970.
Confluence of Term Rewriting Systems under Joinability of.. - Rincón (Correct)
....termination have been developed, see for example [Ste94] For terminating rewriting systems, finite criteria to guarantee confluence have been developed too. In fact, as it is well known, the critical pair lemma enables a finite test for confluence of (finite) terminating term rewriting systems [KB70]. Also, these properties have been exhaustively examined for conditional rewriting systems (see for example [Aya94] Gra94] which are probably the most important extension of purely equational rewriting, because they represent a model of computation for which, in the case that the conditions ....
....of R (obtained by overlapping l 2 r 2 with l 1 r 1 at position ) It is well known that for TRSs local confluence is equivalent to joinability of all critical pairs. This result is know as the critical pair lemma, which, originally, was proved by Knuth Bendix using termination hypothesis [KB70]. Subsequently, Huet obtained the final version of the lemma without termination hypothesis [Hue80] A TRS R is said to be non overlapping if there are no critical pairs beetwen rules of R. It is left linear (LL) if every variable occurs at most once in every left hand side of all rules of R. A ....
D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Words Problems in Universal Algebras, pages 263--297. J. Leech, ed. Pergamon Press, Oxford, U. K., 1970.
Architectural Speci - Cation Exploration And (2002) (Correct)
No context found.
D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Words Problems in Universal Algebras, pages 263-297. J. Leech, ed. Pergamon Press, Oxford, U. K., 1970.
Architectural Specification and Simulation Through.. - Mauricio.. (Correct)
No context found.
D. E. Knuth and P. B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Words Problems in Universal Algebras, pages 263--297. J. Leech, ed. Pergamon Press, Oxford, U. K., 1970.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
P. Bendix and D. Knuth. Computational problems in abstract algebra, chapter Simple word problems in universal algebra. Pergamon Press, 1970.
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (2 citations) (Correct)
No context found.
P. Bendix and D. Knuth. Computational problems in abstract algebra, chapter Simple word problems in universal algebra. Pergamon Press, 1970.
Lifting - McAllester (1992) (Correct)
No context found.
Donald E. Knuth and Peter B. Bendix. Computational Problems in Abstract Algebra, chapter Simple Word Problems in Universal Algebras, pages 263--297. Pergamon Press, Oxford, England, 1969.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC