Implementing a computer algebra system in Haskell.

Submitted by Oliveira Flávia (flavia@sisbin.ufop.br) on 2015-01-22T19:39:16Z No. of bitstreams: 1 ARTIGO_ImplementingComputerAlgebra.pdf: 250588 bytes, checksum: 52b0496593babf63e20bbe5290a94292 (MD5)Approved for entry into archive by Gracilene Carvalho (gracilene@sisbin.ufop.br) on 2015-01-26T11:13:30Z (GMT) No. of bitstreams: 1 ARTIGO_ImplementingComputerAlgebra.pdf: 250588 bytes, checksum: 52b0496593babf63e20bbe5290a94292 (MD5)Made available in DSpace on 2015-01-26T11:13:30Z (GMT). No. of bitstreams: 1 ARTIGO_ImplementingComputerAlgebra.pdf: 250588 bytes, checksum: 52b0496593babf63e20bbe5290a94292 (MD5) Previous issue date: 2007There are basically two kinds of mathematical computation, numerical and symbolic. Numerical algorithms are usually implemented in strongly typed languages, and compiled with a view to efficiency. Symbolic algorithms are mostly written for interpreters in untyped languages. Therefore, symbolic mathematics is usually slow, and bug ridden. Since symbolic algorithms are usually more difficult to implement, there are also very few computer algebra systems. This paper presents a computer algebra system that is both fast, and implemented in a strongly typed language, and designed to accept compiled extensions. The authors describe a scheme to achieve these goals without creating difficulties for the end-user. The reason for creating this new computer algebra system is to make feasible mixed computation, i.e., programming software that needs both numerical computation and computer algebra. For instance, Finite Element Methods require a lot of number crunching as well as computer algebra to perform triangularization, manipulating shape functions, etc. Mixed computation requires speed and safety that interpreted computer algebra cannot provide