An object-oriented approach to algebra system design
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
AXIOM: the scientific computation system
AXIOM: the scientific computation system
How to make AXIOM into a scratchpad
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Signature functions for algebraic numbers
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Infinite structures in SCRATCHPAD II
EUROCAL '87 Proceedings of the European Conference on Computer Algebra
Gaussian elimination: a case study in efficient genericity with MetaOCaml
Science of Computer Programming - Special issue on the first MetaOCaml workshop 2004
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code
Science of Computer Programming
Science of Computer Programming
| Hi-index | 0.00 |
The Gauss package offers Maple users a new approach to programming based on the idea of parameterized types (domains) which is central to the AXIOM system. This approach to programming is now regarded by many as the right way to go in computer algebra systems design. In this article, we describe how Gauss is designed and show examples of usage. We end with some comments about how Gauss is being used in Maple.