Abstract
We present here an assume facility for computer algebra systems. The tool is to facilitate a means to resolve branching problems in a computer algebra program of the kind “if object has a certain property then ... else ...”. The approach is based on the key idea that first the calculations performed on an object is duplicated on the object's initial property. The so computed property can then be tested against the primary queried property. To demonstrate that this concept in realisable we implemented it in Maple.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. Char, K. Geddes, G. Gaston, B. Leong, M. Monagan, and S. Watt. Maple V Language Reference Manual. Springer-Verlag, New York, 1991.
B. Char, K. Geddes, G. Gaston, B. Leong, M. Monagan, and S. Watt. Maple V Library Reference Manual. Springer-Verlag, New York, 1991.
T. Weibel and G. Gonnet. An algebra of properties. In S.M. Watt, editor, Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation: ISSAC '91. pages 352–359, New York, 1991. ACM Press. held in Bonn, Germany.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weibel, T., Gonnet, G.H. (1993). An assume facility for CAS, with a sample implementation for Maple. In: Fitch, J. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1992. Lecture Notes in Computer Science, vol 721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57272-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-57272-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57272-5
Online ISBN: 978-3-540-48031-0
eBook Packages: Springer Book Archive