Software Portability for Computer Algebra
Arthur C. Norman, Stephen M. Watt

TL;DR
This paper discusses the evolution of software portability in computer algebra systems, highlighting past achievements, current challenges, and ongoing developments in ensuring cross-platform compatibility.
Contribution
It provides a historical perspective and analysis of how computer algebra systems have achieved and maintained portability over time.
Findings
Portability strategies vary across systems.
Challenges in maintaining portability persist.
Evolving issues influence future development.
Abstract
We have been involved in the creation of multiple software systems for computer algebra, including Reduce, Maple, Axiom and Aldor as well as a number of smaller specialised programs. We relate observations on how the meaning of software portability has changed over time and how it continues to evolve. We describe how the systems with which we have first-hand experience have achieved portability, how the central issues have changed over time and the challenges that remain.
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 · Software Reliability and Analysis Research · Formal Methods in Verification
