Abstract
A generalization of many-sorted algebras, called category-sorted algebras, is defined and applied to the language-design problem of avoiding anomalies in the interaction of implicit conversions and generic operators. The definition of a simple imperative language (without any binding mechanisms) is used as an example.
Work supported by National Science Foundation Grant MCS 75-22002.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Goguen, J. A., "Order Sorted Algebras: Exceptions and Error Sorts, Coercions and Overloaded Operators", Semantics and Theory of Computation Report #14, Computer Science Department, U.C.L.A., (December 1978). To appear in Journal of Computer and Systems Science.
Goguen, J. A., Thatcher, J. W., Wagner, E. G., and Wright, J. B., "Initial Algebra Semantics and Continuous Algebras", Journal ACM 24 (1) pp. 68–95 (January 1977).
Burstall, R. M., and Landin, P. J., "Programs and Their Proofs: An Algebraic Approach", in Machine Intelligence 4, B. Meltzer and D. Michie, Eds., Edinburgh University Press, pp. 17–43 (1969).
Birkhoff, G., and Lipson, J. D., "Heterogeneous Algebras", Journal of Combinatorial Theory 8, pp. 115–133 (1970).
Higgins, P. J., "Algebras with a Schema of Operators", Math. Nachr. 27, pp. 115–132 (1963).
Morris, J. H., "Types are not Sets", Proc. ACM Symposium on Principles of Programming Languages, pp. 120–124, Boston (1973).
Reynolds, J. C., "Syntactic Control of Interference", Proc. Fifth ACM Symposium on Principles of Programming Languages, pp. 39–46, Tucson (1978).
Reynolds, J. C., The Craft of Programming, in preparation.
MacLane, S., Categories for the Working Mathematician, Springer-Verlag, New York (1971).
Reynolds, J. C., "GEDANKEN — A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept", Comm. ACM 13 (5), pp. 308–319 (May 1970).
Arbib, M. A., and Manes, E. G., Arrows, Structures, and Functors — The Categorical Imperative, Academic Press, New York (1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reynolds, J.C. (1980). Using category theory to design implicit conversions and generic operators. In: Jones, N.D. (eds) Semantics-Directed Compiler Generation. SDCG 1980. Lecture Notes in Computer Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10250-7_24
Download citation
DOI: https://doi.org/10.1007/3-540-10250-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10250-2
Online ISBN: 978-3-540-38339-0
eBook Packages: Springer Book Archive