Universal Object Oriented Languages and Computer Algebra
Alexander Yu. Vlasov (FCR/IRH, St.-Petersburg, Russia)

TL;DR
This paper explores the potential of applying object-oriented programming concepts to computer algebra systems to enhance their flexibility and efficiency, especially when standard software packages are insufficient.
Contribution
It proposes extending object-oriented models to include manipulation of pure functions and algebraic expressions within computer algebra systems.
Findings
Object-oriented approaches can improve computer algebra manipulation.
Functional and object-oriented paradigms are compatible.
Potential for more flexible algebraic computation models.
Abstract
The universal object oriented languages made programming more simple and efficient. In the article is considered possibilities of using similar methods in computer algebra. A clear and powerful universal language is useful if particular problem was not implemented in standard software packages like REDUCE, MATHEMATICA, etc. and if the using of internal programming languages of the packages looks not very efficient. Functional languages like LISP had some advantages and traditions for algebraic and symbolic manipulations. Functional and object oriented programming are not incompatible ones. An extension of the model of an object for manipulation with pure functions and algebraic expressions is considered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Constraint Satisfaction and Optimization · Computability, Logic, AI Algorithms
