The type inference and coercion facilities in the scratchpad II interpreter
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
A semantics of multiple inheritance
Information and Computation - Semantics of Data Types
Proceedings of the Second European Symposium on Programming
Semantics in algebraic computation
Proceedings of the third conference on Computers and mathematics
A rewrite-based type discipline for a subset of computer algebra
Journal of Symbolic Computation
Operating computer algebra systems by handprinted input
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
AXIOM: the scientific computation system
AXIOM: the scientific computation system
Type inference in the presence of overloading, subtyping and recursive types
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Algorithmic aspects of type inference with subtypes
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A polymorphic functional language applied to symbolic computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Design and Implementation of Symbolic Computation Systems: International Symposium, Disco '93, Gmunden, Austria, September 1993: Proceedings
Efficient Type Inference and Coercion in Computer Algebra
DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
On Coherence in Computer Algebra
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
The Weyl Computer Algebra Substrate
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
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
An Order-Sorted Approach to Algebraic Computation
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
A Type System for Computer Algebra
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Extending AlgBench with a Type System
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
A Type-Coercion Problem in Computer Algebra
AISMC-1 Proceedings of the International Conference on Artificial Intelligence and Symbolic Mathematical Computation
Modeling inheritance as coercion in a symbolic computation system
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Abstract Data Types in Computer Algebra
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
This paper presents algorithms that perform a type inference for a type system occurring in the context of computer algebra. The type system permits various classes of coercions between types and the algorithms are complete for the precisely defined system, which can be seen as a formal description of an important subset of the type system supported by the computer algebra program AXIOM.Previously only algorithms for much more restricted cases of coercions have been described or the frameworks used have been so general that the corresponding type inference problems were known to be undecidable.