The treatment of data types in EL1
Communications of the ACM
MODLISP -- an introduction (invited)
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Design of algebraic data structures with the approach of abstract data types
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Data type specification: Parameterization and the power of specification techniques
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The definition and use of data structures in REDUCE
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Proceedings of the ACM SIGPLAN symposium on Very high level languages
CLU REFERENCE MANUAL
Toward a formal implementation of computer algebra
ACM SIGSAM Bulletin
A system for axiomatic programming
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Interfacing mathemagix with C++
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
This paper reports ongoing research at the IBM Research Center on the development of a language with extensible parameterized types and generic operators for computational algebra. The language provides an abstract data type mechanism for defining algorithms which work in as general a setting as possible. The language is based on the notions of domains and categories. Domains represent algebraic structures. Categories designate collections of domains having common operations with stated mathematical properties. Domains and categories are computed objects which may be dynamically assigned to variables, passed as arguments, and returned by functions. Although the language has been carefully tailored for the application of algebraic computation, it actually provides a very general abstract data type mechanism. Our notion of a category to group domains with common properties appears novel among programming languages (cf. image functor of RUSSELL) and leads to a very powerful notion of abstract algorithms missing from other work on data types known to the authors.