Using category theory to design implicit conversions and generic operators

  • John C. Reynolds
Compiling And Algebraic Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 94)


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.


Natural Transformation Free Algebra Conversion Function Left Adjoint Unique Morphism 
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.


  1. 1.
    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.Google Scholar
  2. 2.
    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).CrossRefGoogle Scholar
  3. 3.
    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).Google Scholar
  4. 4.
    Birkhoff, G., and Lipson, J. D., "Heterogeneous Algebras", Journal of Combinatorial Theory 8, pp. 115–133 (1970).Google Scholar
  5. 5.
    Higgins, P. J., "Algebras with a Schema of Operators", Math. Nachr. 27, pp. 115–132 (1963).Google Scholar
  6. 6.
    Morris, J. H., "Types are not Sets", Proc. ACM Symposium on Principles of Programming Languages, pp. 120–124, Boston (1973).Google Scholar
  7. 7.
    Reynolds, J. C., "Syntactic Control of Interference", Proc. Fifth ACM Symposium on Principles of Programming Languages, pp. 39–46, Tucson (1978).Google Scholar
  8. 8.
    Reynolds, J. C., The Craft of Programming, in preparation.Google Scholar
  9. 9.
    MacLane, S., Categories for the Working Mathematician, Springer-Verlag, New York (1971).Google Scholar
  10. 10.
    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).CrossRefGoogle Scholar
  11. 11.
    Arbib, M. A., and Manes, E. G., Arrows, Structures, and Functors — The Categorical Imperative, Academic Press, New York (1975).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • John C. Reynolds
    • 1
  1. 1.Syracuse UniversitySyracuse

Personalised recommendations