Abstract
We examine type systems for support of subtypes and categories in computer algebra systems. By modelling representation of instances in terms of existential types instead of recursive types, we obtain not only a simplified model, but we build a basis for defining subtyping among algebraic domains. The introduction of metaclasses, facilitates the task, by allowing the inference of type classes. By means of type classes and existential types we construct subtype relations without involving coercions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Bruce, J. Mitchell. PER models of subtyping, recursive types and higher order poly morphism. 19th ACM Symposium on Principles of Programming Languages. New Mexico, Jan.1992.
L. Cardelli. Structural Subtyping and the notion of Power Type. 15th ACM Sumposium POPL. CA, Jan. 1988.
L. Cardelli. Typed Foundations for object-oriented programming. Tutorial at POPL, Jan. 1992.
L. Cardelli, P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys. 17(4). 1985.
W. Cook, W. Hill, P. Canning. Inheritance is not Subtyping. 17thPOPL, ACM Press, Jan 1990.
G. Ghelli. Modelling features of object-oriented languages in second order functional languages with subtypes. in Foundations of OOP. Lecture Notes in Computer Science (489). Springer Verlag, 1991.
A. Goldberg. Smalltalk-80. second edition, Addison-Wesley, 1989.
P. Grogono. The Dee Report. Technical Report. CS, Concordia U. Montreal, Canada. Jan. 1991.
P. Grogono, P.S. Santas. On Equality and Abstractions. To be published at JOOP.
R.D. Jenks, R.S. Sutor. Axiom: The Scientific Computation System. NAG. Springer Ve rlag. 1992.
R.D. Jenks, B. Trager, S. M. Watt, R S. Sutor. Scratchpad II Programming Language Manual, IBM, 1985.
B. Meyer. Eiffel: The language. Prentice Hall. 1991.
J. Mitchell. Polymorphic type Inference and containement. Information and Computation (76). 1988.
J. Mitchell, S. Meldal, N. Madhav. An extension of SML modules with subtyping and inheritance. 18th Sumposium POPL, FL, Jan. 1991.
J. Mitchell, G. Plotkin. Abstract Types have Existential Type. ACM Transactions on Programming Languages and Systems. 10(3), 1988.
B. Pierce. Programming with Intersection Types and Bounded Polymorphism. PhD thesis, CMU. Dec 1991.
B. Pierce, D. Turner. Type Theoretic Foundations for OOP. Report. Dept of CS, U. of Edinbourgh. 1992.
P.S. Santas. Classes and Metaclasses. tech. report, Dept. of CS, ETH Zurich. 1993.
P.S. Santas. Multiple Subclassing and Subtyping for Symbolic Computation. Proc. of Workshop on Multiple Inheritance and Multiple Subtyping. ECOOP 92. Utrecht, Netherlands. June 1992.
R.S. Sutor, R.D.Jenks. The Type Inference and Coercion facilities of the Scratchpad II Interpreter. IBM Tech. Report. March 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santas, P.S. (1993). A type system for computer algebra. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013177
Download citation
DOI: https://doi.org/10.1007/BFb0013177
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57235-0
Online ISBN: 978-3-540-47985-7
eBook Packages: Springer Book Archive