G. Grivas and R. E. Maeder, Matching and unification for the object-oriented symbolic computation system algbench, Proc. of Design and Implementation of Symbolic Computation Systems DISCO '93. Lecture Notes in Computer Science, 1993, pp. 164--176. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Inheritance of Rewrite Rule Structures Applied to Symbolic.. - Harris (1994) (Correct)
....of Mathematica syntax used in this paper) This presentation of rewrite rule inheritance is, to my knowledge, unique. Limongelli [6] comes close to the topics covered here, but her paper is very different. It is mostly theoretical and she treats objects classically. Another nice paper is [2] by Grivas Maeder. Their paper also uses a system of inheritance but they do not describe how it is implemented. In their system it appears that it would be difficult to perform some of the examples in the sections below. Nonetheless, it is very interesting. In [8] Maeder describes how to ....
....easily handled. 6 A Weakly Typed Example Up to this point the structures considered have been strongly typed or best described as strongly typed, which means that the type of every expression is known and specified. In contrast the following example, which is the same as that in Grivas Maeder [2], presents a simple example of inheritance of a weakly typed specification of Log. First our abstract specification of the properties of Log can be given by 8a; b Log(a b) Log(a) Log(b) 42) 8a; b Log(b a ) aLog(b) 43) We can symbolically specify this in Mathematica by the following ....
[Article contains additional citation context not shown here]
G. Grivas and R. E. Maeder, Matching and unification for the object-oriented symbolic computation system algbench, Proc. of Design and Implementation of Symbolic Computation Systems DISCO '93. Lecture Notes in Computer Science, 1993, pp. 164--176.
Efficient Integration of Declarative Paradigms into Symbolic.. - Georgios Grivas (1994) Self-citation (Grivas) (Correct)
....Given a problem, the user can take one style related to its requirements or combine them in a seamless interface. The need for more logic and proving capabilities in systems doing mathematics (especially in Mathematica) is highlighted in [3] Besides pattern matching, we have also introduced in [7] unification as a primitive operation in AlgBench s term rewriting environment. Another paradigm whose need for mathematical programs has been shown early in [17] is that of constraint based programming. Although, compared to other constraint languages, the existing symbolic computation systems ....
G. Grivas and R. E. Maeder. Matching and Unification for the Object-Oriented Symbolic Computation System AlgBench. In Proc. of the 3rd Intern. Symposium on Design and Implementation of Symbolic Computation Systems (DISCO'93), Springer-Verlag, LNCS 722, Gmunden, Austria, September 1993.
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