The SMP pattern matcher

Greif, J. M.

doi:10.1007/3-540-15984-3_281

Cited by 5 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Treating Macsyma as such a framework, it would seem that it has a variety of partially useful techniques, but it is apparent that the final resolution of pattern-matching has not been found. In particular, papers continue to be written about matching as done, for example, in the SMP system [16], alternatives in Macsyma [3], and in the massive literature on unification, theorem proving, the programming language Prolog, and the consequences of matching, backtracking, etc. (see, for example, [26]).…”

Section: Summary Of Matchingmentioning

confidence: 99%

A review of Macsyma

Fateman

1989

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

We review the successes and failures of the Macsyma algebraic manipulation system from the point of view of one of the original contributors. We provide a retrospective examination of some of the controversial ideas that worked, and some that did not. We consider input/output, language semantics, data types, pattern matching, knowledge-adjunction, mathematical semantics, the user community, and software engineering. We also comment on the porting of this system to a variety of computing systems, and possible future directions for algebraic manipulation system-building.

show abstract

Section: Summary Of Matchingmentioning

confidence: 99%

A review of Macsyma

Fateman

1989

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…The tabular approach, sometimes called "memo-ization" is discussed by Bentley [2) and Abelson/Sussman [1], and has been used by the Maple [4] and SMP [6] systems. Although the methodology has been described and is widely believed to save time, no published evaluations of this feature have appeared.…”

Section: Title (Include Securitymentioning

confidence: 99%

Augmenting Expensive Functions in Macsyma with Lookup Tables

Ponder¹,

Fateman²,

Graham³

1987

View full text Add to dashboard Cite

Arpa Order No. 4871 JUL 2 21 988 * a p tUNIX is a trademark of AT&T Bell Laboratories DrzMW1-m,-'N =TL:NT Ak II r) iC 11# ' '. mited SECURiTY CLASSIFICATION OF THIS PAGE REPORT DOCUMENTATION PAGE la. REPORT SECURITY CLASSIFICATION lb. RESTRICTIVE MARKINGS unclassified 2a. SECURITY CLASSIFICATION AUTHORITY 3 DISTRIBUTION /AVAILABILITY OF REPORT unlimited 2b. DECLASSIFICATION / DOWNGRADING SCHEDULE 4. PERFORMING ORGANIZATION REPORT NUMBER(S) S. MONITORING ORGANIZATION REPORT NUMBER(S) 6a. NAME OF PERFORMING ORGANIZATION 6b. OFFICE SYMBOL 7a. NAME OF MONITORING ORGANIZATION The Regents of the University (if applicable) of California SPAWAR 6c. ADDRESS (City, State, and ZIPCode) 7b. ADDRESS (City, State, and ZIP Code

show abstract

“…In fact, the cost would be exponential in n. By "remembering" the values of each f [nl when first computed, Macsyma makes the algorithm essentially linear in time. Other systems, most notably SMP [5], Maple [3], and Mathematics [lo], make a point of emphasizing similar features. This technique is eloquently described in an introductory Computer Science text by H. Abelson and G. Sussman (exercise 3.27, page 218 of [l]) Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Asociation for Computing Machinery.…”

mentioning

confidence: 99%

Lookup tables, recurrences and complexity

Fateman

1989

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation - ISSAC '89

View full text Add to dashboard Cite

The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by several algebraic manipulation systems, it has not been examined critically in the literature. While the use of tabulation or "memoization" seems to be a particularly simple and worthwhile technique in some areas, there are some negative consequences. Furthermore, the expansion of this technique to other areas (other than recurrences) has not been subjected to analysis.This paper examines some of the assumptions. A more detailed technical report [9] is under preparation.

show abstract

The SMP pattern matcher

Cited by 5 publications

References 3 publications

A review of Macsyma

A review of Macsyma

Augmenting Expensive Functions in Macsyma with Lookup Tables

Lookup tables, recurrences and complexity

Contact Info

Product

Resources

About