J. A. Goguen and J. Meseguer, Software for the rewrite rule machine, in: Proc. of the Int. Conf. on Fifth Generation Computer Systems (ICOT, Tokyo, Japan, 1988) 628--637.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....one of applying transformations to a set or multiset of constraints. Furthermore, many authors have realized that the most elegant and simple way to specify, prove correct, or even implement many constraint solving problems is by expressing those transformations as rewrite rules (see for example [34, 53, 21, 22, 90]) In particular, the survey by Jouannaud and Kirchner [53] makes this viewpoint the cornerstone of a unified conceptual approach to unification. For example, the so called decomposition transformation present in syntactic unification and in a number of other unification algorithms can be ....

J. A. Goguen and J. Meseguer, Software for the Rewrite Rule Machine, in: Proc. of the Int. Conf. on Fifth Generation Computer Systems, Tokyo, Japan, ICOT, 1988, pages 628--637.

No context found.

J. A. Goguen and J. Meseguer, Software for the rewrite rule machine, in: Proc. of the Int. Conf. on Fifth Generation Computer Systems (ICOT, Tokyo, Japan, 1988) 628--637.

.... allowing structured data in tokens [5] and was used to verify compilers for parallel programming languages in the esprit sponsored procos project [137, 138] In addition, OBJ serves as a programming language for the massively parallel Rewrite Rule Machine, which executes rewrite rules directly [63, 152, 106, 75, 107, 2, 54, 1]; in fact, given equal silicon floorspace and development effort, OBJ on such a machine could out perform a conventional language on a conventional machine, because of the direct concurrent execution of rewrite rules. Some examples using OBJ3 for theorem proving and hardware verification from [51] ....

..... should be: 123 C.3 Unification The use of associative and or commutative matching allows writing a simple and elegant unification algorithm in OBJ3. A more efficient version of this algorithm can be used to implement logic (i.e. relational) programming on the Rewrite Rule Machine; see [75, 107] for more detail. In this code, a term is either a variable (such as X) or else is of the form F[T] where F is an operator symbol (such as F) and T is a list of terms; a constant is of the form F[nil] An equation is a pair of terms separated by = and a system of equations is a list of ....

Joseph Goguen and Jos'e Meseguer. Software for the Rewrite Rule Machine. In Hideo Aiso and Kazuhiro Fuchi, editors, Proceedings, International Conference on Fifth Generation Computer Systems 1988.

.... claims speeds comparable to compiled Lisp on sequential machines for a (restricted) class of equations, and the Rewrite Rule Machine Project at SRI is developing a parallel architecture on which term rewriting promises to be much more efficient than conventional languages on conventional machines [51, 31]; see also [46] for a survey of efficient implemention techniques for higher order functional programming. Term rewriting provides a complete deductive system for equality, and any expression reduces to a unique canonical form (one that cannot be further rewritten) provided certain simple ....

Joseph Goguen and Jos'e Meseguer. Software for the Rewrite Rule Machine. In Hideo Aiso and Kazuhiro Fuchi, editors, Proceedings, International Conference on Fifth Generation Computer Systems

.... Alvey Project, and will be collected with some more recent work in a book on the practical use of OBJ [35] OBJ is also being combined with Petri nets, thus allowing structured data in tokens [2] and is one language for programming a massively parallel machine that executes rewrite rules directly [61, 42]; in fact, we believe that OBJ on such a machine should greatly out perform a conventional language on a conventional machine, by direct concurrent execution of rewrite rules; however, FOOPS offers some further advantages. 2 Aspects of OBJ This section is a rather lengthy, but still incomplete ....

Joseph Goguen and Jos'e Meseguer. Software for the Rewrite Rule Machine. In Proceedings, International Conference on Fifth Generation Computer Systems 1988, pages 628--637. Institute for New Generation Computer Technology (ICOT), 1988.

....parallel machines. A successful model should be abstract enough to avoid the implementation details of particular machines, and yet concrete enough to serve as an intermediate target language for compilers. Graph rewriting provides one promising area within which to search for such models [43, 32, 15, 41], and colimits seem to be quite useful here [10, 58, 44] Graph rewriting is also important for the unification grammars that are now popular in linguistics [60, 22] There seem to be many opportunities for further research in these areas. 6.3 Initiality. The simplest possible diagram is the empty ....

Joseph Goguen and Jos'e Meseguer. Software for the Rewrite Rule Machine. In Hideo Aiso and Kazuhiro Fuchi, editors, Proceedings, International Conference on Fifth Generation Computer Systems 1988, pages 628--637. Institute for New Generation Computer Technology (ICOT), 1988.

....choices for programming such applications as vision, real time plant control, simulations, and expert systems, because they do not require explicit commitment to specific forms of synchronization or scheduling. These convictions are supported by extensive simulations, and by compilation techniques [12, 1, 20] making functional (e.g. OBJ [8] object oriented (e.g. Maude [17] FOOPS [11] and relational (e.g. Eqlog [10] programming languages easy to compile into RRM code. However, it is a fact of life that some parts of large applications programs have already been written, and it may not be ....

Joseph Goguen and Jos'e Meseguer. Software for the rewrite rule machine. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, pages 628--637. ICOT, 1988.

....Horn clause logic with equality. All implementations of these systems were built on top of OBJ3. This research direction went so far as designing and prototyping special purpose hardware, the Rewrite Rule Machine, for executing declarative languages efficiently, based on term rewriting chips [98, 133, 57]. Despite all the interest once shown in declarative programming, the Fifth Generation, etc. there seems to be little interest in precise explications for declarative and logical programming and reflection, or in general purpose declarative architectures. See [11] for the latest on reflective ....

Joseph Goguen and Jos'e Meseguer. Software for the Rewrite Rule Machine. In Hideo Aiso and Kazuhiro Fuchi, editors, Proceedings, International Conference on Fifth Generation Computer Systems 1988, pages 628--637. Institute for New Generation Computer Technology (ICOT), 1988.

.... Petri nets, thus allowing structured data in tokens [4] and is being used to verify compilers for parallel programming languages in the ESPRIT sponsored PROCOS project [115] In addition, OBJ is one of the languages for programming a massively parallel machine that executes rewrite rules directly [51, 128, 86, 59, 87, 2, 46, 1]; in fact, we believe that OBJ on such a machine could greatly out perform a conventional language on a conventional machine, because of the direct concurrent execution of rewrite rules. OBJ3 is applied to theorem proving and hardware verification in [43] and [48] and some examples from [43] are ....

....32) should be: 123 C.3 Unification The use of associative and or commutative matching allows writing a simple and elegant unification algorithm in OBJ3. A more efficient version of this algorithm can be used to implement logic (i.e. relational) programming on the Rewrite Rule Machine; see [59, 87] for more detail. In this code, a term is either a variable (such as X) or else is of the form F[T] where F is an operator symbol (such as F) and T is a list of terms; a constant is of the form F[nil] An equation is a pair of terms separated by = and a system of equations is a list of ....

Joseph Goguen and Jos'e Meseguer. Software for the Rewrite Rule Machine. In Hideo Aiso and Kazuhiro Fuchi, editors, Proceedings, International Conference on Fifth Generation Computer Systems 1988, pages 628--637. Institute for New Generation Computer Technology (ICOT), 1988.

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