Abstract
A general homomorphic overloading in a first-order type system is discussed and its attendant subtype inference problem is formulated. We propose a computationally efficient type inference algorithm by converting the attendant constraint-satisfaction problem into the algebraic path problem for a constraint graph weighted with elements of a specially constructed non-commutative star semiring. The elements of the semiring are monotonic functions from integers to integers (including ±∞) with pointwise maximum and function composition as semiring operations. The computational efficiency of our method is due to Kleene’s algebraic path method’s cubic complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cardelli, L., Wegner, P.: On understanding types, data abstraction, and polymorphism. Computing Surveys 17(4), 471–522 (1985)
Mitchell, J.: Type inference with simple subtypes. Journal of Functional Programming 1, 245–285 (1991)
Lievant, D.: Discrete Polymorphism. In: Proc. 1990 ACM Conference on LISP and Functional Programming, pp. 288–297 (1990)
Shafarenko, A.: Coercion as homomorphism: type inference in a system with subtyping and overloading. In: PPDP 2002, Pittsburg, PA, October 6-8 (2002)
Shafarenko, A.: RETRAN: a Recurrent Paradigm for Data-Parallel Computing. Computer Systems Science and Engineering 11(4), 201–209 (1996)
Reynolds, J.C.: Using category theory to design implicit conversions and generic operators. In: Jones, N.D. (ed.) Semantics-Directed Compiler Generation. LNCS, vol. 94, pp. 211–258. Springer, Heidelberg (1980)
Kaes, S.: Type inference in the presence of overloading, subtyping and recursive types. In: Proceedings of the 1992 ACM conference on LISP and functional programming, San Francisco, California, United States 1992, pp. 193–204 (1992)
Rote, G.: Path Problems in Graphs. In: Tinhofer, G., Noltemeier, E., Syslo, M. (eds.) Computational Graph Theory, Wien, Computing Suppl. 7, pp. 155–198. Springer, Heidelberg (1990)
Fuh, Y., Mishra, P.: Type inference with subtypes. Theoretical Computer Science 73, 155–175 (1990)
Rehof, J., Mogensen, T.: Tractable constraints in finite semilattices. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 285–300. Springer, Heidelberg (1996)
Shafarenko, A.: Stream Processing on the Grid: an Array Stream Transforming Language. In: SNPD 2003, pp. 268–276
Scholz, S.-B.: Single Assignment C: efficient support for high-level array operations in a functional setting. J. Funct. Program 13(6), 1005–1059 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shafarenko, A., Scholz, SB. (2005). General Homomorphic Overloading. In: Grelck, C., Huch, F., Michaelson, G.J., Trinder, P. (eds) Implementation and Application of Functional Languages. IFL 2004. Lecture Notes in Computer Science, vol 3474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11431664_12
Download citation
DOI: https://doi.org/10.1007/11431664_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26094-3
Online ISBN: 978-3-540-32038-8
eBook Packages: Computer ScienceComputer Science (R0)