TY - GEN

T1 - Domains and expressions: an interface between two approaches to computer algebra

AU - Oancea, Cosmin Eugen

AU - Watt, Stephen M.

N1 - @inproceedings{Oancea:2005:DEI:1073884.1073921, author = {Oancea, Cosmin E. and Watt, Stephen M.}, title = {Domains and Expressions: An Interface Between Two Approaches to Computer Algebra}, booktitle = {Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation}, series = {ISSAC '05}, year = {2005}, isbn = {1-59593-095-7}, location = {Beijing, China}, pages = {261--268}, numpages = {8}, url = {http://doi.acm.org/10.1145/1073884.1073921}, doi = {10.1145/1073884.1073921}, acmid = {1073921}, publisher = {ACM}, address = {New York, NY, USA}, }

PY - 2005

Y1 - 2005

N2 - This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach to structuring computer algebra software: using an efficient, compiled language, designed for writing large complex mathematical libraries, together with a top-level system based on user-interface priorities and ease of scripting.We examine what is required to use Aldor libraries to extend Maple in an effective and natural way. Since the computational models of Maple and Aldor differ significantly, new run-time code must implement a non-trivial semantic correspondence. Our solution allows Aldor functions to run tightly coupled to the Maple environment, able to directly and efficiently manipulate Maple data objects. We call the overall system Alma.

AB - This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach to structuring computer algebra software: using an efficient, compiled language, designed for writing large complex mathematical libraries, together with a top-level system based on user-interface priorities and ease of scripting.We examine what is required to use Aldor libraries to extend Maple in an effective and natural way. Since the computational models of Maple and Aldor differ significantly, new run-time code must implement a non-trivial semantic correspondence. Our solution allows Aldor functions to run tightly coupled to the Maple environment, able to directly and efficiently manipulate Maple data objects. We call the overall system Alma.

U2 - 10.1145/1073884.1073921

DO - 10.1145/1073884.1073921

M3 - Article in proceedings

SN - 1-59593-095-7

SP - 261

EP - 268

BT - Proceedings of the 2005 international symposium on Symbolic and algebraic computation (ISSAC'05)

PB - ACM

ER -